ReRouting Strategy of Connected and Automated Vehicles Considering Coordination at Intersections
Abstract
In this paper, we propose a rerouting 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 signalfree intersections to accurately predict the travel time for the routing problem. While it is possible to find a systemoptimal solution by comparing all the possible combinations of the routes, this may impose a computational burden. Thus, we instead find a personbyperson 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.
 Publication:

arXiv eprints
 Pub Date:
 October 2022
 DOI:
 10.48550/arXiv.2210.00396
 arXiv:
 arXiv:2210.00396
 Bibcode:
 2022arXiv221000396B
 Keywords:

 Electrical Engineering and Systems Science  Systems and Control
 EPrint:
 6 pages, 4 figures