Re-Routing Strategy of Connected and Automated Vehicles Considering Coordination at Intersections
Re-Routing Strategy of Connected and Automated Vehicles Considering Coordination at Intersections
复制标题
DOI：
10.23919/acc55779.2023.10156555
复制
发表时间：
2022-10
期刊：
影响因子：
--
通讯作者：
Heeseung Bang;Andreas A. Malikopoulos
中科院分区：
文献类型：
--
作者：
Heeseung Bang;Andreas A. Malikopoulos
在本文中，我们提出了一种重路由策略连接和自动车辆（CAV），考虑协调和控制的所有CAV在网络中。每个CAV的目标是找到最小化所有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.