A dynamic rescue route planning method based on 3D network in mine water inrush hazard. Issue 1 (1st January 2019)

• Record Type: Journal Article
• Authors: Zhao, Xiangwei; Wang, Qingzhong; Xie, Bin; Pan, Shun; Ji, Min
• Is Part Of: Geomatics, natural hazards & risk. Volume 10:Issue 1(2019)
• Page Start: 2387
• Page End: 2407
• Publication Date: 2019-01-01
• Subjects: Mine water inrush hazard -- dynamic rescue route planning -- 3D (three-dimensional) spatial network model of mine roadways -- Dijkstra algorithm -- Breadth-first search algorithm; Geomatics -- Periodicals; Geomatics; Periodicals; 526.905
• DOI: 10.1080/19475705.2019.1700172
• Languages: English
• ISSNs: 1947-5705

Abstract

Abstract: Water inrush in mine is one of the most common hazards in the mining industry. To solve the problem of rescue route planning during a mine water inrush hazard, a dynamic rescue route planning method based on a 3 D network is proposed. First, the basic elements in the 3 D network model of the mine roadway are abstractly described, furthermore, the weights of edges, the topological connectivity of the elements, and the data structure of the network are defined. Then, the Dijkstra algorithm and the Breadth-first search algorithm are combined to implement the best rescue search route and return route planning based on the 3 D network model. Finally, the dynamic rescue route planning is simulated in 3 D virtual spatial scenario of a real mine. The factors such as topological connectivity of the elements, real-time water level, and slope of the mine roadways are considered in the process of rescue route planning, as the rescue route is adjusted dynamically according to the actual situations. This method proposed can provide powerful decision support for mine water inrush hazard rescue.