Mine Escape Path Planning Algorithm Based on Simulation Model Technology

When a disaster accident occurs, choosing an escape route quickly and reasonably can not only reduce unnecessary economic losses as much as possible, but also effectively protect the lives of the people. The choice of escape route belongs to the optimal route choice problem in the route planning problem. In recent years, its importance has become more prominent, and it is regarded as a hot spot in many fields for key research. In the field of mine safety, the correct choice of the optimal path can enable underground workers to escape to a safe area in the fastest time when a disaster occurs. The purpose of this paper is to study the algorithm of mine escape route planning based on simulation model technology. After analyzing the related algorithms of path planning, the comparison and selection of algorithms, the Dijkstra algorithm is improved, and various improvement strategies are proposed for various problems existing in the mine. Finally, the improved Dijkstra algorithm is applied to the mine underground point network model during the catastrophe period for simulation experiments. The experimental results show that the improved algorithm can indeed find the optimal escape exit through a single calculation, which basically achieves the purpose of the design.