Research on optimal emergency evacuation path for mine water inrush based on dynamic D-K algorithm

After the occurrence of mine water inrush, choosing the appropriate emergency evacuation path is very important to reduce the casualty and the mine accident level. The traditional Dijkstra algorithm can not be effectively applied to the dynamic environment of mine water inrush. It can only statically plan a single optimal escape path. In view of the limitations of this algorithm, the time equivalent length is introduced to optimize the traditional Dijkstra algorithm to realize the dynamic change of the optimal escape path with time and water level height. Moreover, the optimized Dijkstra algorithm is combined with the K optimal path algorithm to realize the dynamic planning of multiple optimal escape paths. Field application shows that the optimized dynamic D-K algorithm can be effectively applied to mine water inrush with characteristics of randomness, dynamics and complex, which can provide important decision support for affected personnel to choose emergency escape path.