Aiming at the problems of water inrush diffusion simulation and emergency escape decision-making of personnel in complex mine roadway networks, this paper proposes a combined framework of Discrete Event-Volume Conservation (DEM-VC) and Time-Dependent Shortest Path (TDSP). The DEM-VC model takes node volume conservation as the core constraint, uses the horizontal/downslope equal distribution rule to advance the water flow front, and realizes accurate and robust roadway filling judgment through net inflow integration. The TDSP model maps dry roads, shallow water and deep water into time-dependent edge weights, and introduces a reasonable waiting strategy to avoid deep water blockages and achieve the shortest safe escape time. The proposed method unifies water propagation simulation and escape path optimization into a single decision framework, which is the major innovation of this study. Compared with traditional path planning algorithms, it can dynamically adapt to the time-varying passability of roadways and greatly improve the safety and feasibility of escape routes. The global volume conservation mechanism effectively eliminates cumulative errors in long-term simulation and ensures the reliability of water distribution prediction. Experimental results on two sets of real mine network data show that the model can accurately identify main water channels and key blocking sections, support real-time release and dynamic adjustment of escape schemes, and has strong engineering practicability and robustness.

Xiaoqing Jia, Yunpeng Yu. Mine Water Inrush Propagation and Escape Route Planning Based on DEM-VC and TDSP Combined Model. International Journal of Frontiers in Engineering Technology (2026), Vol. 8, Issue 2: 72-79. https://doi.org/10.25236/IJFET.2026.080210.

[1] Li Wei, Sun Liang, Wei Gang, et al. An intelligent HPSO-MLP model for predicting coal spontaneous combustion temperature and optimizing inhibitor to enhance mine safety[J]. Process Safety and Environmental Protection,2026,210:108679.

[2] Yu Shuai, Li Dong, Xie Xing, et al. Multi-Constraint and Shortest Path Optimization Method for Individual Urban Street Tree Segmentation from Point Clouds[J]. Forests,2025,17(1):27.

[3] Dong Xu, Li Song, Ma Rui, et al. Cloud-based slope risk monitoring and early warning system for open-pit coal mines: a case study of Zhonglian Runshi[J]. Scientific Reports,2025,15(1):44396.

[4] Aldhafferi N. Time and Memory Trade-Offs in Shortest-Path Algorithms Across Graph Topologies: A*, Bellman–Ford, Dijkstra, AI-Augmented A* and a Neural Baseline[J]. Computers,2025,14(12):545.

[5] Sekei S V, Wang Jun, Prosoer K K, et al. Human Factors in Mining Accidents: A Systematic Review of Behavioral Safety Interventions[J]. Open Journal of Social Sciences,2025,13(12):56-70.

[6] Liu Feng, Wang Peng, Bhattacharjya A, et al. A Novel Spherical Shortest Path Planning Method for UAVs[J]. Drones,2024,8(12):749.

[7] Zhang Yu, Hu Xiang, Li Hao, et al. A Fuzzy Variable H Strategy Based Ripple-Spreading Algorithm to Find the k Shortest Paths[J]. Mathematics,2024,12(23):3670.

[8] Elnaz A, Abbas S. Solution algorithms for shortest path network interdiction with symmetric and asymmetric information[J]. International Journal of Systems Science: Operations & Logistics, 2023, 10(1):1-12.

[9] Stefan K, Florian N. Efficient parameterized algorithms for computing all-pairs shortest paths[J]. Discrete Applied Mathematics,2023,341:102-119.

[10] John H. Monitoring edge-geodetic sets: Hardness and graph products[J]. Discrete Applied Mathematics, 2023,340:79-84.