arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1603.00939cs.MA
收藏

拥挤交通网络中的自主车辆路径选择:结构特性与协调算法

Routing Autonomous Vehicles in Congested Transportation Networks: Structural Properties and Coordination Algorithms

Rick Zhang, Federico Rossi, Marco Pavone

摘要:

本文考虑了路由和重新平衡共享的自主车队(即,自动驾驶)车辆在容量受限的交通网络内提供按需移动性,其中拥堵可能会破坏吞吐量。我们在网络流框架内对问题进行建模,并表明在相对温和的假设下,如果适当协调,再平衡车辆不会导致拥堵增加(与普遍看法形成鲜明对比)。从算法的角度来看,这种理论见解表明,路由客户和重新平衡车辆的问题可以解耦,这导致了自动驾驶车辆的计算效率路由和重新平衡算法。数值实验和案例研究证实了我们的理论见解,并表明,该算法优于国家的最先进的点对点方法,避免过度拥挤的道路上。总的来说,本文提供了一个严格的方法来解决问题的自主驾驶车辆的自主意识,系统范围内的协调,以及这种机器人系统的可持续性的表征。

英文摘要:

This paper considers the problem of routing and rebalancing a shared fleet of autonomous (i.e., self-driving) vehicles providing on-demand mobility within a capacitated transportation network, where congestion might disrupt throughput. We model the problem within a network flow framework and show that under relatively mild assumptions the rebalancing vehicles, if properly coordinated, do not lead to an increase in congestion (in stark contrast to common belief). From an algorithmic standpoint, such theoretical insight suggests that the problem of routing customers and rebalancing vehicles can be decoupled, which leads to a computationally-efficient routing and rebalancing algorithm for the autonomous vehicles. Numerical experiments and case studies corroborate our theoretical insights and show that the proposed algorithm outperforms state-of-the-art point-to-point methods by avoiding excess congestion on the road. Collectively, this paper provides a rigorous approach to the problem of congestion-aware, system-wide coordination of autonomously driving vehicles, and to the characterization of the sustainability of such robotic systems.

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

↑