Routing for Traffic Networks With Mixed Autonomy

• 成果类型: Article
• 署名作者: Lazar, Daniel A.; Coogan, Samuel; Pedarsani, Ramtin
• 署名单位: University of California System; University of California Santa Barbara; University System of Georgia; Georgia Institute of Technology; University System of Georgia; Georgia Institute of Technology
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2020.3020059
• 发表日期: 2021
• 页码: 2664-2676
• 关键词: Game theory; transportation networks

摘要

In this article, we propose a macroscopic model for studying routing on networks shared between human-driven and autonomous vehicles that captures the effects of autonomous vehicles forming platoons. We use this to study inefficiency due to selfish routing and bound the price of anarchy (PoA), the maximum ratio between total delay experienced by selfish users and the minimum possible total delay. To do so, we establish two road capacity models, each corresponding to an assumption regarding the platooning capabilities of autonomous vehicles. Using these, we develop a class of road delay functions, parameterized by the road capacity, that are polynomial with respect to vehicle flow. We then bound the PoA and the bicriteria, another measure of the inefficiency due to selfish routing, for general networks with multiple source-destination pairs. We find these bounds depend on: the degree of the polynomial in the road delay function; and the degree of asymmetry, the difference in how human-driven and autonomous traffic affect road delay. We demonstrate that these bounds recover the classical bounds when no asymmetry exists. We show the bounds are tight in certain cases and that the PoA bound is order optimal with respect to the degree of asymmetry.