Conflict Probability based Path Planning Algorithm for Internet of Vehicles

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.