Aiming at the problems of traffic jam and frequent accidents in urban road traffic network, for the first time, the conflict between vehicles at the intersection is taken as an important basis for path planning in Internet of Vehicles. First, the communication range and content of vehicles at the intersection are set in the Internet of vehicles, and the collision probability formulas are discussed. Then, considering the conflict probability, path length and time consumption, a path planning algorithm based on conflict probability is designed. The traditional Dijkstra algorithm is optimized and a real data set is used for extensive experiments, and the actual geographical data is retrieved and displayed in combination with the API of Baidu map. The experiment results show that compared with the traditional shortest path algorithm, the algorithm based on conflict probability can shorten the passing time, avoid congestion and improve the safety of driving, which has high practicability.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Conflict Probability based Path Planning Algorithm for Internet of Vehicles


    Contributors:
    Guo, Ying (author) / Zhang, Yuhan (author) / Niu, Longsheng (author) / Zhang, Rui (author)


    Publication date :

    2021-03-12


    Size :

    2275854 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English




    Conflict-Probability-Estimation-Based Overtaking for Intelligent Vehicles

    Fenghui Wang, / Ming Yang, / Ruqing Yang, | IEEE | 2009



    Multi-Conflict-Based Optimal Algorithm for Multi-UAV Cooperative Path Planning

    Xiaoxiong Liu / Yuzhan Su / Yan Wu et al. | DOAJ | 2023

    Free access

    Research on Multi-UAV Cooperative Dynamic Path Planning Algorithm Based on Conflict Search

    Zhigang Wang / Huajun Gong / Mingtao Nie et al. | DOAJ | 2024

    Free access