利他的自動運転による混雑緩和:共有道路網における最適均衡の設計
Altruistic Autonomy: Beating Congestion on Shared Roads
人間と自動運転車が混在する並列道路網で、自動運転車の利他的経路選択が混雑に与える影響を交通流モデルで定式化し、予期せぬ需要にも頑健な最適均衡を計算するアルゴリズムを提案した。微小な利他性でも総遅延が大幅に改善し、シミュレーションで最悪の利己均衡から最適均衡へ平均遅延が4分の1になることを示した。
著者: Erdem Bıyık, Daniel Lazar, Ramtin Pedarsani, Dorsa Sadigh
分類: math.OC, cs.RO
原文アブストラクト
Traffic congestion has large economic and social costs. The introduction of autonomous vehicles can potentially reduce this congestion, both by increasing network throughput and by enabling a social planner to incentivize users of autonomous vehicles to take longer routes that can alleviate congestion on more direct roads. We formalize the effects of altruistic autonomy on roads shared between human drivers and autonomous vehicles. In this work, we develop a formal model of road congestion on shared roads based on the fundamental diagram of traffic. We consider a network of parallel roads and provide algorithms that compute optimal equilibria that are robust to additional unforeseen demand. We further plan for optimal routings when users have varying degrees of altruism. We find that even with arbitrarily small altruism, total latency can be unboundedly better than without altruism, and that the best selfish equilibrium can be unboundedly better than the worst selfish equilibrium. We validate our theoretical results through microscopic traffic simulations and show average latency decrease of a factor of 4 from worst-case selfish equilibrium to the optimal equilibrium when autonomous vehicles are altruistic.
