Routing for Traffic Networks with Mixed Autonomy.

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