Vehicle routing through deadlock-free policy for cooperative traffic control in a network of intersections: Reservation and congestion
Vehicle routing through deadlock-free policy for cooperative traffic control in a network of intersections: Reservation and congestion
复制标题
DOI：
10.1109/itsc.2014.6958034
复制
发表时间：
2014-10
期刊：
影响因子：
--
通讯作者：
Florent Perronnet;A. Abbas-Turki;A. E. Moudni
中科院分区：
文献类型：
--
作者：
Florent Perronnet;A. Abbas-Turki;A. E. Moudni
本文考虑了一个网络的交叉路口，穿越自动驾驶汽车。车辆在通过每个十字路口之前都要协商通行权。交叉口的协同交通管理可以保证单个交叉口的高交通性能。本文将交通控制效率问题扩展到交叉口网络。提出了一种层次化的交叉口交通控制体系结构，以防止交通陷入死锁。然后，它讨论了在网络中路由车辆的策略。三种策略被认为是：最短路径，预约和拥塞避免。此外，三个交通环境被认为是和模拟。由于，在交叉口的交通管理是适应当前观察到的车辆，那么模拟表明，它是需要定义新的政策，考虑整体网络性能，而不是根据给定的标准优化每辆车的路线。事实上，根据既定政策调整车辆的方向可能会增加冲突的数量和周期的风险。
This paper considers a network of intersections, traversed by autonomous vehicles. Vehicles negotiate the right-of-way before traversing each intersection. The cooperative traffic management at intersections allows high traffic performance at a single intersection. This paper extends the issue of the traffic control efficiency to a network of intersections. It proposes a hierarchical architecture of the traffic control for preventing traffic from deadlock into a grid of intersections. Then, it discusses policies for routing vehicles in the network. Three policies are considered: shortest path, reservation and congestion avoidance. Furthermore, three traffic contexts are considered and simulated. Since, the traffic management at intersections is adapted to the currently observed vehicles, then the simulation shows that it is required to define new policy that considers the overall network performance rather than optimizing the route of each vehicle according to a given criteria. Indeed, reorienting vehicles according to a given policy can increase the number of conflicts and risks of cycles.