arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1908.11711eess.SYcs.SY
收藏

拼车网络中的混合自治

Mixed Autonomy in Ride-Sharing Networks

Qinshuang Wei, Ramtin Pedarsani, Samuel Coogan

摘要:

我们考虑由人类驾驶车辆(HV)和自动驾驶车辆(AV)提供服务的乘车共享网络。我们提出了一个在多地点网络的混合自主设置中的乘车共享模型,其中乘车共享平台为乘客设定价格,为HV司机提供补偿,并以固定价格运营AV,目标是利润最大化。当一个地点的车辆比乘客多时,我们考虑三种车辆到乘客的分配可能性:首先将乘坐分配给HV;首先将乘坐分配给AV;按可用HV和AV的数量比例分配乘坐。接下来,对于这些优先级的可能性,我们建立了一个非凸优化问题,其特征在于在稳态平衡下运行的网络的最佳利润。然后,我们提供了一个凸问题,我们表明,有相同的最佳利润,允许有效的计算均衡,我们表明,所有三个优先级的可能性,在相同的最大利润的平台。接下来,我们展示了在某些情况下,平台会选择混合HV和AV以最大化其利润,而在其他情况下,平台将仅使用HV或仅使用AV,这取决于AV的相对成本。对于一类特定的网络,我们充分分析这些阈值的特征,并证明我们的结果的例子。

英文摘要:

We consider ride-sharing networks served by human-driven vehicles (HVs) and autonomous vehicles (AVs). We propose a model for ride-sharing in this mixed autonomy setting for a multi-location network in which a ride-sharing platform sets prices for riders, compensations for drivers of HVs, and operates AVs for a fixed price with the goal of maximizing profits. When there are more vehicles than riders at a location, we consider three vehicle-to-rider assignment possibilities: rides are assigned to HVs first; rides are assigned to AVs first; rides are assigned in proportion to the number of available HVs and AVs. Next, for each of these priority possibilities, we establish a nonconvex optimization problem characterizing the optimal profits for a network operating at a steady-state equilibrium. We then provide a convex problem which we show to have the same optimal profits, allowing for efficient computation of equilibria, and we show that all three priority possibilities result in the same maximum profits for the platform. Next, we show that, in some cases, there is a regime for which the platform will choose to mix HVs and AVs in order to maximize its profit, while in other cases, the platform will use only HVs or only AVs, depending on the relative cost of AVs. For a specific class of networks, we fully characterize these thresholds analytically and demonstrate our results on an example.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑