Dynamic Path Planning of Emergency Vehicles Based on Travel Time Prediction

الملخص EN

The dynamic paths planning problem of emergency vehicles is usually constrained by the factors including time efficiency, resources requirement, and reliability of the road network.

Therefore, a two-stage model of dynamic paths planning of emergency vehicles is built with the goal of the shortest travel time and the minimum degree of traffic congestion.

Firstly, according to the dynamic characteristics of road network traffic, a polyline-shaped speed function is constructed.

And then, based on the real-time and historical data of travel speed, a new kernel clustering algorithm based on shuffled frog leaping algorithm is designed to predict the travel time.

Secondly, combined with the expected travel time, the traffic congestion index is defined to measure the reliability of the route.

Thirdly, aimed at the problem of solving two-stage target model, a two-stage shortest path algorithm is proposed, which is composed of K-paths algorithm and shuffled frog leaping algorithm.

Finally, based on the data of floating vehicles of expressway in Beijing, a simulation case is used to verify the above methods.

The results show that the optimization path algorithm meets the needs of the multiple constraints.