Dynamic Path Planning Model for Mine Water Inrush Based on Breadth-First Search and Time-Extended Dijkstra Algorithm
Textile & Leather Review · 25.04.2026 · 9 · 1935-1957
DOI: 10.31881/tlr.2026.1935 ↗Kurz gefasst
Fachartikel in der Zeitschrift Textile & Leather Review, online erschienen am 25.04.2026. Verfasst von Jin Deng und 3 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben.
Abstract (Originalsprache)
This study constructs a series of models for water flow propagation in mine tunnel water inrushes and dynamic escape path planning for miners, aiming to provide reference escape strategies for mine water disasters. For single-point water outburst scenarios, the study abstracts the roadway network as a graph structure. Employing a breadth-first search algorithm, it calculates the time of first water arrival at endpoints and the time of roadway flooding, incorporating spatial parameters and initial outburst flow rates. For optimal miner escape route planning, the study introduces dynamic velocity constraints based on water depth: 4 m/s in dry conditions, 2 m/s downstream and 1 m/s upstream in low water, with high water levels prohibiting movement. The defined velocity constraints under different water depths provide essential ergonomic performance metrics for the development of miners'protective clothing in hydraulic environments. The model employs a time-extended Dijkstra algorithm to search for the shortest total escape time path. Building upon this foundation, the model is extended to predict flow superposition in delayed dual-source water inrushes. By applying time axis shifts, selecting minimum arrival times, and superimposing flow rates, it calculates flow states under dual-source interactions, enabling dynamic simulation of multi-source inrush systems. Finally, integrating dualsource flow results with the time-varying Dijkstra algorithm, the model plans optimal miner escape routes during delayed dual-source water inrushes. This study offers a theoretical framework for integrating wearable safety systems into intelligent mine disaster mitigation.
Zitieren
APA
Deng, J., Li, W., Liu, S., & Wang, S. (2026). Dynamic Path Planning Model for Mine Water Inrush Based on Breadth-First Search and Time-Extended Dijkstra Algorithm. Textile & Leather Review, 9, 1935-1957. https://doi.org/10.31881/tlr.2026.1935
Vancouver
Deng J, Li W, Liu S, Wang S. Dynamic Path Planning Model for Mine Water Inrush Based on Breadth-First Search and Time-Extended Dijkstra Algorithm. Textile & Leather Review. 2026;9:1935-1957. doi:10.31881/tlr.2026.1935
BibTeX
@article{Deng2026,
author = {Deng, Jin and Li, Wen and Liu, Shujie and Wang, Shiting},
title = {Dynamic Path Planning Model for Mine Water Inrush Based on Breadth-First Search and Time-Extended Dijkstra Algorithm},
journal = {Textile & Leather Review},
year = {2026},
volume = {9},
pages = {1935--1957},
doi = {10.31881/tlr.2026.1935}
}
EUVIMED