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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    K-Shortest Routing For Autonomous Driving


    Contributors:
    Xie, Feng (author) / Xie, Yufei (author) / Lam, Soi Hoi (author)


    Publication date :

    2022-10-01


    Size :

    473952 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Genetic Algorithms for Shortest Path Routing of Autonomous Gliders

    Kahveci, N. / Ioannou, P. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2008


    Genetic Algorithms for Shortest Path Routing of Autonomous Gliders

    Kahveci, Nazli / Ioannou, Petros | AIAA | 2008


    VEHICLE ROUTING OPTIMIZED FOR AUTONOMOUS DRIVING

    Samara, Adam / Rempe, Felix / Göttlieh, Simone | British Library Conference Proceedings | 2021


    Vehicle Routing Optimized for Autonomous Driving

    Samara, Adam / Rempe, Felix / Gottlieh, Simone | IEEE | 2021