Mine water inrush flow propagation simulation and dynamic escape path planning method and related device

Abstract

The application discloses a mine water inrush flow propagation simulation and dynamic escape path planning method and related device, relates to the mine safety and path planning field, and the method comprises the following steps: constructing a directed graph structure of a mine roadway network and initializing mine roadway basic parameters based on mine roadway network data; determining a hydraulic radius, a hydraulic slope and a roadway length in the mine roadway network according to the mine roadway basic parameters; determining water flow propagation space-time distribution data based on a water head advance velocity calculation formula according to the hydraulic radius, the hydraulic slope and the roadway length in the mine roadway network; and determining an optimal escape path and corresponding escape time from a miner starting position to a safe exit based on a roadway water level function model according to the water flow propagation space-time distribution data, a safety water level threshold, a water flow direction and a miner travel speed.

Description

Technical Field

[0001] This application relates to the field of mine safety and path planning, and in particular to a method and related apparatus for simulating the spread of mine water inrush and dynamic escape path planning. Background Technology

[0002] Current mine water inrush emergency response and safety management systems have several shortcomings, specifically: First, the simulation of water flow spread after a water inrush does not take into account the roadway topology and hydraulic characteristics, making it impossible to accurately calculate the inundation time of nodes and the time when the roadway is filled, resulting in large simulation errors and difficulty in supporting emergency decision-making. Second, traditional water flow spread models are only applicable to single water inrush points and horizontal roadway scenarios, and have poor adaptability to double water inrush point confluence phenomena and roadways with elevation differences, failing to cover complex actual mine conditions. Third, escape route planning does not consider the dynamic spread characteristics of water flow and does not take into account the correlation between roadway water level changes, miner movement speed, and water flow direction, resulting in insufficient route safety and timeliness. Fourth, in the scenario of double water inrush points, there is a lack of dynamic simulation methods for multi-source water flow confluence, making it impossible to accurately predict the water flow spread speed and inundation range after confluence, leading to a lag in escape route planning. Fifth, during the emergency decision-making stage, it is impossible to replan the miner's escape route in real time based on the situation of newly added water inrush points after the initial water inrush, which can easily lead to miners being trapped. The aforementioned problems lead to untimely emergency response and unreasonable escape routes after mine water inrush, increasing the risk of miner injury and death and failing to meet the actual needs of mine safety emergency management. Summary of the Invention

[0003] The purpose of this application is to provide a method and related device for simulating the spread of water in a mine flood and planning dynamic escape routes. This method can accurately simulate the water spread process in mine roadways, calculate the flooding time of nodes and the time when the roadway is filled, and plan the optimal dynamic escape route for miners after a water inrush. It is adaptable to mine roadway networks with different elevation gradients.

[0004] To achieve the above objectives, this application provides the following solution: Firstly, this application provides a method for simulating the spread of mine water inrush and planning dynamic escape routes, including: Based on mine roadway network data, a directed graph structure of the mine roadway network is constructed, and the basic parameters of the mine roadway are initialized.

[0005] Based on the basic parameters of the mine roadway, determine the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network.

[0006] Based on the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network, and using the formula for calculating the water head propulsion speed, the spatiotemporal distribution data of water flow is determined. The spatiotemporal distribution data of water flow includes the time it takes for water to pass through the roadway at the water head, the arrival time of water at the endpoint, and the time when the roadway is filled with water.

[0007] Based on the spatiotemporal distribution data of water flow, safe water level threshold, water flow direction and miner's movement speed, the optimal escape path from the miner's starting position to the safe exit and the corresponding escape time are determined based on the tunnel water level function model.

[0008] Secondly, this application provides a computer device, including: a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor executes the computer program to implement the steps of the method for simulating the spread of mine water inrush and planning dynamic escape paths as described above.

[0009] Thirdly, this application provides a computer-readable storage medium having a computer program stored thereon, which, when executed by a processor, implements the steps of the method for simulating the spread of water inrush in a mine and planning a dynamic escape path as described above.

[0010] Fourthly, this application provides a computer program product, including a computer program that, when executed by a processor, implements the steps of the method for simulating the spread of water inrush in a mine and planning a dynamic escape path as described above.

[0011] According to the specific embodiments provided in this application, this application has the following technical effects: This application provides a method and related apparatus for simulating the spread of water flow in mine floods and planning dynamic escape routes. This method solves the problems of accurately simulating the spread of water flow during mine floods and the inability to dynamically plan escape routes for miners. It achieves accurate prediction of the spatiotemporal distribution of the flooded water flow and real-time planning of the optimal escape route for miners. Specifically, it constructs a directed graph structure based on mine roadway network data and initializes basic parameters, solving the problem of the difficulty in digitizing and structuring complex mine roadway networks. This enables accurate modeling of the spatial topology and key physical properties of mine roadways, providing a basic data framework for subsequent water flow spread simulation and route planning. It determines the hydraulic radius, hydraulic gradient, and roadway length based on the basic parameters of the mine roadway, solving the problem of obtaining key hydraulic parameters in water flow calculation and providing basic parameter support for the water flow characteristics within the roadway. Based on the formula for calculating the water head propulsion velocity, it utilizes the hydraulic radius and hydraulic... The slope and tunnel length determine the spatiotemporal distribution data of water flow, solving the problem of difficulty in dynamically tracking and predicting the spread of water flow in the tunnel network after a water inrush. It enables precise quantification of the time when water flows arrive at each tunnel endpoint, the time when each tunnel is filled, and the time when the water head passes through the tunnel. Based on the spatiotemporal distribution data of water flow, the safe water level threshold, the water flow direction, and the miner's walking speed, the optimal escape path and the corresponding escape time are determined based on the tunnel water level function model. This solves the problem of the failure of traditional static escape paths in the dynamic environment of water inrush and realizes dynamic escape path planning that takes into account the real-time spread of water flow. Attached Figure Description

[0012] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the embodiments will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0013] Figure 1 This is an application environment diagram of a method for simulating the spread of water in a mine flood and planning a dynamic escape route, as described in one embodiment of this application.

[0014] Figure 2 This is a flowchart illustrating a method for simulating the spread of water inrush in a mine and planning a dynamic escape path, provided as an embodiment of this application.

[0015] Figure 3 A flowchart illustrating the overall process of mine flooding and escape route planning, provided in another embodiment of this application.

[0016] Figure 4 A top view of a 2D mine roadway network flooding simulation with a single water inrush point provided in an embodiment of this application.

[0017] Figure 5 A 3D mine roadway network flooding simulation diagram with a single water inrush point provided in an embodiment of this application.

[0018] Figure 6 This is a top view of a 2D mine roadway network flooding simulation with two water inrush points provided in an embodiment of this application.

[0019] Figure 7 A 3D mine roadway network flooding simulation diagram with two water inrush points provided in an embodiment of this application.

[0020] Figure 8 A 3D visualization of a miner's escape route provided in an embodiment of this application.

[0021] Figure 9 3D visualization of a miner's escape route provided in an embodiment of this application (b).

[0022] Figure 10 A schematic diagram a of the double water inrush point path replanning provided in an embodiment of this application.

[0023] Figure 11 Schematic diagram b of the double water inrush point path replanning provided in an embodiment of this application.

[0024] Figure 12 This is a schematic diagram of the structure of a computer device provided in an embodiment of this application. Detailed Implementation

[0025] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, and not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0026] To make the above-mentioned objectives, features and advantages of this application more apparent and understandable, the application will be further described in detail below with reference to the accompanying drawings and specific embodiments.

[0027] The mine water inrush flow simulation and dynamic escape path planning method provided in this application embodiment can be applied to, for example... Figure 1In the application environment shown, terminal 102 communicates with server 104 via a network. A data storage system can store the data that server 104 needs to process. The data storage system can be set up independently, integrated into server 104, or placed in the cloud or on another server. Terminal 102 can send mine roadway network data to server 104. After receiving the mine roadway network data, server 104 constructs a directed graph structure of the mine roadway network based on the data and initializes the basic parameters of the mine roadway. Based on the basic parameters, server 104 determines the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network. Based on the hydraulic radius, hydraulic gradient, and roadway length, and using the formula for calculating the water head propulsion speed, server 104 determines the spatiotemporal distribution data of the water flow. Based on the spatiotemporal distribution data of the water flow, the safe water level threshold, the water flow direction, and the miner's movement speed, and using the roadway water level function model, server 104 determines the optimal escape path from the miner's starting position to the safe exit and the corresponding escape time. Server 104 can then feed back the obtained optimal escape path and corresponding escape time to terminal 102. In addition, in some embodiments, the method for simulating the spread of mine water inrush and planning dynamic escape routes can also be implemented separately by the server 104 or the terminal 102. For example, the terminal 102 can directly perform the method for simulating the spread of mine water inrush and planning dynamic escape routes based on the mine roadway network data, or the server 104 can obtain the mine roadway network data from the data storage system and perform the method for simulating the spread of mine water inrush and planning dynamic escape routes based on the mine roadway network data.

[0028] The terminal 102 can be, but is not limited to, various desktop computers, laptops, smartphones, tablets, IoT devices, and portable wearable devices. IoT devices can include smart speakers, smart TVs, smart air conditioners, and smart in-vehicle devices. Portable wearable devices can include smartwatches, smart bracelets, and head-mounted devices. The server 104 can be implemented using a standalone server or a server cluster composed of multiple servers, or it can be a cloud server.

[0029] In one exemplary embodiment, such as Figure 2 As shown, a method for simulating the spread of mine water inrush and planning dynamic escape routes is provided. This method is executed by computer equipment, specifically by a terminal or server alone, or by both a terminal and a server. In this embodiment, the method is applied to... Figure 1 Taking server 104 as an example, the explanation includes the following steps 201 to 204. Wherein: Step 201: Based on the mine roadway network data, construct the directed graph structure of the mine roadway network and initialize the basic parameters of the mine roadway.

[0030] Step 202: Determine the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network based on the basic parameters of the mine roadway.

[0031] Step 203: Based on the hydraulic radius, hydraulic gradient and roadway length in the mine roadway network, and using the formula for calculating the water head propulsion speed, determine the spatiotemporal distribution data of water flow; the spatiotemporal distribution data of water flow includes the time it takes for water to pass through the roadway at the water head, the arrival time of water at the endpoint, and the time when the roadway is filled with water.

[0032] Step 204: Based on the spatiotemporal distribution data of water flow, the safe water level threshold, the direction of water flow and the miner's speed, and the tunnel water level function model, determine the optimal escape path from the miner's starting position to the safe exit and the corresponding escape time.

[0033] In one exemplary embodiment, this application may also implement as follows: Figure 3 The steps shown are as follows: Step 1: Mine roadway network modeling and parameter initialization: Obtain mine roadway network data, including endpoint coordinates (x, y, z), roadway number, roadway width c=4m, and roadway height h=3m. Abstract the mine roadway system into a directed graph G=(V,E), where V is the set of endpoints and E is the set of roadways.

[0034] Then, the parameters are initialized: the roughness coefficient n = 0.02, the initial head height h0 = 0.1m, and the inrush flow rate Q. 出 =30.0m 3 / min, safe water level threshold 0.3m, miner's travel speed (240m / min when there is no water, 120m / min with the current, 60m / min against the current).

[0035] After setting the parameters, calculate the hydraulic radius. : Specifically, based on the cross-sectional area A and wetted perimeter X, and considering the characteristics of a rectangular tunnel, the hydraulic radius is calculated using the following formula: .

[0036] Then, based on endpoint P i (x i ,y i ,z i Given the coordinates of P(x,y,z) and P(x,y,z), calculate the tunnel length L using the following formula. ij : .

[0037] In the formula, A is the cross-sectional area of ​​the water passage, X is the wetted perimeter, h0 is the initial water head height, and c is the tunnel width. x is the length of the tunnel. i y i z i For endpoint P i The coordinates, x j y j z j For endpoint P j coordinates This refers to the hydraulic gradient.

[0038] Based on the elevation difference at the endpoints and the tunnel length, the hydraulic gradient is calculated using the following formula. And determine the direction of water flow (from the endpoint with higher elevation to the endpoint with lower elevation): .

[0039] Step 2: In reality, water flow diffusion can be divided into single-point and multi-point diffusion. When simulating water flow diffusion at a single-point diffusion point, the following can be used: An event-driven simulation algorithm based on priority queues is adopted, drawing on the core idea of ​​Dijkstra's shortest path algorithm, to simulate the propagation process of water flow in the tunnel network.

[0040] To distinguish the downhill roadway (S) p >0) and horizontal tunnels (S p =0), establish the formula for calculating the water head propulsion speed: .

[0041] Simplified as .

[0042] Then, calculate the water flow head through tunnel H. ij Time: .

[0043] Update the arrival time of the water flow at the endpoint: .

[0044] Calculate the time when the tunnel fills with water: , where V ij The volume of the tunnel (V) i =L i ×c×h); The first time the water flow reaches the node At that moment.

[0045] Then, the simulation results are filtered, and endpoints and tunnels that are too far from the water inrush point and have too long water arrival time are marked as infinite (null value) to complete the simulation of water flow spread at a single water inrush point.

[0046] Step 3: Based on Step 2, perform multi-point water inrush simulation. This embodiment takes the simulation of water flow spread at two water inrush points as an example (extended model): Based on the single water inrush point model, a second water inrush point is introduced to construct a multi-source event-driven simulation model, using the parameters and tunnel network modeling results from step 1.

[0047] Define an event tuple (t, i, q) 入 ), indicating that at time t, a flow rate of q 入 The water flow reaches node P i The event handling process is as follows: Update node's cumulative total flow: .

[0048] Update node first arrival time: .

[0049] Calculate downstream distribution flow: If node P i The flow needs to be allocated to k downstream roadways, with an average flow allocated to each downstream roadway. (n=1,2,…,k).

[0050] Repeat the calculations of water head propagation speed, propagation time, node arrival time and tunnel filling time in step 2 to complete the simulation of water flow spread after the confluence of the two water inrush points.

[0051] Step 4: Dynamic Escape Path Planning (Applicable to Single / Double Water Inrush Points): One minute after the water inrush, escape route planning is initiated, mapping the miner's initial position to the nearest tunnel endpoint. It is assumed that the miner strictly follows the planned escape route, without considering congestion or physical exhaustion.

[0052] Dynamic water level calculation: for any tunnel H i Based on the water inflow time T (H) i ), Full moment T full (H) i Establish the tunnel water level function at any time t: .

[0053] in, .

[0054] Determination of safe passage conditions: Water level h when miners enter the tunnel 进 ≤0.3m and water level h when leaving the tunnel 离 ≤0.3m, otherwise the tunnel is not passable (passage time is recorded as ∞).

[0055] Miner's travel speed is determined based on the water level and direction of water flow in the tunnel (240 m / min when there is no water, 120 m / min with the current, and 60 m / min against the current).

[0056] Dynamic edge weight (travel time) calculation: When leaving the alley If the safety conditions are met, the edge weight is t; otherwise, it is ∞.

[0057] An improved Dijkstra algorithm is used, with the miner's starting node as the source and the set of safe exit nodes as the target, to calculate the shortest escape time and optimal path from the starting point to the safe exit, and to record the tunnels traversed and the arrival time of the path.

[0058] Step 5: Path replanning after the addition of two water inrush points: Set the start time t of the second water inrush point B_start , in t decision =t B_start Initiate route replanning at +1.0 minute.

[0059] like Figures 10-11 As shown, determine the miner at t decision Location at any moment: Based on the initial escape path, determine whether the miner has escaped safely; if not, determine the current node and the time of arrival at that node.

[0060] Based on the water flow spread data after the confluence of the two water inrush points (results from step 3), the dynamic water level and passage time of each roadway are recalculated.

[0061] Based on the improved Dijkstra algorithm, the optimal escape path is replanned from the miner's current node, and the final escape time and path are output; if a safe path cannot be found, the miner is considered trapped.

[0062] Step 6: Visualization of simulation results and data output: Generate as Figures 4-7 The 2D / 3D mine roadway network flooding simulation diagram shown is marked with the locations of unreached nodes, reached nodes, roadways that are not yet filled, roadways that are already filled, and water inrush points.

[0063] Generate as Figure 8 , Figure 9 The escape route visualization diagram shows the safe tunnels, tunnels affected by water flow, safety exits, miners' starting points, and escape trajectories.

[0064] Output simulation results data, including the arrival time of water flow at the endpoint, the time when the tunnel is filled, and the escape routes and arrival times of miners, and save them as an Excel file to support emergency decision-making.

[0065] This application also provides examples of specific implementation methods: In a mine with two roadway networks (Appendix 1: low elevation difference roadway network, 663 endpoints and 976 roadways; Appendix 2: high elevation difference roadway network, 663 endpoints and 976 roadways), simulate the spread of water flow at single / double water inrush points and the planning of miners' escape routes.

[0066] Specifically, the implementation steps are as follows: 1) Tunnel network modeling and parameter initialization: Import mine endpoint and tunnel data, set roughness coefficient n=0.02, and water inrush flow rate 30.0 m³ / h. 3 / min, with a safe water level threshold of 0.3m, calculate the hydraulic radius, tunnel length, and hydraulic gradient.

[0067] 2) Simulation of a single water inrush point: In the scenario of Appendix 1, nodes 293 / 663 are reachable and tunnels 409 / 976 can be filled. The earliest time to fill tunnel H0964 is 32.79 minutes, and the latest time to fill tunnel H0536 is 6975473737.47 minutes. In the scenario of Appendix 2, nodes 28 / 663 are reachable and tunnels 39 / 976 can be filled. This verifies the model's adaptability.

[0068] 3) Simulation of two water inrush points: In the scenario of Appendix 1, water inrush point 1 (0.0 minutes, coordinates (5349.03, 4931.90, 10.00)) and water inrush point 2 (4.0 minutes, coordinates (3760.40, 3808.33, 10.00)) simulate the characteristics of water flow diffusion after confluence; In the scenario of Appendix 2, water inrush point 1 (0.0 minutes, coordinates (4143.12, 4376.28, 6.33)) and water inrush point 2 (5.0 minutes, coordinates (5883.14, 5643.35, 40.37)) complete the confluence simulation.

[0069] 4) Escape route planning: Planning starts 1 minute after the water inrush. In the scenario in Appendix 1, the escape times for the three miners are 22.48 minutes, 12.23 minutes, and 17.94 minutes, respectively; in the scenario in Appendix 2, the escape times for the three miners are 12.26 minutes, 17.97 minutes, and 20.56 minutes, respectively.

[0070] 5) Path replanning: In a dual-water inrush scenario, at t decision =5.0 minutes (Appendix 2) to initiate replanning, determine the miner's current location, replan the optimal path, and ensure safe escape.

[0071] Visualization and data output: Generate 2D / 3D simulation diagrams and escape route maps, and output Excel format result files to support emergency decision-making.

[0072] In one exemplary embodiment, a computer device is provided, which may be a server or a terminal, and its internal structure diagram may be as follows. Figure 12 As shown, this computer device includes a processor, memory, input / output (I / O) interfaces, and a communication interface. The processor, memory, and I / O interfaces are connected via a system bus, and the communication interface is also connected to the system bus via the I / O interfaces. The processor provides computational and control capabilities. The memory includes non-volatile storage media and internal memory. The non-volatile storage media stores the operating system, computer programs, and a database. The internal memory provides the environment for the operating system and computer programs stored in the non-volatile storage media. The database stores optimal escape routes and corresponding escape times. The I / O interfaces are used for information exchange between the processor and external devices. The communication interface is used for communication with external terminals via a network connection. When executed by the processor, the computer program implements a method for simulating mine flooding and dynamic escape route planning.

[0073] Those skilled in the art will understand that Figure 12 The structures shown are merely block diagrams of some structures related to the present application and do not constitute a limitation on the computer device to which the present application is applied. Specific computer devices may include more or fewer components than shown in the figures, or combine certain components, or have different component arrangements. In an exemplary embodiment, a computer device is provided, including a memory and a processor. The memory stores a computer program, and the processor executes the computer program to implement the steps in the above-described method embodiments.

[0074] In one exemplary embodiment, a computer-readable storage medium is provided storing a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0075] In one exemplary embodiment, a computer program product is provided, including a computer program that, when executed by a processor, implements the steps in the above-described method embodiments.

[0076] It should be noted that the user information (including but not limited to user device information, user personal information, etc.) and data (including but not limited to data used for analysis, data stored, data displayed, etc.) involved in this application are all information and data authorized by the user or fully authorized by all parties. Moreover, the collection, use and processing of the relevant data are carried out in compliance with the relevant data protection laws and policies of the country where the location is located, and with the authorization granted by the owner of the corresponding device.

[0077] Those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The computer program can be stored in a non-volatile computer-readable storage medium. When executed, the computer program can include the processes of the embodiments described above. Any references to memory, databases, or other media used in the embodiments provided in this application can include at least one of non-volatile and volatile memory. Non-volatile memory can include read-only memory (ROM), magnetic tape, floppy disk, flash memory, optical memory, high-density embedded non-volatile memory, resistive random access memory (ReRAM), magnetic random access memory (MRAM), ferroelectric random access memory (FRAM), phase change memory (PCM), graphene memory, etc. Volatile memory can include random access memory (RAM) or external cache memory, etc. By way of illustration and not limitation, RAM can take many forms, such as Static Random Access Memory (SRAM) or Dynamic Random Access Memory (DRAM).

[0078] The databases involved in the embodiments provided in this application may include at least one type of relational database and non-relational database. Non-relational databases may include, but are not limited to, blockchain-based distributed databases. The processors involved in the embodiments provided in this application may be general-purpose processors, central processing units, graphics processing units, digital signal processors, programmable logic devices, quantum computing-based data processing logic devices, etc., and are not limited to these.

[0079] In summary, this application has the following technical effects: 1) High simulation accuracy: Combining hydraulic characteristics with event-driven algorithms, it accurately calculates the flooding time of nodes and the filling time of tunnels, adapting to horizontal and vertical tunnels with different elevations, and significantly reducing simulation errors.

[0080] 2) Strong scene adaptability: It supports single / double water inrush scenarios and can accurately simulate the confluence process of double water inrush points, covering complex actual working conditions in mines and solving the problem of poor adaptability of traditional models.

[0081] 3) Safer and more efficient escape routes: Based on dynamic water flow data, combined with water level safety thresholds and miners’ walking speed characteristics, the planned routes can avoid dangerous tunnels and ensure timely escape.

[0082] 4) Timely emergency response: For the new scenario of dual water inrush points, the escape route can be replanned in real time to reduce the risk of miners being trapped and improve the emergency response capability of mine water inrush.

[0083] 5) Highly applicable: Based on real mine roadway data, the model is solved and visualized using Python. The output results can directly support emergency decision-making and are suitable for various mine safety management needs.

[0084] The technical features of the above embodiments can be combined in any way. For the sake of brevity, not all possible combinations of the technical features in the above embodiments are described. However, as long as there is no contradiction in the combination of these technical features, they should be considered to be within the scope of this specification.

[0085] This document uses specific examples to illustrate the principles and implementation methods of this application. The descriptions of the above embodiments are only for the purpose of helping to understand the methods and core ideas of this application. Furthermore, those skilled in the art will recognize that, based on the ideas of this application, there will be changes in the specific implementation methods and application scope. Therefore, the content of this specification should not be construed as a limitation of this application.

Claims

1. A method for simulating the spread of water inrush in mines and planning dynamic escape routes, characterized in that, include: Based on mine roadway network data, a directed graph structure of the mine roadway network is constructed, and the basic parameters of the mine roadway are initialized. Based on the basic parameters of the mine roadway, determine the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network; Based on the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network, and using the formula for calculating the water head propulsion speed, the spatiotemporal distribution data of water flow is determined. The spatiotemporal distribution data of water flow includes the time it takes for water to pass through the roadway at the water head, the arrival time of water at the endpoint, and the time when the roadway is filled with water. Based on the spatiotemporal distribution data of water flow, safe water level threshold, water flow direction and miner's movement speed, the optimal escape path from the miner's starting position to the safe exit and the corresponding escape time are determined based on the tunnel water level function model.

2. The method for simulating the spread of mine water inrush and planning dynamic escape routes according to claim 1, characterized in that, Based on the basic parameters of the mine roadways, the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network are determined, specifically including: Based on the basic parameters of the mine roadways, and using the formulas for calculating hydraulic radius, hydraulic gradient, and roadway length, the hydraulic radius, hydraulic gradient, and roadway length in the mine roadway network are determined. The formula for calculating the hydraulic radius is as follows: ； The formula for calculating hydraulic gradient is: ； The formula for calculating tunnel length is: ； In the formula, A is the cross-sectional area of ​​the water passage, X is the wetted perimeter, h0 is the initial water head height, and c is the tunnel width. x is the length of the tunnel. i y i z i For endpoint P i The coordinates, x j y j z j For endpoint P j coordinates This refers to the hydraulic gradient.

3. The method for simulating the spread of mine water inrush and planning dynamic escape routes according to claim 2, characterized in that, The formula for calculating the water head propulsion speed is: ； in, For alleyways, This refers to the sudden water flow rate.

4. The method for simulating the spread of mine water inrush and planning dynamic escape routes according to claim 3, characterized in that, The formula for calculating the time it takes for the water head to pass through the tunnel in the spatiotemporal distribution data of the water flow is as follows: ； The formula for calculating the arrival time of the water flow at the endpoint is: ； The formula for calculating when a tunnel is filled with water is: ； Among them, V ij For the volume of the alley, The first time the water flow reaches the node At that moment.

5. The method for simulating the spread of mine water inrush and planning dynamic escape routes according to claim 4, characterized in that, The formula expression for the tunnel water level function model is as follows: ； in, .

6. A computer device, comprising: The memory, the processor, and the computer program stored in the memory and capable of running on the processor are characterized in that the processor executes the computer program to implement the method for simulating the spread of water inrush in mines and planning dynamic escape paths according to any one of claims 1-5.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that, When executed by a processor, the computer program implements a method for simulating the spread of water inrush in mines and planning dynamic escape routes, as described in any one of claims 1-5.

8. A computer program product, comprising a computer program, characterized in that, When executed by a processor, the computer program implements a method for simulating the spread of water inrush in mines and planning dynamic escape routes, as described in any one of claims 1-5.

Images