4.7 Article

A Decentralized and Coordinated Routing Algorithm for Connected and Autonomous Vehicles

Journal

IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS
Volume 23, Issue 8, Pages 11505-11517

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TITS.2021.3105057

Keywords

Multiagent coordination; connected and autonomous vehicle; vehicle routing; navigation systems; congested networks

Funding

  1. Pacific Northwest Transportation Consortium (PacTrans) through the project Exploring Weather-Related Connected Vehicle Applications for Improved Winter Travel in the Pacific Northwest

Ask authors/readers for more resources

This paper presents a Decentralized Collaborative Time-dependent Shortest Path Algorithm for connected and autonomous vehicles, leading to significant improvements in system travel time and speed, increased reliability in travel time and speed prediction, as well as enhancements in network utilization.
Aiming for better mobility and more efficient utilization of transportation networks, emergent connected and autonomous vehicle (CAV) technologies, and the resulting communication capabilities can produce more coordinated and efficient routing behavior. Current routing strategies either rely on a centralized control system which can fail in scaling, or employ decentralized schemes that yield sub-optimal coordination and accordingly poor system performance. This paper presents a Decentralized Collaborative Time-dependent Shortest Path Algorithm (Dec-CTDSP) with which the CAVs optimize their routes according to the communicated mobility messages from the other CAVs within their connected cluster. These messages are assumed to carry information regarding the vehicles' location, speed, and preferred path to their destination. We analyzed the impacts of this optimization scheme under various levels of CAV market penetration and communication radius. The results of this study reveal (1) Up to 40% improvement in mean system travel time and speed; (2) Up to 45% increase in travel time and speed prediction reliability; (3) A strong correlation between mean system travel time and network usage distribution; and (4) significant improvements in network utilization as a result of Dec-CTDSP. The performance of Dec-CTDSP, in terms of runtime, convergence, and mobility improvements, is further benchmarked against other random and Dijkstra-based algorithms. The findings of this work will help steer further research on the implementation of coordinated and decentralized multiagent routing optimization in the context of connected and autonomous vehicles.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available