Enforcing optimal routing through dynamic avoidance maps
提出一种城市交通管理新概念，通过将路网分区并广播避让地图，引导车辆分散行驶，在保护隐私的同时缓解拥堵，仿真显示严重拥堵时总出行时间降低约15%。
This paper presents a new concept for operating traffic management at a sizeable urban scale. The overall principle is to partition the network into multiple regions, where traffic conditions should remain optimal. Instead of monitoring the inflow, like for perimeter control, deviations in regional mean speed compared to the reference are transformed into avoidance levels by a centralized controller. That information is broadcasted to vehicles through a public avoidance map. The onboard navigation systems then interpret this map to deliver individual route guidance according to the avoidance levels. In that way, the concept tends to distribute vehicles in the network optimally while preserving privacy. In addition to the controller parameters itself, three other critical parameters define the system: the safety distance, the controller time horizon, and the region sizes. Thorough sensitivity analysis leads to the optimal setting. The concept is proven effective using microsimulation for both a Manhattan and a realistic network. The total travel times is improved by about 15% when traffic is severely congested compared to the uncontrolled case. In the meantime, the mean individual travel distance increase for rerouted vehicles is kept below 10%. Those results have been obtained with a simple decentralized reactive control framework, i.e., an individual proportional feedback system independently governs each region. More advanced formulations introducing cooperation between the regions are also tested. In a nutshell, this paper is a proof of concept for a new control system that appears both practical and valuable to alleviate congestion in urban areas.