The future ITS-based road network can provide a seamless and integrated transportation. The network makes it more complicated for the cars to decide for an optimal choice or K-shortest paths under the autonomous driving situation. The paper presents the description and optimization procedure of a K-shortest path algorithm for autonomous driving in a road network system. Computation analysis was conducted to determine the effectiveness and efficiency of the algorithms and to validate the results. The implementation of such a routing algorithm could enhance the utilization of the autonomous driving system in future.
K-Shortest Routing For Autonomous Driving
2022-10-01
473952 byte
Conference paper
Electronic Resource
English
Genetic Algorithms for Shortest Path Routing of Autonomous Gliders
British Library Conference Proceedings | 2008
|VEHICLE ROUTING OPTIMIZED FOR AUTONOMOUS DRIVING
British Library Conference Proceedings | 2021
|Vehicle Routing Optimized for Autonomous Driving
IEEE | 2021
|Shortest paths for autonomous vehicles
IEEE | 1989
|