Intelligent transportation system (ITS) is a complicated system, and selecting the shortest path is the core of the system. In order to ease traffic congestion of the city, through solving the shortest path, the key technology in realizing the function of ITS, and based on the analysis of traditional Dijkstra algorithm, the paper puts forward the improved algorithm. The new algorithm includes two parts, that is, preprocessing and real-time pruning research, and the effect of pruning totally depends on the division of specific diagram.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Analysis on Improved Dijkstra Algorithm in Intelligent Transportation System



    Published in:

    Publication date :

    2013-08-30


    Size :

    5 pages




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Research on Railway Transportation Route Based on Dijkstra Algorithm

    Di, Junhui / Gao, Ruhu | Springer Verlag | 2022


    Field Environment Intelligent Navigation System for Tomato Transportation Robot Based on Dijkstra

    Guo, Xiaonan / Chen, Yifei / Zhao, Jianwei et al. | British Library Conference Proceedings | 2020


    Field Environment Intelligent Navigation System for Tomato Transportation Robot Based on Dijkstra

    Guo, Xiaonan / Chen, Yifei / Zhao, Jianwei et al. | TIBKAT | 2020


    Field Environment Intelligent Navigation System for Tomato Transportation Robot Based on Dijkstra

    Guo, Xiaonan / Chen, Yifei / Zhao, Jianwei et al. | Springer Verlag | 2019


    Online car-hailing scheduling method based on improved Dijkstra algorithm

    ZHANG JIN / HONG ANDING / LIU XIANFENG et al. | European Patent Office | 2021

    Free access