Implementation of Improved Dijkstra Algorithm for Choosing the Best Escape Route in Mine’s Emergency Rescue

The paper introduced the status of mine’s emergency rescue and determination method of the best escape route. Based on the analysis of Dijkstra’s algorithm and according to features of mine tunnel laneway planar network,it searched the shortest path within a sector region to complete the optimization of the Dijkstra algorithm for escape route in mine’s emergency rescue from restricting search scope and direction. The optimization algorithm can find a shortest path according to start node,goal node and angle of searching sector given by user, and the number of processed nodes account for 2a /360 of classical algorithm, so speed and efficiency of the optimization algorithm are improved.