Research on real-time rescue path planning after earthquake based on priority queue

After a devastating earthquake, it is urgent to launch the lifeline of disaster relief and take timely search and rescue measures for buried personnel. Therefore, real-time rescue route planning has become an important part of post-earthquake rescue work. First of all, the road network is vectorized to establish an undirected graph with the weight of road information taken into account, and on this basis, the post-earthquake rescue route is planned with the goal of minimizing travel time and cost. In real-time response to road congestion and interruption problems in the rescue path, a priority queue is introduced on the basis of the breadth-first algorithm for shortest path. The method of priority queue first-in-first-out, automatic sorting, etc are adopted to rank the paths in real time with the possible option of U-turn strategy. Consequently,the above-mentioned method not only reduces the complexity of the shortest path algorithm but also better reflects the actual situation. Therefore, a real-time fast rescue path planning can be achieved. The algorithm is verified by actual urban roads and the implementation of virtual road blocking and congestion. The calculation speed of the algorithm in this paper is much faster than the traditional shortest path algorithm.