论文标题
连接和自动化车辆的重新穿刺策略，考虑在交叉口进行协调
Re-Routing Strategy of Connected and Automated Vehicles Considering Coordination at Intersections
论文作者
论文摘要
在本文中，我们提出了针对连接和自动化车辆（CAVS）的重新穿线策略，考虑了网络中所有骑士的协调和控制。每个CAV的目的是找到最大程度地减少所有CAV的总旅行时间的路线。我们在无信号交叉点上协调骑士，以准确预测路由问题的旅行时间。尽管可以通过比较路线的所有可能组合来找到系统最佳解决方案，但这可能会施加计算负担。因此，我们相反，我们找到了一个与众不同的最佳解决方案，以减少计算时间，同时仍比自私路由得出更好的解决方案。我们通过网格网络中的模拟来验证我们的框架。
In this paper, we propose a re-routing strategy for connected and automated vehicles (CAVs), considering coordination and control of all the CAVs in the network. The objective for each CAV is to find the route that minimizes the total travel time of all CAVs. We coordinate CAVs at signal-free intersections to accurately predict the travel time for the routing problem. While it is possible to find a system-optimal solution by comparing all the possible combinations of the routes, this may impose a computational burden. Thus, we instead find a person-by-person optimal solution to reduce computational time while still deriving a better solution than selfish routing. We validate our framework through simulations in a grid network.
