Research on the optimal escape path algorithm in mine water bursting disaster

To find the optimal escape path in mine water bursting disaster, present researches have proposed the Dijkstra iterative algorithm. The optimal escape route should be chosen according to the extent of the disaster development and its impact scope. However, the traditional algorithm does not have a real-time analysis on the water flow and the escaping process, thus its solution is not or even far from optimal. Based on the traditional algorithm, this paper puts forward an algorithm with real-time analysis of escaping and water bursting processes. It analyzes water bursting range in real time according to the time of passing through each roadway on a path, and then finds an optimal escape path which is most secure and least time-consuming through comparison. The experiments show that the algorithmis able to find the optimal escape path more effectively compared with other algorithms.