Construction of Dynamic Water Flow Propagation Models for Mine Water Inrushes and Research on Time-Dependent Evacuation Path Optimization

Abstract

Mine water disasters pose significant safety challenges to mining operations, often resulting in substantial casualties and property losses. This study focuses on two key issues following mine water inrushes: modeling the propagation patterns of water flow (dynamic propagation modeling for single-point water inrushes) and optimizing personnel escape routes (optimizing optimal escape paths for miners during water inrush scenarios). First, based on rectangular roadway cross-section characteristics and unidirectional water flow propagation rules, we calculate roadway lengths using Euclidean distance and employ a breadth-first search (BFS) algorithm to construct a water flow propagation model. This precisely quantifies the arrival times of water at each endpoint and the roadway's complete flooding time. Second, under dynamic flow constraints (e.g., water level, passage time window, and personnel movement speed), miner escape path planning is abstracted as a shortest path problem with dynamic constraints. Employing a time-dependent Dijkstra algorithm, we dynamically update the cumulative shortest escape time for each node, successfully planning optimal escape routes for miners and obtaining shortest escape time results across different elevation scenarios. This study provides a scientific quantitative analysis method and escape decision support for emergency response to mine water disasters.In order to deal with the mine flood, which is a major potential safety hazard, reduce casualties and property losses.