Abstract:As part of the digital mine system, a real time emergency route generating algorithm for a large scale metal mine is  studied. The tunnel is abstracted and mathematically described by the center line model. A series of definitions are made and the center lines are regularized. In order to improve the quality of the final routes, a center line dataset preprocessing is done according to the factors including the slope threshold and the tunnel closed state information, etc. While in preprocessing, the mineshaft and shaft with the steep slope are excluded implicitly. The interface is preserved for point-like objects (e.g. blowers), directions (e.g. wind direction of blowers) and so on. The final path finding algorithm is optimized by the filter operation that the calculation is only performed at the endpoints and hub points, which can further reduce computing data amount. In our experiment, 3 368 nodes out of 22 401 nodes are selected as key nodes, therefore, the data processing amount of the algorithm is reduced to 1/7 and the routes can be found in real time. The algorithm is implemented and integrated into the final digital mine system.

Key words: digital mine; tunnel; path finding problem; DIJKSTRA algorithm; adjacency list