Mine water disaster simulation system and method

Abstract

The invention relates to the technical field of mine water disaster simulation, in particular to a mine water disaster simulation system and method. The system comprises a laneway space network system construction module used for generating a point-line structure representing a mine laneway network; the dynamic water flooding numerical simulation module is used for simulating a dynamic path of water flow in the mine water disaster process; the disaster avoidance route retrieval module is used for retrieving the shortest escape route according to the real-time roadway network submerging state when the mine water disaster occurs, and comprises the following steps: setting water inrush time, and obtaining the roadway submerging state through water disaster simulation; inputting a disaster avoidance starting point set and a disaster avoidance end point set; a dynamic storage space dist is applied, the length of the dynamic storage space dist is the number of roadway nodes, the dynamic storage space dist is used for storing the shortest distance from a source point to each vertex, and the value of the dist represents the roadway length after multi-factor weight correction. According to the technical scheme, the mine water disaster process is comprehensively and accurately simulated in real time, and technical support is provided for mine water disaster prevention and emergency rescue.

Description

Technical Field

[0001] The invention relates to the technical field of mine water hazard simulation, and in particular to a mine water hazard simulation system and method. Background Art

[0002] In the process of mine production, water damage is one of the main disasters that threaten mine safety. Traditional methods of predicting and preventing mine water damage mainly rely on experience and static data analysis, which makes it difficult to simulate the mine water inrush process and evaluate its impact in real time and accurately. With the expansion of mine scale and the increase of mining depth, the geological conditions of mines are becoming more and more complex, and water damage prevention and control work faces more severe challenges.

[0003] Most of the existing mine water disaster prediction systems have the following deficiencies:

[0004] 1. Traditional mine water hazard prediction systems are mostly based on two-dimensional plane maps or simple three-dimensional models, which are difficult to fully reflect the complex three-dimensional spatial structure of the mine, especially the connection relationship between tunnels, inclined tunnels and shafts and other special structures, which greatly reduces the accuracy of the prediction results.

[0005] 2. Existing systems can usually only simulate the spread of water in a single direction and cannot accurately simulate the dynamic changes of water flow in complex well networks, including the free fall, accelerated flow and spread of water in vertical, sloped and horizontal tunnels, as well as the alternating conversion between flow and flooding.

[0006] 3. In the event of a sudden flood, the existing system is generally unable to quickly calculate the optimal disaster escape route based on the mine’s flooding status and personnel location in real time, which seriously affects the emergency response speed and safety of mine personnel.

[0007] 4. There are many types of data such as mine geology, hydrology, and mining. Most existing systems find it difficult to effectively integrate and process these multi-source heterogeneous data, resulting in a lack of comprehensiveness and accuracy in prediction results.

[0008] 5. Existing systems generally use fixed algorithms and models, which are difficult to flexibly adjust and optimize according to the actual conditions of different mines, limiting the application scope and practicality of the system. Summary of the invention

[0009] The purpose of the present invention is to propose a mine flood simulation system, which can simulate the mine flood process comprehensively, in real time and accurately, and provide strong technical support for mine flood prevention and emergency rescue.

[0010] To achieve the above objectives, in a first aspect, an embodiment of the present disclosure provides a mine water hazard simulation system, comprising:

[0011] A shaft and tunnel spatial network system building module, which is used to generate a point-line structure representing the mine tunnel network;

[0012] Dynamic flooding numerical simulation module, used to simulate the dynamic path of water flow during mine flooding;

[0013] The disaster escape route retrieval module is used to retrieve the shortest escape route according to the real-time tunnel network flooding status when a mine flood occurs, including the following:

[0014] Set the water inrush time and obtain the tunnel flooding state through water disaster simulation; input the disaster avoidance starting point set and disaster avoidance end point set; apply for dynamic storage space dist, whose length is the number of tunnel nodes, used to store the shortest distance from the source point to each vertex. The value of dist represents the tunnel length after multi-factor weight correction. The formula is as follows:

[0015]

[0016] Among them, l i j represents the length of the lane, n is the number of factors considered; w m is the weight of the factor affecting the escape speed; L i j is the lane weight after multi-factor correction.

[0017] Beneficial effects of the basic scheme: This technical scheme adopts three-dimensional modeling technology to fully reflect the three-dimensional spatial structure of the mine, especially the connection relationship between tunnels, special structures such as inclined tunnels and shafts, to improve the accuracy of the simulation. The shaft and tunnel spatial network system construction module can generate the point-line structure of the mine tunnel network, which helps mine managers to understand the mine structure more intuitively and optimize the mine design. By simulating and analyzing the impact of different factors (such as tunnel length, factors affecting escape speed, etc.) on the escape path, it can also provide a scientific basis for the daily management and maintenance of the mine, and improve the overall safety and operational efficiency of the mine.

[0018] The dynamic flooding numerical simulation module can be used to simulate the dynamic changes of water flow in complex shaft and tunnel networks, including the free fall, accelerated flow and spread of water in vertical, sloped and horizontal tunnels, as well as the alternating conversion between overflow and flooding. This can predict the possible impact and scope of water disasters in advance, thereby helping mine managers to take preventive measures in a timely manner to reduce the probability of water disasters or mitigate their impact.

[0019] When a flood occurs, the disaster escape route retrieval module can quickly retrieve the shortest escape route based on the real-time flooding status of the tunnel network, provide safe escape guidance for miners, and reduce casualties. The disaster escape route retrieval module calculates the tunnel length after multi-factor weight correction. The system can more accurately reflect the actual situation of the escape route and improve the accuracy and effectiveness of decision-making.

[0020] This technical solution facilitates flexible adjustment and optimization according to the actual conditions of different mines, thereby improving the application scope and practicality of the system.

[0021] As an implementable preferred solution, the shaft and tunnel space network system construction module includes a mine tunnel network generation submodule, and the specific process of the mine tunnel network generation submodule is as follows:

[0022] The measuring instrument measures the three-dimensional coordinates of the tunnel nodes and establishes a three-dimensional coordinate system corresponding to the actual mine in the simulation system;

[0023] Determine the connection relationship between lane nodes, establish the topological structure between nodes, create lane nodes in the simulation model according to the measured three-dimensional coordinates, and draw lanes in the model according to the connection relationship between nodes;

[0024] Conduct a cross-sectional morphology survey of the tunnels, and assign a corresponding cross-sectional shape to each tunnel based on the surveyed cross-sectional morphology;

[0025] Assign the measured attributes to the corresponding tunnel section, the measured attributes include width and height;

[0026] Different types of tunnels are marked according to their geological conditions so that they can be distinguished in simulation;

[0027] Closed information integration, record the closed information of the lane; integrate the closed information into the model and adjust the properties of the closed lane.

[0028] As an implementable preferred solution, the three-dimensional shaft and tunnel network construction process of the mine tunnel network generation submodule is as follows:

[0029] Extract the basic information of the shaft and lane grid; copy a set of lane parameters, swap the starting point and end point in the copied data, and merge it with the original information set;

[0030] The merged lane information set is arranged in an extended ascending order with the starting point number as the priority condition and the end point as the secondary condition;

[0031] Count the number of times each node appears in the sorted lane starting point number column. This value is the total coordination number, which represents the number of lanes connected to a node.

[0032] The total coordination number is accumulated along the column direction, and the value obtained is the cumulative total coordination number, which represents the cumulative number of connected lanes from the first lane node to the current node;

[0033] Map the node and lane numbers to data columns starting from 0; quickly locate lane information in the table by looking up the numbers.

[0034] As an implementable preferred solution, the shaft and lane space network system construction module also includes a node encryption submodule, and the specific implementation process is as follows:

[0035] Set the length threshold of a single lane; traverse all lanes; use the interpolation method to insert nodes in the lanes that are too long, and divide the lanes into multiple lanes with lengths less than the threshold;

[0036] Add new nodes and lane information to the node parameters and lane parameter sets of the three-dimensional shaft and lane network, re-sort them, and recalculate the total coordination number and cumulative total coordination number.

[0037] As an implementable preferred solution, txt text and visualization VTK files of node and lane information are output, the relevant information of points and lines is stored in VTK format, and it is displayed in three dimensions in Paraview.

[0038] As an implementable preferred solution, the dynamic flooding numerical simulation module is used to complete the dynamic path solution of the water flow spread process according to the water inrush point and water inrush rate, so as to predict the dynamic change process of the tunnel flooding state and water level elevation with the water inrush time; it is also used to call the result output function to output the location of the flooded tunnels, the total volume of the flooded tunnels and the water level elevation in the entire mine tunnel network in real time.

[0039] As an implementable optimal solution, the specific implementation process of the flow path retrieval algorithm in the dynamic flooding numerical simulation module is as follows:

[0040] Step S201, importing the node information set and the shaft and lane information set of the three-dimensional shaft and lane network, setting the water inrush point t number; applying for a flow node set to mark the nodes that the water flow has passed; applying for a retrieval node set to store the latest nodes of the current water flow spread; determining the spreading direction of the water flow by traversing the elevation and submerged state of the nodes connected to the set; when all the connected points are higher than the points in the set, the spreading end point is found; applying for a flow lane information set, the set contains the mapping number of the flow lane, the lane start point and the lane end point; under the data structure of the full coordination number, the saved flow lane can describe the flow direction of the lane, and the water flows from the recorded lane start point to the lane end point in the lane;

[0041] Step S202, starting from the water inrush point t, quickly locate all connected nodes in the lane information set through the full coordination number and the cumulative full coordination number, count all nodes with elevations less than or equal to t, and add the connected points with the lowest elevations into the search node set, and mark the node t in the flow node set, store the lane formed by the two points in the flow lane information set, and jump to step S203; if the elevations of the connected nodes are all greater than the elevation of point t, it means that there is no downward diffusion path, exit this cycle, and start the flooding path retrieval algorithm retrieval with t as the starting point;

[0042] Step S203, determine whether the search node set is empty, if it is an empty set, then end and return to the flow lane information set, if it is not empty, then need to determine the node elevation connected to the search node set; if the lowest point elevation is lower than the node in the search node set, and the node is not marked in the flow node set, then clear the search node set, and add the connected point from the node information set to the search node set, and mark the point in the flow node set, store the lane formed by the two points in the flow lane information set, and jump to step S204; when the connected lowest point is the same as the node elevation in the search node set, and the node is not marked in the flow node set, add the connected point to the search node set, store the lane formed by the two points in the flow lane information set, and jump to step S204; if all connected nodes are higher than the elevation in the search node set, it means that the water flow has no lanes to continue to spread downward, return to the flow lane set and the spreading end point, the program ends, and then starts the water flow and flooding path search algorithm search;

[0043] Step S204, jump to step S203, until the spreading end point is found.

[0044] As an implementable optimal solution, the specific implementation process of the flooding path retrieval algorithm in the dynamic flooding numerical simulation module is as follows:

[0045] Step S301, the starting point of water flow flooding is the end point e of the water flow spreading downward; import the node information set and the shaft and lane information set of the three-dimensional shaft and lane network; apply for set S*, which is used to mark the flooded state of the node; apply for set S1*, which is used to mark the flooded state of the lane, and the set length is the number of lanes in the shaft and lane information set; apply for the retrieval node set C*, which is used to store the latest node currently flooded; apply for the flooded lane information set R*, which includes the mapping number of the flooded lane, the lane starting point and the lane end point; apply for the variable H to store the current water level elevation;

[0046] Step S302, mark the starting point e in the set S* as submerged, add the point e into C*, set the current water level elevation H as the elevation of the point e, then quickly locate all connected nodes in the lane information set through the full coordination number and the cumulative full coordination number of the node e in the node information set, determine the lowest elevation point n, mark n as submerged in S*, add n into C*, store the lane formed by the e and n nodes in the submerged lane information set R*, and set the current water level elevation H as the elevation of the point n;

[0047] Step S303, traverse the adjacent nodes of C*, if there is a node whose elevation is less than the current water level elevation H, and the formed lane is not marked as overflow in S1*, it means that the water flow can spread downward, and the downward spreading process of the lane should be prioritized at this time; the point in S* is the overflow point, and the lane is marked as the overflow lane in S1*, the node is added to C*, the lane is added to R*, the current water level elevation H is set as the elevation of the overflow point, and the process goes to step S304;

[0048] If there are points equal to the current water level H and they are not marked in S* or S1*, then add these points to C*, add the lanes to R*, and finally mark the state as flooded in S* and S1*, and jump to step S304;

[0049] If the elevations of the connected nodes are all higher than H, then the lowest elevation point in S* or S1* that is not marked as submerged is added to C*, the lane information is added to R*, and it is marked as submerged in S* and S1*. At the same time, the water level elevation is modified to the elevation of the point, and the process jumps to step S304;

[0050] Step S304, repeat step S303, when all nodes and lanes in S* and S1* are marked as flooded, the process ends and the water flow returns to the upward flooding path R*.

[0051] As an implementable optimal solution, the dynamic flooding numerical simulation module is also used to calculate the spreading speed and spreading time of the water flow to obtain the flooding situation of the mine tunnel at any time of water inrush, which specifically includes the following contents:

[0052] The flow rate is calculated using the following formula:

[0053]

[0054] Where, v is the average flow velocity of the section (m / s); R = A / P_w is the hydraulic radius (m), A is the cross-sectional area of ​​the water flow, P_w is the circumference of the contact part between the water flow and the solid boundary, called the wetted perimeter; J = h_f / l is the hydraulic gradient, h_f is the head loss along the flow section l; C = R^(1 / 6) / n is the Schertz coefficient, n is the roughness, 0.02~0.2;

[0055] The water flow velocity is calculated using the following formula:

[0056]

[0057] In the formula, m is the mass of the fluid, and h is the height difference between the start and end of the shaft;

[0058] According to the length of the downward spreading tunnel and the downward flow velocity, the position of the water flow front in the tunnel and the height of the water flow surface at any time are calculated;

[0059] Calculate the time required for the lane to be flooded,

[0060]

[0061] Wherein, V is the volume of the tunnel, which is calculated by the tunnel length and tunnel cross-sectional area; V_1 is the volume flooded during flow, and if the tunnel has not experienced flow, the value is 0; Q is the water inrush per unit time.

[0062] In a second aspect, the disclosed embodiment also provides a mine water hazard simulation method, characterized in that the above-mentioned mine water hazard simulation system is used. BRIEF DESCRIPTION OF THE DRAWINGS

[0063] Figure 1 This is a schematic diagram of the architecture of a mine water hazard simulation system.

[0064] Figure 2 It is a schematic diagram for extracting shaft and tunnel network nodes and connection relationships based on CAD drawings.

[0065] Figure 3 This is a node diagram before local lane encryption.

[0066] Figure 4 This is a schematic diagram of the nodes after local alley encryption.

[0067] Figure 5 This is a flow chart of the algorithm for retrieving the path for downward water flow.

[0068] Figure 6 Flowchart of the algorithm for retrieving the upward flooding path of water flow.

[0069] Figure 7 Schematic diagram of the flooding process.

[0070] Figure 8 Schematic diagram of tunnel flooding status.

[0071] Fig. 9 Schematic diagram of the structure of an electronic device according to an embodiment of the present invention. DETAILED DESCRIPTION

[0072] In order to make the technical solution and advantages of the present application clearer, the technical solution of the present invention will be further described in detail below in conjunction with the accompanying drawings. It will be understood that the specific embodiments described herein are only partial embodiments of the present invention, which are only used to explain the present application, rather than to limit the present application. It should be noted that the technical features or combinations of technical features described in the following embodiments should not be considered isolated, and they can be combined with each other to achieve better technical effects. The same reference numerals appearing in the drawings of the following embodiments represent the same features or components, which can be applied to different embodiments.

[0073] In addition, unless otherwise defined, the technical terms or scientific terms used in the description of the present invention should have the common meanings understood by those skilled in the art in the art to which the present invention belongs.

[0074] The present invention is further described in detail below in conjunction with the accompanying drawings:

[0075] Reference Figure 1 ,A mine water disaster simulation system includes a mine tunnel space network system building module, a dynamic flooding numerical simulation module, and a disaster avoidance route retrieval module.

[0076] The shaft and tunnel space network system building module includes a mine tunnel network generation submodule and a node encryption submodule.

[0077] The mine tunnel network generation submodule generates a mine tunnel network represented by points and lines based on the measured tunnel data information (including the spatial position relationship of the tunnel represented by three-dimensional coordinate points (x, y, z), the cross-sectional dimensions of the tunnel, etc.). The result file includes text storing the tunnel node information and tunnel segment information, as well as the visualization VTK (Visualization Toolkit) file of the tunnel network. The tunnel node encryption submodule is used to identify the tunnel segments that are too long and split and encrypt them.

[0078] The specific process of the mine tunnel network generation submodule is as follows:

[0079] Establish a three-dimensional coordinate system and use measuring instruments such as total stations, theodolites and levels to accurately measure the three-dimensional coordinates of tunnel nodes. The coordinate data includes the starting and ending points of the tunnel and all turning points. Establish a three-dimensional coordinate system corresponding to the actual mine in the simulation system

[0080] Tunnel node modeling, through on-site investigation and mine design drawings, determine the connection relationship between tunnel nodes and establish the topological structure between nodes. Create tunnel nodes in the simulation model based on the measured three-dimensional coordinates. Draw tunnels in the model based on the connection relationship between nodes to ensure the accuracy of the topological structure.

[0081] Cross-sectional morphology modeling: conduct cross-sectional morphology surveys on the lanes and record the cross-sectional shapes of different lanes, such as circular, arched, trapezoidal, and rectangular. According to the cross-sectional morphology surveyed, assign the corresponding cross-sectional shape to each lane.

[0082] Assign section attributes, assign measured attributes such as width and height to the corresponding tunnel section.

[0083] Tunnel type labeling: According to the geological conditions of the tunnel, different types of tunnels are labeled in the model so that they can be distinguished in the simulation.

[0084] Closure information integration records the closure information of the lanes, including whether they are closed, the traffic and drainage conditions after closure. The closure information is integrated into the model, and for closed lanes, its attributes are adjusted to reflect the actual situation.

[0085] In addition, manual extraction can also be performed based on the mine excavation tunnel layout diagram. Figure 2 (A) is the roadway plan, where you can intuitively see the roadway intersections and turning points, and convert them into nodes for numbering and marking ( Figure 2 (B) Red dots and numbers). Finally, the connection relationship of each lane is constructed according to the node number ( Figure 2 (Black numbers in (B)), such as node 1 and node 2 are connected to form lane 1. The coordinates and marked elevations of the plan view can obtain the approximate spatial coordinates (x, y, z) of nodes 1-10.

[0086] In order to facilitate data import and processing, the input data of the shaft and lane network is divided into two sets, namely the node information set and the lane information set. According to the previous description, the data structures of the two sets are shown in Table 1 and Table 2:

[0087] Table 1

[0088] Parameter name Node original number X coordinate Y coordinate Z coordinate Variable Name OriId nx ny nz Data Types Int Double Double Double

[0089] Table 2

[0090] Parameter name Original lane number Lane starting point End of the road Closure Type length length Variable Name OriRoadId D1 D2 type Wideth Length Data Types Int Int Int Int Double Double

[0091] To construct a three-dimensional network model of shafts and lanes based on basic data, it is necessary to determine the network connectivity between key points of shafts and lanes, the distance between connected nodes (length of lanes), and the slope of lanes. Therefore, the spatial network of shafts and lanes can be abstracted as a spatial directed graph; but the direction of each lane in the directed graph is dynamic and depends on the direction of the water inrush flow. In addition, some lanes may be bidirectional. The reason is that from the development process of water inrush, when the water inrush flow spreads downward and the water level rises upward and flows through the same section of the lane, the corresponding flow-flooding process of the lane is a bidirectional process. It can be seen that the determination of the direction in the spatial network directed graph of shafts and lanes is determined by the direction of the water inrush flow. Therefore, the data structure of the three-dimensional shaft and lane network model needs to consider the connectivity of the network and the bidirectionality of the flow.

[0092] The traditional adjacency matrix and adjacency table structure methods have their advantages and disadvantages, but they cannot fully meet the data storage needs of the two algorithms of tunnel water inrush and disaster avoidance. Mines, especially old mines, have many tunnels and nodes, and the analysis and calculation process is complicated. Therefore, the storage structure of the tunnel network must meet the storage needs of large amounts of data in space and the calculation needs in time.

[0093] by Figure 2Taking the simple shaft and tunnel network in as an example, the process of constructing a three-dimensional shaft and tunnel network is as follows:

[0094] Step S101, first extract the basic information of the shaft and tunnel grid, as shown in Table 3 and Table 4.

[0095] Table 3 Lane node parameters

[0096] Node original number X coordinate Y coordinate Z coordinate 1 - - - 2 - - - 3 - - - 4 - - - 5 - - -

[0097] Table 4 Lane input parameters

[0098] Original lane number Lane starting point End of the road Closure Type width high 1 1 2 - - - 2 2 3 - - - 3 3 4 - - - 4 2 5 - - - 5 5 6 - - -

[0099] Step S102: To ensure the directionality of the lane, a lane parameter set is copied, and the starting point and the end point in the copied data are swapped and then merged with the original information set. In the new lane data set, each lane appears twice, and the lane nodes at both ends are used as a starting point.

[0100] Step S103, the merged lane information set is arranged in an extended ascending order with the starting point number as a priority condition and the end point number as a secondary condition.

[0101] Step S104, counting the number of times each node appears in the sorted lane starting point number column, the value is the total coordination number, which represents the number of lanes connected to a node, and the value is stored in the lane node information set.

[0102] Step S105, the total coordination number is accumulated along the column direction, and the obtained value is the cumulative total coordination number, which represents the cumulative number of connected lanes from the first lane node to the current node.

[0103] Step S106, since the subscript of the C++ array starts from 0, in order to facilitate the subsequent simulation, the node and lane numbers are mapped to a data column starting from 0.

[0104] The final constructed three-dimensional shaft and lane network information is shown in Tables 5 and 6. It can be seen from the figure that for the node with mapping number 0, the mapping number of the lane it is connected to is (accumulated total coordination number [0]-full coordination number [0]≤RoadId<accumulated total coordination number [0]). By looking up the number, the lane information can be quickly located in Table 6. In addition, the first and second lanes in Table 5 represent the same lane in opposite directions. This structure is crucial to accurately describe the flooding direction and the bidirectional process of overflow-flooding.

[0105] Table 5 Node parameters of three-dimensional shaft and tunnel network

[0106] Mapping Number X coordinate Y coordinate Z coordinate Full coordination number Cumulative total coordination number Node original number 0 - - - 1 1 1 1 - - - 4 5 2 2 - - - 2 7 3 3 - - - 1 8 4 4 - - - 3 11 5 5 - - - 1 12 6 6 - - - 2 14 7 7 - - - 4 18 8 8 - - - 1 19 9 9 - - - 1 20 10

[0107] Table 6 Tunnel parameters of three-dimensional shaft and tunnel network

[0108]

[0109]

[0110] In the process of network generation, it is also necessary to calculate the tunnel length, slope, equivalent side length of the tunnel section and other information according to the starting and ending coordinates of the tunnel. The final three-dimensional shaft and tunnel network data structure is shown in Tables 7 and 8.

[0111] Table 7 Node data structure of three-dimensional shaft and tunnel network

[0112]

[0113] Table 8 Lane data structure of three-dimensional shaft and lane network

[0114]

[0115]

[0116] This technical solution introduces the concepts of total coordination number and cumulative total coordination number in the process of grid construction. Under the premise of using a small amount of data storage space, it not only meets the needs of fast positioning of nodes and lanes in water hazard simulation, but also ensures the bidirectionality of the lanes and reduces the time required for simulation.

[0117] When measuring node location information, the intersection and inflection points of the lanes are usually selected as nodes, which may cause the lane length formed by two connected nodes to be too long. Sparse nodes will reduce the accuracy of water damage simulation. The specific implementation process of the node encryption submodule is as follows:

[0118] Set the length threshold of a single lane according to site requirements;

[0119] Traverse all lanes and store the lanes that are too long in a data set to be processed;

[0120] Using the interpolation method, nodes are inserted in the overlong lanes to divide the lanes into multiple lanes with lengths less than the threshold.

[0121] Add new nodes and lane information to the node parameters and lane parameter sets of the three-dimensional shaft and lane network, re-order them, and recalculate the total coordination number and cumulative total coordination number;

[0122] Output node and lane information in txt text and visualization VTK file. VTK file is a file format for storing three-dimensional computer graphics data. It is often used in science and engineering to visualize and analyze complex data sets. VTK files can contain various types of data, such as mesh data, polygon data, point data, line data, etc. This system uses VTK format to store relevant information of points and lines, and displays them in three dimensions in Paraview.

[0123] Reference Figure 3 and Figure 4 It can be seen that the overlong lanes are divided into short lanes of equal length. Although this will increase the number of nodes and lanes to a certain extent, resulting in an increase in the time required for water damage simulation, it can greatly improve the prediction accuracy. In addition, the coordination number fast positioning method adopted in this technical solution can also effectively reduce the consumption of computing resources due to the increase in the number of nodes.

[0124] The dynamic flooding numerical simulation module is used to complete the dynamic path solution of the water flow spreading process according to the water inrush point and water inrush rate, so as to predict the dynamic change process of the tunnel flooding state and water level elevation with the water inrush time. It is also used to call the result output function to output the location of the flooded tunnels, the total volume of the flooded tunnels, the water level elevation and other information in the entire mine tunnel network in real time. Specifically, the dynamic flooding numerical simulation module includes the solution of the water flow downward flooding (overflow) path, the solution of the water flow upward (flooding) flooding path, the solution of the downward spread speed and spread time of the water inrush based on the Xie Cai formula, and the solution of the water flow upward flooding time based on the cumulative water inrush amount.

[0125] Based on the constructed three-dimensional shaft and tunnel network, the simulation of the spreading path of water damage in the tunnel can be regarded as the traversal of the spatial directed graph. However, under the influence of gravity, the water flow always moves from high to low. After reaching the low point, the water flow begins to accumulate. With the continuous inrush of water, the water level in the flooded shaft and tunnel continues to rise until the water level reaches equilibrium. Therefore, in the development of the simulation system, the spreading of the water flow in the shaft and tunnel is decomposed into two sub-processes: the downward spreading of the water flow (overflow) and the upward rise of the water level (flooding).

[0126] The turning point of water flow spreading downward and rising upward is the global or local lowest point in the shaft and tunnel network. The global lowest point is the lowest elevation point of the shaft and tunnel engineering system; the local lowest point means that after the water flow spreads to this point, the elevations of all nodes connected to this point that are not passed by the water flow are higher than this point, and this point is not the lowest elevation point of the shaft and tunnel engineering. Therefore, when the water flow spreads along the tunnel, if the elevation of the connected node is lower, the water flow will spread downward; otherwise, the water flow will begin to flood upward. In a complex shaft and tunnel network, the sub-processes of flow and flooding will alternate many times, so it is necessary to use the flooding spread path algorithm to simulate this process.

[0127] When a water inrush accident occurs in a mine, a large amount of groundwater will be ejected from the water inrush point, and the water will quickly spread to other tunnels under the action of hydraulic gradient. When there is no height difference between tunnels, the water flow spreading process can be quickly constructed through the tree structure. However, the actual three-dimensional tunnel is a collection of horizontal tunnels and slopes, vertical shafts, and chutes. When water flows to the intersection of multiple tunnels, if the tunnels are all horizontal tunnels, the water flow does not make a priority choice, and multiple horizontal tunnels will flow in; but when the node elevation connected to the intersection is lower, the water flow will flow into these tunnels first under the action of gravity, and the spread of other tunnels will be temporarily suspended.

[0128] Reference Figure 5 ,The specific implementation process of the flow path retrieval algorithm is as follows:

[0129] Step S201, import the node information set Points and the shaft and lane information set Roads of the three-dimensional shaft and lane network, and set the water burst point number t. Apply for the flow node set S, which is used to mark the nodes that the water flow has passed; apply for the retrieval node set C, which is used to store the latest nodes of the current water flow. By traversing the elevation and flooding status of the nodes connected to the set C, the spreading direction of the water flow is determined. When all the connected points are higher than the points in the set, the spreading end e is found. This node is the end point of this downward spreading process and the starting point of the water flow upward flooding process; apply for the flow lane information set R, which contains the mapping number of the flow lane, the lane starting point and the lane end point and other information. Under the data structure of the full coordination number, the saved flow lane can describe the flow direction of the lane, and the water flow in the lane records the lane flowing from the starting point to the lane end.

[0130] Step S202, starting from the water inrush point t, quickly locate all connected nodes in the lane information set through the full coordination number and the cumulative full coordination number, count all nodes with elevations less than or equal to t, and add the connected points with the lowest elevation to the retrieval node set C, and mark the node t in the flow node set S, store the lane formed by the two points in the flow lane information set R, and jump to step S203; if the elevations of the connected nodes are all greater than the elevation of point t, it means that there is no downward diffusion path, exit this cycle, and start the upward flooding path search with t as the starting point.

[0131] Step S203, determine whether the search node set C is empty, if C is an empty set, the process ends and returns to the flow lane information set R. If C is not empty, it is necessary to determine the node elevation connected to the set C. If the elevation of the lowest point is lower than the node in C, and the node is not marked in S, then the search set C is cleared, and the connected point is added to the search set C from Points, and the point is marked in S, and the lane formed by the two points is stored in the flow lane information set R, and jump to step S204; when the connected lowest point is the same as the elevation of the node in C, and the node is not marked in S, the connected point is added to the search set C, and the lane formed by the two points is stored in the flow lane information set R, and jump to step S204; if all connected nodes are higher than the elevation in C, it means that the water flow has no lanes to continue to spread downward, and the flow lane set R and the spreading end point e are returned, the process ends, and then the water flow upward flooding path search begins.

[0132] Step S204, jump to step S203, until the spreading end point e is found.

[0133] When searching for overflow paths, water flows preferentially to lanes with lower elevations until the water reaches the global or local lowest point, at which point the downward spread of water ends. After that, the overflow path search algorithm jumps to the flooding path search algorithm.

[0134] When the water flows downward to the global or local lowest point, the water continues to accumulate from that point and gradually spreads upward. This flooding process will continue until there is an unmarked node with a lower elevation at the latest flooded point. Figure 6 ,The specific implementation process of the flooded path retrieval algorithm is as follows:

[0135] Step S301, the starting point of the flooding is the end point e of the previous round of water flow. Import the node information set Points and the shaft and lane information set Roads of the three-dimensional shaft and lane network. Apply for the set S*, which is used to mark the flooding state of the node; apply for the set S1*, which is used to mark the flooding state of the lane, and the set length is the number of lanes in Roads; apply for the retrieval node set C*, which is used to store the latest nodes currently flooded; apply for the flooded lane information set R*, which contains the mapping number of the flooded lane, the lane starting point and the lane end point and other information; apply for the variable H to store the current water level elevation.

[0136] Step S302, mark the starting point e as submerged in the set S*, add point e to C*, set the current water level elevation H to the elevation of point e, and then quickly locate all connected nodes in the lane information set Roads through the full coordination number and cumulative full coordination number of node e in the set Points, determine the lowest elevation point n (the elevations of all connected nodes are higher than point e), mark n as submerged in S*, add n to C*, store the lane formed by nodes e and n in the submerged lane information set R*, and set the current water level elevation H to the elevation of point n.

[0137] Step S303, traverse the adjacent nodes of C*. If there is a node with an elevation less than the current water level elevation H, and the formed lane is not marked as overflow in S1*, it means that the water flow can spread downward, and at this time, the downward spreading process of the lane needs to be prioritized. In S*, this point is a overflow point, and in S1*, the lane is marked as an overflow lane. The node is added to C*, the lane is added to R*, the current water level elevation H is set as the elevation of the overflow point, and the process goes to step S304. If there are points equal to the current water level elevation H, and they are not marked in S* or S1*, these points are added to C*, the lane is added to R*, and finally the state is marked as flooded in S* and S1*, and the process goes to step S304. If the elevations of the connected nodes are all higher than H, then the lowest elevation point in S* or S1* that is not marked as submerged is added to C*, the lane information is added to R*, and it is marked as submerged in S* and S1*, and the water level elevation is modified to the elevation of the point. Jump to step S304.

[0138] Step S304, repeat step S303, when all nodes and lanes in S* and S1* are marked as flooded, the process ends and the water flow returns to the upward flooding path R*.

[0139] Through water damage simulation, the water damage spreading path of the whole process is obtained. However, in order to dynamically display the spreading process of water flow in the tunnel, it is necessary to calculate the spreading speed and spreading time of the water flow. In this way, the flooding situation of the mine tunnel at any time of water inrush can be obtained.

[0140] The spreading speed of water flow in the tunnel is not only related to the amount of water inrush, the length and width of the tunnel section, the tunnel length, the tunnel slope, the drainage capacity, the roughness coefficient and other factors. It is also related to the downward flow and upward flooding of the water flow. When flowing downward, the power mainly comes from gravity. At this time, the water flows downward in the tunnel at a certain liquid level. The influencing factors include the amount of water inrush, the tunnel slope, the length and width of the section, etc.; while in the upward flooding process, the water flow continues at the bottom, gradually raising the water surface to flood the tunnel. The flooding speed at this time is related to the amount of water inrush and the tunnel volume. Therefore, according to the different water flow states (flow or flooding) in the tunnel, they are calculated separately. The specific process is as follows:

[0141] Step S401, the process of water flowing under gravity can be regarded as open channel flow, and the flow rate is calculated as follows:

[0142]

[0143] In the formula, v is the average flow velocity of the section (m / s); R=A / P_w is the hydraulic radius (m), A is the water-passing cross-sectional area, P_w is the circumference of the contact part between the water flow and the solid boundary, called the wetted perimeter; J=h_f / l is the hydraulic gradient, h_f is the head loss along the flow section l; C=R^(1 / 6) / n is the Scheeren coefficient, n is the roughness, 0.02~0.2.

[0144] The downward spread in the shaft tunnel can be regarded as the free fall motion of water flow, and the water flow velocity calculation formula is as follows:

[0145]

[0146] Where m is the mass of the fluid and h is the height difference between the start and end of the shaft.

[0147] According to the length of the downward spreading tunnel and the downward flow velocity, the position of the water flow front in the tunnel and the height of the water flow surface at any time can be calculated.

[0148] Step S402, the flooding process of water flow can be regarded as the volume of the tunnel being gradually filled with water from bottom to top. When the water flow flowing into the tunnel per unit time is a constant value, the time required for the tunnel to be flooded can be calculated.

[0149]

[0150] Wherein, V is the volume of the tunnel, which is calculated by the tunnel length and tunnel cross-sectional area; V_1 is the volume flooded during flow, and if the tunnel has not experienced flow, the value is 0; Q is the water inrush per unit time.

[0151] Step S403, conduct water inrush simulation of complex shaft and tunnel networks to test the effectiveness of the developed water disaster simulation system. A complex shaft and tunnel network is selected as an example for simulation. The shaft and tunnel network contains 1434 nodes and 1575 tunnels. After using the tunnel encryption module, the number of nodes is 1513 and the number of tunnels is 1654. After randomly assigning the water inrush point, the water inrush spreading process in the shaft and tunnel network is simulated to predict the spatiotemporal dynamic changes of the water flow. Figure 4The flooding status of the tunnels at different times is shown. In the figure, the red ball represents the water inrush point, the blue tunnel represents the water intrusion tunnel, the white represents the flow tunnel, and the red represents the flooded tunnel. The Maiduoshan coal seam has a certain inclination. In the process of moving from the main tunnel to the water inrush point, the tunnel elevation is gradually reduced. Therefore, the working face where the water inrush point is located is located at the low point of the entire tunnel network. At the beginning of the water inrush, the water first flows downward through a small section of the tunnel and then reaches the global or local lowest point, such as Figure 7 As shown in (A), the water flow then began to flood the tunnel upwards. Affected by the inclination angle of the coal seam, the elevation change parallel to the working face was not obvious, so multiple working faces were flooded at the same time. Figure 7 (B)-(D) greatly slowed down the speed at which water flooded the main tunnel, giving underground workers ample time to evacuate the disaster.

[0152] The disaster escape route retrieval module is used to solve the shortest escape route in real time according to the location of the flood, the flooding status of the tunnel network at the current moment, the location of the disaster escape chamber or exit, and the location of the trapped personnel. The path solution results are saved in the output visualization VTK file and can be directly viewed in the three-dimensional visualization results of the tunnel network. In the event of a sudden water accident, it can make correct judgments in time based on effective data and information, and select a safe, reliable and efficient disaster escape route. Quickly issue underground evacuation instructions to enable staff to reach designated safe locations and reduce casualties underground. At the same time, the application of the optimal disaster escape path algorithm also provides rescue personnel with a rescue command channel, so that rescue work can reach the disaster relief site more promptly and effectively.

[0153] The specific implementation process of the disaster avoidance route retrieval module is as follows:

[0154] Step S501, setting the water inrush time, obtaining the tunnel flooding status through water disaster simulation, and using the shaft and tunnel nodes, tunnel network information and flooding status as the basic information for determining the disaster avoidance route.

[0155] Step S502, input the disaster evacuation starting point set Starts and the disaster evacuation end point set Ends.

[0156] Step S503, apply for dynamic storage space dist, whose length is the number of lane nodes and the initial value is infinite, which is used to store the shortest distance from the source point to each vertex; apply for dynamic storage space sptSet, whose length is the number of lane nodes and the initial value is false, which is used to record the nodes for which the shortest path has been found (the value becomes true); apply for dynamic storage space parent, record the parent node of each node, which is used to construct a disaster avoidance path.

[0157] Step S504, read the first escape point number n from Ends as the source point, assign the value of the corresponding position of the source point in dist to 0, indicating that the distance from the source point to itself is 0. Assign the value of the corresponding position of the source point in parent to n, indicating that the parent node of the source point is itself.

[0158] Step S505, traverse all nodes, and determine the node closest to the source point and not marked as True in sptSet through dist. If the distance from the node to the source point is infinite, it means that the shortest path retrieval of all connected nodes is completed, jump out of the loop, and output the distance from the node to the source point in Starts and the disaster avoidance route obtained by finding the parent node through parent. If the distance to the source point is not infinite, mark the corresponding value of the node in sptSet as true, and then find the connected node through the total coordination number and the cumulative total coordination number. When the sptSet value of the connected node is false, the connected lane is not flooded, and the sum of the dist value of the search point and the lane length is less than the dist value of the connected node, the dist value of the connected node and the parent node are updated. Jump to step S506.

[0159] Step S506, repeatedly call step S505 until the sptSet values ​​of all connected lane nodes are marked as true. Output the distance from the node in Starts to the source point and the disaster avoidance route obtained by searching the parent node through parent.

[0160] Step S507, traverse the points in Ends, use them as source points in turn, repeat steps S504 to S506, and determine the number of starting points × the number of end points of disaster avoidance routes. The length of the disaster avoidance route is used as the basis for judgment, and finally a shortest disaster avoidance route is determined for each disaster avoidance starting point.

[0161] Generally speaking, the shortest disaster avoidance path uses distance as the weight to analyze the shortest distance between points. However, the mine disaster avoidance route must also consider the passability, slope, degree of obstruction, etc. of the tunnel. Otherwise, the disaster avoidance route may have the shortest distance but may take a longer time to escape. Therefore, the optimal disaster avoidance path needs to be solved.

[0162] In the shortest path algorithm, the value of dist is only the length of the lane. In the optimal disaster avoidance path solution, the value of dist represents the lane length after multi-factor weight correction. The formula is as follows:

[0163]

[0164] Among them, l i j represents the length of the lane, n is the number of factors considered; w m is the weight of the factor affecting the escape speed of personnel; Li j is the lane weight after multi-factor correction.

[0165] We continue to use a complex shaft and tunnel network as an example to carry out simulation and verify the effectiveness of the disaster avoidance route retrieval module.

[0166] Set the node with mapping number 948 as the water inrush point and carry out dynamic flooding simulation. Take the tunnel flooding state after 12 hours of water inrush as an example to demonstrate the developed disaster avoidance route finding algorithm. Figure 8 In (A), the red line segments represent flooded lanes, the white lines represent lanes with flow, and the blue lines represent lanes that are not invaded by water.

[0167] Set the escape starting point to 1922 and the evacuation end point to 4. The evacuation routes retrieved are as follows: Figure 8 As shown by the purple line segment in (B), the path is: 1922→2127→1921→1920→1923→651→1991→1992→2000→1956→1955→1952→718→807→808→809→810→811→812→813→4, and the cumulative path length is 2097.34m.

[0168] The disclosed embodiment also provides a mine water hazard simulation method, which utilizes the above-mentioned mine water hazard simulation system.

[0169] The embodiment of the present disclosure further provides a storage medium, in which a computer program is stored. When the computer program is executed by a processor, all steps of the above-mentioned mine water hazard simulation method can be implemented.

[0170] Those of ordinary skill in the art can understand that all or part of the processes in the mine water hazard simulation method can be implemented by instructing related hardware through a computer program, and the program can be stored in a non-volatile computer-readable storage medium. When the program is executed, it can include the processes of various embodiments of the mine water hazard simulation method. Among them, any reference to memory, storage, database or other media used in the embodiments provided in this application may include non-volatile and / or volatile memory. Non-volatile memory may include read-only memory (ROM), programmable ROM (PROM), electrically programmable ROM (EPROM), electrically erasable programmable ROM (EEPROM) or flash memory. Volatile memory may include random access memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double data rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous link (Synchlink) DRAM (SLDRAM), memory bus (Rambus) direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), etc.

[0171] The embodiment of the present application also provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein the processor implements the steps of the above-mentioned mine water hazard simulation method when executing the program. In the embodiment of the present application, the processor is the control center of the computer system, which can be a processor of a physical machine or a processor of a virtual machine.

[0172] Reference Fig. 9 The electronic device 500 includes: at least one processor 501, at least one communication interface 502, at least one memory 503 and at least one bus 504. The bus 504 is used to realize the connection and communication between these components, the communication interface 502 is used to communicate with other node devices for signaling or data, and the memory 503 stores machine-readable instructions executable by the processor 501. When the electronic device 500 is running, the processor 501 communicates with the memory 503 through the bus 504, and when the machine-readable instructions are called by the processor 501, the steps of the mine water hazard simulation method as described above are executed.

[0173] The above contents are only embodiments of the present invention. The common sense such as the known specific structures and characteristics in the scheme is not described in detail here. The ordinary technicians in the relevant field know all the common technical knowledge in the technical field to which the invention belongs before the application date or the priority date, can obtain all the existing technologies in the field, and have the ability to apply the conventional experimental means before that date. The ordinary technicians in the relevant field can improve and implement this scheme in combination with their own abilities under the enlightenment given by this application. Some typical known structures or known methods should not become obstacles for the ordinary technicians in the relevant field to implement this application. It should be pointed out that for the technicians in this field, without departing from the structure of the present invention, several deformations and improvements can be made, which should also be regarded as the protection scope of the present invention, which will not affect the effect of the implementation of the present invention and the practicality of the patent. The protection scope required by this application shall be based on the content of its claims, and the specific implementation methods and other records in the specification can be used to explain the content of the claims.

Claims

1. A mine water hazard simulation system, characterized in that: include: A shaft and tunnel spatial network system building module, which is used to generate a point-line structure representing the mine tunnel network; Dynamic flooding numerical simulation module, used to simulate the dynamic path of water flow during mine flooding; The disaster escape route retrieval module is used to retrieve the shortest escape route according to the real-time tunnel network flooding status when a mine flood occurs, including the following: Set the water inrush time and obtain the tunnel flooding state through water disaster simulation; input the disaster avoidance starting point set and disaster avoidance end point set; apply for dynamic storage space dist, whose length is the number of tunnel nodes, used to store the shortest distance from the source point to each vertex. The value of dist represents the tunnel length after multi-factor weight correction. The formula is as follows: Among them, l i j represents the length of the lane, n is the number of factors considered; w m is the weight of the factor affecting the escape speed; L i j is the lane weight after multi-factor correction.

2. A mine water hazard simulation system according to claim 1, characterized in that: The shaft and tunnel spatial network system construction module includes a mine tunnel network generation submodule. The specific process of the mine tunnel network generation submodule is as follows: The measuring instrument measures the three-dimensional coordinates of the tunnel nodes and establishes a three-dimensional coordinate system corresponding to the actual mine in the simulation system; Determine the connection relationship between lane nodes, establish the topological structure between nodes, create lane nodes in the simulation model according to the measured three-dimensional coordinates, and draw lanes in the model according to the connection relationship between nodes; Conduct a cross-sectional morphology survey of the tunnels, and assign a corresponding cross-sectional shape to each tunnel based on the surveyed cross-sectional morphology; Assign the measured attributes to the corresponding tunnel section, the measured attributes include width and height; Different types of tunnels are marked according to their geological conditions so that they can be distinguished in simulation; Closed information integration, record the closed information of the lane; integrate the closed information into the model and adjust the properties of the closed lane.

3. A mine water hazard simulation system according to claim 2, characterized in that: The process of constructing the 3D mine tunnel network in the mine tunnel network generation submodule is as follows: Extract the basic information of the shaft and lane grid; copy a set of lane parameters, swap the starting point and end point in the copied data, and merge it with the original information set; The merged lane information set is arranged in an extended ascending order with the starting point number as the priority condition and the end point as the secondary condition; Count the number of times each node appears in the sorted lane starting point number column. This value is the total coordination number, which represents the number of lanes connected to a node. The total coordination number is accumulated along the column direction, and the value obtained is the cumulative total coordination number, which represents the cumulative number of connected lanes from the first lane node to the current node; Map the node and lane numbers to data columns starting from 0; quickly locate lane information in the table by looking up the numbers.

4. A mine water hazard simulation system according to claim 2, characterized in that: The building module of the shaft and lane space network system also includes a node encryption submodule, and the specific implementation process is as follows: Set the length threshold of a single lane; traverse all lanes; use the interpolation method to insert nodes in the lanes that are too long, and divide the lanes into multiple lanes with lengths less than the threshold; Add new nodes and lane information to the node parameters and lane parameter sets of the three-dimensional shaft and lane network, re-sort them, and recalculate the total coordination number and cumulative total coordination number.

5. A mine water hazard simulation system according to claim 4, characterized in that: Output the node and lane information in txt text and visualization VTK file, use VTK format to store the relevant information of points and lines, and display it in three dimensions in Paraview.

6. A mine water hazard simulation system according to claim 1, characterized in that: The dynamic flooding numerical simulation module is used to complete the dynamic path solution of the water flow spread process according to the water inrush point and water inrush rate, so as to predict the dynamic change process of the tunnel flooding state and water level elevation with the water inrush time; it is also used to call the result output function to output the location of the flooded tunnels, the total volume of the flooded tunnels and the water level elevation in the entire mine tunnel network in real time.

7. A mine water hazard simulation system according to claim 1, characterized in that: The specific implementation process of the flow path retrieval algorithm in the dynamic flooding numerical simulation module is as follows: Step S201, importing the node information set and the shaft and lane information set of the three-dimensional shaft and lane network, setting the water inrush point t number; applying for a flow node set to mark the nodes that the water flow has passed; applying for a retrieval node set to store the latest nodes of the current water flow spread; determining the spreading direction of the water flow by traversing the elevation and submerged state of the nodes connected to the set; when all the connected points are higher than the points in the set, the spreading end point is found; applying for a flow lane information set, the set contains the mapping number of the flow lane, the lane start point and the lane end point; under the data structure of the full coordination number, the saved flow lane can describe the flow direction of the lane, and the water flows from the recorded lane start point to the lane end point in the lane; Step S202, starting from the water inrush point t, quickly locate all connected nodes in the lane information set through the full coordination number and the cumulative full coordination number, count all nodes with elevations less than or equal to t, and add the connected points with the lowest elevations into the search node set, and mark the node t in the flow node set, store the lane formed by the two points in the flow lane information set, and jump to step S203; if the elevations of the connected nodes are all greater than the elevation of point t, it means that there is no downward diffusion path, exit this cycle, and start the flooding path retrieval algorithm retrieval with t as the starting point; Step S203, determine whether the search node set is empty, if it is an empty set, then end and return to the flow lane information set, if it is not empty, then need to determine the node elevation connected to the search node set; if the lowest point elevation is lower than the node in the search node set, and the node is not marked in the flow node set, then clear the search node set, and add the connected point from the node information set to the search node set, and mark the point in the flow node set, store the lane formed by the two points in the flow lane information set, and jump to step S204; when the connected lowest point is the same as the node elevation in the search node set, and the node is not marked in the flow node set, add the connected point to the search node set, store the lane formed by the two points in the flow lane information set, and jump to step S204; if all connected nodes are higher than the elevation in the search node set, it means that the water flow has no lanes to continue to spread downward, return to the flow lane set and the spreading end point, the program ends, and then starts the water flow and flooding path search algorithm search; Step S204, jump to step S203, until the spreading end point is found.

8. A mine water hazard simulation system according to claim 7, characterized in that: The specific implementation process of the flooding path retrieval algorithm in the dynamic flooding numerical simulation module is as follows: Step S301, the starting point of water flow flooding is the end point e of the water flow spreading downward; import the node information set and the shaft and lane information set of the three-dimensional shaft and lane network; apply for set S*, which is used to mark the flooded state of the node; apply for set S1*, which is used to mark the flooded state of the lane, and the set length is the number of lanes in the shaft and lane information set; apply for the retrieval node set C*, which is used to store the latest node currently flooded; apply for the flooded lane information set R*, which includes the mapping number of the flooded lane, the lane starting point and the lane end point; apply for the variable H to store the current water level elevation; Step S302, mark the starting point e in the set S* as submerged, add the point e into C*, set the current water level elevation H as the elevation of the point e, then quickly locate all connected nodes in the lane information set through the full coordination number and the cumulative full coordination number of the node e in the node information set, determine the lowest elevation point n, mark n as submerged in S*, add n into C*, store the lane formed by the e and n nodes in the submerged lane information set R*, and set the current water level elevation H as the elevation of the point n; Step S303, traverse the adjacent nodes of C*, if there is a node whose elevation is less than the current water level elevation H, and the formed lane is not marked as overflow in S1*, it means that the water flow can spread downward, and the downward spreading process of the lane should be prioritized at this time; the point in S* is the overflow point, and the lane is marked as the overflow lane in S1*, the node is added to C*, the lane is added to R*, the current water level elevation H is set as the elevation of the overflow point, and the process goes to step S304; If there are points equal to the current water level H and they are not marked in S* or S1*, then add these points to C*, add the lanes to R*, and finally mark the state as flooded in S* and S1*, and jump to step S304; If the elevations of the connected nodes are all higher than H, then the lowest elevation point in S* or S1* that is not marked as submerged is added to C*, the lane information is added to R*, and it is marked as submerged in S* and S1*. At the same time, the water level elevation is modified to the elevation of the point, and the process jumps to step S304; Step S304, repeat step S303, when all nodes and lanes in S* and S1* are marked as flooded, the process ends and the water flow returns to the upward flooding path R*.

9. A mine water hazard simulation system according to claim 8, characterized in that: The dynamic flooding numerical simulation module is also used to calculate the spreading speed and spreading time of the water flow, and obtain the flooding situation of the mine tunnel at any time of water inrush, including the following contents: The flow rate is calculated using the following formula: Where, v is the average flow velocity of the section (m / s); R = A / P_w is the hydraulic radius (m), A is the cross-sectional area of ​​the water flow, P_w is the circumference of the contact part between the water flow and the solid boundary, called the wetted perimeter; J = h_f / l is the hydraulic gradient, h_f is the head loss along the flow section l; C = R^(1 / 6) / n is the Schertz coefficient, n is the roughness, 0.02~0.2; The water flow velocity is calculated using the following formula: In the formula, m is the mass of the fluid, and h is the height difference between the start and end of the shaft; According to the length of the downward spreading tunnel and the downward flow velocity, the position of the water flow front in the tunnel and the height of the water flow surface at any time are calculated; Calculate the time required for the lane to be flooded, Wherein, V is the volume of the tunnel, which is calculated by the tunnel length and tunnel cross-sectional area; V_1 is the volume flooded during flow, and if the tunnel has not experienced flow, the value is 0; Q is the water inrush per unit time.

10. A mine water hazard simulation method, characterized in that: A mine water hazard simulation system as described in claims 1-9 is used.

Images