The traffic congestion changes over time in the real transportation network, and the vehicle navigation is a real-time processing. Both the accuracy and time performance of navigation algorithm are important. To respond rapidly to transportation network changes, this paper proposes two new dynamic shortest path algorithms based on the re-optimization method. The algorithms take full advantage of the previous search results, thus they take relatively few computing time to obtain the optimal solution. Experimental results demonstrate that the proposed algorithms can be applied to vehicle navigation in the transportation network with dynamic variation of the travel times on arcs and runs much faster than the traditional Dijkstra algorithm.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A re-optimization dynamic shortest path algorithm for vehicle navigation


    Contributors:
    Jiang, Jincheng (author) / Wu, Lixin (author)


    Publication date :

    2014-07-01


    Size :

    577991 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Optimizing Drone Navigation Using Shortest Path Algorithms

    Girijalaxmi / Houde, Kavita V. / Hegadi, Ravindra S. | Springer Verlag | 2024


    Robot Navigation Beyond Planning the Shortest Path

    Nardi, Lorenzo | BASE | 2021

    Free access

    Shortest Path Optimization Algorithm in Intelligent Transportation System

    Wang, Hao Yu ;Zheng, Yi ;Ji, Xiao Juan | Trans Tech Publications | 2013


    Robot Navigation Beyond Planning the Shortest Path

    Nardi, Lorenzo | TIBKAT | 2021

    Free access

    Dynamic Shortest-Path Algorithm for Continuous Arc Travel Times

    Hu, Jian / Chan, Yupo | Transportation Research Record | 2008