Method, device and electronic equipment for determining escape route of underground water seepage disaster

Abstract

The present application discloses a method, device and electronic device for determining an escape path for underground water seepage disasters, the method comprising: obtaining an undirected graph corresponding to a tunnel; obtaining an influencing factor of the tunnel equivalent length, and obtaining a comprehensive tunnel equivalent length according to the influencing factor; obtaining an escape path corresponding to the shortest total comprehensive tunnel equivalent length according to the comprehensive tunnel equivalent length and an improved shortest path algorithm; obtaining data information in the tunnel, and correcting the escape path according to the data information to determine a target escape path. Thus, the present application can obtain an escape path under the premise of ensuring safety through an improved shortest path algorithm, and at the same time, can dynamically obtain the final target escape path according to the real-time data information in the tunnel, so as to gain the longest time for underground personnel to escape and provide more scientific and accurate decision support for underground water seepage disasters.

Description

Technical Field

[0001] The present application relates to the field of mine safety technology, and in particular to a method, device and electronic equipment for determining an escape route for underground water seepage disasters. Background Art

[0002] As the lifeline for underground personnel to escape when a mine disaster occurs, the disaster escape route is an important part of the guarantee of mine safety production and the prevention and control of major accidents. Mine flooding disaster is one of the major sudden disasters second only to gas explosions. Due to the complex and changeable hydrogeological conditions of the coal mining environment, mine flooding accidents still occur from time to time. In related technologies, pre-planned disaster escape routes are often used, and the impact of secondary disasters and personnel congestion on escape is not considered under disaster conditions. Therefore, when a mine flooding accident occurs, how to dynamically determine an optimal escape route based on the real-time situation of the disaster and guide the safe evacuation of the affected personnel has become an urgent problem to be solved.

[0003] Therefore, how to dynamically obtain the escape route according to the real-time situation of the disaster to improve the accuracy and reliability of obtaining the escape route has become an urgent problem to be solved. Summary of the invention

[0004] The present application aims to solve one of the technical problems in the related art at least to some extent.

[0005] To this end, the first purpose of the present application is to propose a method for determining an escape route for underground water seepage disasters, so as to solve the technical problem in the prior art that the escape route cannot be dynamically obtained according to the real-time situation of the disaster.

[0006] In order to achieve the above-mentioned objectives, the first aspect of the embodiment of the present application provides a method for determining the escape path of an underground water seepage disaster, the method comprising: obtaining an undirected graph corresponding to the tunnel, wherein the undirected graph comprises tunnel nodes, tunnel edges and tunnel equivalent length; obtaining an influencing factor of the tunnel equivalent length, and obtaining a comprehensive tunnel equivalent length according to the influencing factor; obtaining an escape path corresponding to the shortest total comprehensive tunnel equivalent length according to the comprehensive tunnel equivalent length and an improved shortest path algorithm; obtaining data information in the tunnel, and correcting the escape path according to the data information to determine the target escape path.

[0007] In addition, the method for determining an escape route for underground water seepage disaster according to the above embodiment of the present application may also have the following additional technical features:

[0008] According to an embodiment of the present application, the obtaining of the undirected graph corresponding to the lane includes: obtaining spatial data of the lane; and abstracting the lane into the undirected graph based on the spatial data.

[0009] According to one embodiment of the present application, obtaining the influencing factor of the equivalent length of the lane includes: obtaining the influencing factor of the lane; obtaining a first travel time through the lane when the influencing factor exists and a second travel time through the lane when the influencing factor does not exist; and obtaining the influencing factor of the equivalent length of the lane based on the first travel time and the second travel time.

[0010] According to an embodiment of the present application, obtaining the comprehensive tunnel equivalent length according to the influencing factor includes: obtaining the actual length of the tunnel; and obtaining the comprehensive tunnel equivalent length according to the influencing factor and the actual length.

[0011] According to one embodiment of the present application, the escape path corresponding to the shortest total comprehensive laneway equivalent length is obtained based on the comprehensive laneway equivalent length and the improved shortest path algorithm, including: determining the disaster source node and the escape node from the lane nodes, and obtaining a set of distances from the disaster source node to all the lane nodes; obtaining the first node corresponding to the shortest total comprehensive laneway equivalent length from the distance set; in response to the first node being consistent with the escape node, determining the path between the disaster source node and the escape node as the escape path.

[0012] According to one embodiment of the present application, the determination method further includes: presetting a marked node set and an unmarked node set of the escape path, wherein the marked node set is an empty set, and the unmarked node set includes all the lane nodes; in response to the first node being inconsistent with the escape node, adding the first node to the marked node set.

[0013] According to one embodiment of the present application, the determination method also includes: obtaining the neighboring nodes of the first node, determining that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring node is less than the distance between the neighboring node and the disaster source node, then updating the distance between the neighboring node and the disaster source node in the distance set and the parent node corresponding to the neighboring node in the parent node set; determining that the marked node set includes all the lane nodes, the unmarked node set is an empty set, and reversely iterating the parent node of the escape node to obtain the escape path.

[0014] According to an embodiment of the present application, the determination method further includes: in response to a secondary disaster occurring at the lane node, and the last target escape path includes the lane node where the secondary disaster occurred, reacquiring the target escape path.

[0015] In order to achieve the above-mentioned purpose, the second aspect of the embodiment of the present application provides a device for determining the escape path of underground water seepage disasters, and the device includes: a first acquisition module, used to obtain an undirected graph corresponding to the tunnel, wherein the undirected graph includes tunnel nodes, tunnel edges and tunnel equivalent length; a second acquisition module, used to obtain the influencing factor of the tunnel equivalent length, and obtain the comprehensive tunnel equivalent length according to the influencing factor; a third acquisition module, used to obtain the escape path corresponding to the shortest total comprehensive tunnel equivalent length according to the comprehensive tunnel equivalent length and an improved shortest path algorithm; a determination module, used to obtain data information in the tunnel, and modify the escape path according to the data information to determine the target escape path.

[0016] In addition, the device for determining an escape route for underground water seepage disaster according to the above embodiment of the present application may also have the following additional technical features:

[0017] According to an embodiment of the present application, the first acquisition module is further used to: acquire spatial data of the lane; and abstract the lane into an undirected graph based on the spatial data.

[0018] According to one embodiment of the present application, the second acquisition module is also used to: obtain the influencing factors of the lane; obtain a first travel time through the lane when the influencing factors exist and a second travel time through the lane when the influencing factors do not exist; and obtain the influencing factor of the equivalent length of the lane based on the first travel time and the second travel time.

[0019] According to an embodiment of the present application, the second acquisition module is further used to: obtain the actual length of the tunnel; and obtain the comprehensive tunnel equivalent length based on the influencing factor and the actual length.

[0020] According to one embodiment of the present application, the third acquisition module is also used to: determine the disaster source node and the escape node from the tunnel nodes, and obtain the distance set between the disaster source node and all the tunnel nodes; obtain the first node corresponding to the shortest total comprehensive tunnel equivalent length from the distance set; in response to the first node being consistent with the escape node, determine that the path between the disaster source node and the escape node is the escape path.

[0021] According to one embodiment of the present application, the device is also used to: preset a marked node set and an unmarked node set of the escape path, wherein the marked node set is an empty set, and the unmarked node set includes all the lane nodes; in response to the first node being inconsistent with the escape node, the first node is added to the marked node set.

[0022] According to one embodiment of the present application, the device is also used to: obtain the neighboring nodes of the first node, determine that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring node is less than the distance between the neighboring node and the disaster source node, then update the distance between the neighboring node and the disaster source node in the distance set and the parent node corresponding to the neighboring node in the parent node set; determine that the marked node set includes all the lane nodes, the unmarked node set is an empty set, and reversely iterate the parent node of the escape node to obtain the escape path.

[0023] According to one embodiment of the present application, the device is further used to: in response to a secondary disaster occurring at the lane node, and the last target escape path included the lane node where the secondary disaster occurred, reacquire the target escape path.

[0024] In order to achieve the above-mentioned purpose, the third aspect embodiment of the present application provides an electronic device, including: a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, it implements the method for determining the escape route of underground water seepage disaster as described in any one of the embodiments of the first aspect of the present application.

[0025] In order to achieve the above-mentioned purpose, the fourth aspect embodiment of the present application provides a non-transitory computer-readable storage medium storing computer instructions, which are used to enable a computer to implement a method for determining an escape route for underground water seepage disasters as described in any one of the first aspect embodiments of the present application when the computer executes the computer. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 A schematic diagram of a method for determining an escape route for underground water seepage disasters disclosed in one embodiment of the present application.

[0027] Figure 2 A schematic diagram of a method for determining an escape route for underground water seepage disasters disclosed in another embodiment of the present application.

[0028] Figure 3 A schematic diagram of a method for determining an escape route for underground water seepage disasters disclosed in another embodiment of the present application.

[0029] Figure 4 A schematic diagram of a method for determining an escape route for underground water seepage disasters disclosed in another embodiment of the present application.

[0030] Figure 5 A schematic diagram of a method for determining an escape route for underground water seepage disasters disclosed in another embodiment of the present application.

[0031] Figure 6 A schematic diagram of the structure of a device for determining an escape route for underground water seepage disasters disclosed in one embodiment of the present application.

[0032] Figure 7 A schematic diagram of the structure of an electronic device disclosed in an embodiment of the present application. DETAILED DESCRIPTION

[0033] In order to better understand the above technical solution, exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the accompanying drawings, it should be understood that the present disclosure can be implemented in various forms and should not be limited by the embodiments described herein. On the contrary, these embodiments are provided to enable a more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

[0034] A method and device for determining an escape route for underground water seepage disasters according to an embodiment of the present application will be described below with reference to the accompanying drawings.

[0035] Figure 1 It is a flowchart of a method for determining an escape route for underground water seepage disasters according to an embodiment disclosed in the present application.

[0036] like Figure 1 As shown, the method for determining the escape path of underground water seepage disaster proposed in the embodiment of the present application specifically includes the following steps:

[0037] S101. Obtain an undirected graph corresponding to a lane, wherein the undirected graph includes lane nodes, lane edges, and lane equivalent lengths.

[0038] An undirected graph is a graph whose edges have no direction.

[0039] Optionally, the spatial data structure and tunnel network of the tunnel can be obtained, and the coal mining engineering drawing can be used as the base map to vectorize the tunnel into spatial topological data. Using the idea of ​​graph theory, the tunnel entity network can be abstracted into a weighted undirected graph G = (V, E, W), where V is the tunnel node set, E is the tunnel edge set, and W is the tunnel equivalent length set, that is, the weight of the edge between two nodes.

[0040] Where V = {v 1 ,v 2 ,v 3 ,...,v n},w ij For node v i To node v j The equivalent length of w ij ≥0, where i and j are node numbers. Then let w ij=∞; if v i =v j , then take w ij =0; if (v i ,v j )∈E, and v i ≠v j , then w ij Take the lane weight value of the corresponding lane edge, and realize the topological connection of the entire shaft and lane network through the logical relationship between nodes and lane branches, and then generate and store an undirected graph, which can provide a good network data storage method for underground emergency escape routes.

[0041] S102, obtaining influencing factors of the equivalent length of the tunnel, and obtaining the comprehensive equivalent length of the tunnel according to the influencing factors.

[0042] It should be noted that the present application does not limit the specific method for obtaining the influencing factor of the equivalent length of the tunnel, and it can be selected according to actual conditions.

[0043] Optionally, the influencing factors of the equivalent length of the tunnel can be obtained, and the first travel time through the tunnel when the influencing factors exist and the second travel time through the tunnel when the influencing factors do not exist can be obtained, and then the influencing factors of the equivalent length of the tunnel can be obtained based on the first travel time and the second travel time.

[0044] Furthermore, after the influencing factors of the tunnel equivalent length are obtained, the comprehensive tunnel equivalent length can be obtained according to the influencing factors and the actual length of the tunnel.

[0045] It should be noted that the influencing factors may include but are not limited to factors such as the type of tunnel, the slope of the tunnel, the wind speed in the tunnel, the number of local obstacles in the tunnel, and the water level in the tunnel.

[0046] S103. Obtain an escape path corresponding to the shortest total comprehensive laneway equivalent length according to the comprehensive laneway equivalent length and the improved shortest path algorithm.

[0047] In the related art, when obtaining the escape path, on the one hand, the Dijkstra algorithm based on graph theory or its derivative algorithms are adopted, and on the other hand, heuristic algorithms are adopted, such as: A* algorithm, particle swarm algorithm, ant colony algorithm or genetic algorithm, etc. However, the search accuracy of the A* algorithm strongly depends on the constructed heuristic function. The change of network nodes requires the reconstruction of the evaluation function, otherwise it will lead to a local optimal solution or no solution; the ant colony algorithm has the disadvantages of slow convergence speed and high time complexity.

[0048] In response to the above problems, this application proposes to obtain the optimal escape path through an improved Dijkstra algorithm, improve the adjacency matrix into the form of an adjacency list and a distance matrix, achieve a significant improvement in time efficiency, and at the same time meet the requirements of real-time and stability of the solution.

[0049] Among them, the Dijkstra algorithm is a typical single-source shortest path algorithm, which is used to calculate the shortest path from a node to all other nodes. Its main feature is that it expands outward layer by layer with the starting point as the center until it reaches the end point.

[0050] S104, acquiring data information in the tunnel, and modifying the escape path according to the data information to determine the target escape path.

[0051] Optionally, the data information in the tunnel may be data information of underground personnel.

[0052] For example, the underground personnel data information can reflect the congestion situation of the underground personnel. The escape route can be corrected according to the congestion situation of the underground personnel to determine the target escape route, which can enable the underground personnel to avoid the impact of congestion and shorten the escape time of the underground personnel.

[0053] The method for determining the escape path of underground water seepage disaster provided by the present application obtains the undirected graph corresponding to the tunnel, obtains the influencing factor of the tunnel equivalent length, obtains the comprehensive tunnel equivalent length according to the influencing factor, obtains the escape path corresponding to the shortest total comprehensive tunnel equivalent length according to the comprehensive tunnel equivalent length and the improved shortest path algorithm, obtains the data information in the tunnel, and corrects the escape path according to the data information to determine the target escape path. Therefore, the present application can obtain the escape path under the premise of ensuring safety through the improved shortest path algorithm, and at the same time, can dynamically obtain the final target escape path according to the real-time data information in the tunnel, thereby improving the accuracy and reliability of obtaining the target escape path, and providing more scientific and accurate decision support for underground water seepage disasters.

[0054] As a possible implementation, Figure 2 As shown, based on the above embodiment, the specific process of obtaining the undirected graph corresponding to the lane in the above step S101 includes the following steps:

[0055] S201, obtaining spatial data of the lane.

[0056] Optionally, the spatial data of the lane may be lane lines, lane distances, and the like.

[0057] S202. Abstract the lanes into an undirected graph based on the spatial data.

[0058] Optionally, all locations where path selection is required can be abstracted into points, and adjacent points are connected according to normally navigable paths to form an undirected graph. Therefore, the undirected graph contains the node numbers of all target locations from the starting point to the end point, the distance between the starting point and the target location, and the navigable path between the starting point and the target location.

[0059] The method for determining the escape path of underground water seepage disaster provided by the present application obtains the spatial data of the tunnel by obtaining the spatial data of the tunnel. Therefore, the present application can provide a good network data storage method for the escape path of underground emergency disaster avoidance by obtaining the undirected graph corresponding to the tunnel, laying a foundation for the subsequent more accurate acquisition of the target escape path.

[0060] As a possible implementation, Figure 3 As shown, based on the above embodiment, the specific process of obtaining the influencing factor of the equivalent length of the lane in the above step S102 includes the following steps:

[0061] S301. Obtain influencing factors of the lane.

[0062] It should be noted that the present application does not limit the specific method for obtaining the influencing factors of the lane, and it can be selected according to the actual situation.

[0063] Optionally, the influencing factors of the tunnel can be obtained through the actual situation of the tunnel and on-site simulation analysis.

[0064] It should be noted that the factors affecting the tunnel include but are not limited to: tunnel type, tunnel slope, wind speed in the tunnel, number of local obstacles, and water level in the tunnel.

[0065] Optionally, the local obstacle may be a belt conveyor, a mine car, a wind window, a damper or other equipment.

[0066] S302: Obtain a first travel time through the lane when an influencing factor exists and a second travel time through the lane when no influencing factor exists.

[0067] For example, for any influencing factor, when the influencing factor exists, the first travel time through the lane is T, and when the influencing factor does not exist, the second travel time through the lane is t.

[0068] S303. Obtain an influencing factor of the equivalent length of the lane according to the first travel time and the second travel time.

[0069] It should be noted that after obtaining the first travel time and the second travel time, the influencing factor of the equivalent length of the lane can be obtained according to the following formula:

[0070] λ=(T–t) / t

[0071] Among them, λ is the influencing factor of the equivalent length of the lane, T is the first travel time, and t is the second travel time.

[0072] Furthermore, after the influencing factors are obtained, the comprehensive tunnel equivalent length can be obtained according to the influencing factors.

[0073] As a possible implementation, Figure 4 As shown, based on the above embodiment, the specific process of obtaining the comprehensive tunnel equivalent length according to the influencing factors in the above step S103 includes the following steps:

[0074] S401. Obtain the actual length of the lane.

[0075] Optionally, lane parameters may be acquired, and the actual length of the lane may be acquired based on the lane parameters.

[0076] S402. Obtain the comprehensive tunnel equivalent length according to the influencing factors and the actual length.

[0077] It should be noted that since the influencing factors of the equivalent length of the tunnel are not one, that is, each influencing factor corresponds to an influencing factor, the comprehensive equivalent length of the tunnel can be obtained according to the following formula:

[0078]

[0079] Among them, w is the comprehensive tunnel equivalent length, d is the actual length of the tunnel, k is the number of influencing factors, and λ is the influencing factor of the tunnel equivalent length.

[0080] The method for determining the escape path of underground water seepage disaster provided by the present application obtains the influencing factors of the tunnel, obtains the first travel time of passing through the tunnel when the influencing factors exist and the second travel time of passing through the tunnel when the influencing factors do not exist, obtains the influencing factors of the tunnel equivalent length based on the first travel time and the second travel time, and obtains the actual length of the tunnel, and obtains the comprehensive tunnel equivalent length based on the influencing factors and the actual length. Therefore, the present application obtains the comprehensive tunnel equivalent length based on the influencing factors of the tunnel equivalent length, improves the accuracy and reliability of obtaining the escape path, and lays the foundation for the subsequent acquisition of the target escape path.

[0081] As a possible implementation, Figure 5 As shown, based on the above embodiment, the specific process of obtaining the escape path corresponding to the shortest total comprehensive lane equivalent length according to the comprehensive lane equivalent length and the improved shortest path algorithm in the above step S104 includes the following steps:

[0082] S501, determining a disaster source node and an escape node from the lane nodes, and obtaining a distance set between the disaster source node and all lane nodes.

[0083] For example, we can determine that the disaster source node is v s and the escape node is v t , the distance set between the disaster source node and all lane nodes is Dist.

[0084] Optionally, the disaster source node v can be initialized s The distance set Dist to all nodes is infinite. In order to obtain the escape path, the parent node of each node is initialized to an empty set, and the disaster source node v s To the disaster source node v s The distance between them is initialized to 0.

[0085] S502. Obtain the first node corresponding to the shortest total comprehensive lane equivalent length from the distance set.

[0086] S503: In response to the first node being consistent with the escape node, determining that the path between the disaster source node and the escape node is the escape path.

[0087] It should be noted that if the first node is consistent with the escape node, the path between the disaster source node and the escape node can be directly determined as the escape path.

[0088] In an embodiment of the present application, a marked node set and an unmarked node set of an escape path can be preset, wherein the marked node set is an empty set, and the unmarked node set includes all lane nodes. In response to the first node being inconsistent with the escape node, the first node is added to the marked node set.

[0089] Furthermore, the neighboring nodes of the first node are obtained, and it is determined that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring nodes is less than the distance between the neighboring nodes and the disaster source node. Then, the distance between the neighboring nodes and the disaster source node in the distance set and the parent nodes corresponding to the neighboring nodes in the parent node set are updated, and it is determined that the marked node set includes all lane nodes, the unmarked node set is an empty set, and the parent nodes of the escape nodes are reversely iterated to obtain the escape path.

[0090] Furthermore, the escape path can be corrected based on the data information in the lane to determine the target escape path.

[0091] In an embodiment of the present application, in response to a secondary disaster occurring at a lane node, and the previous target escape path includes the lane node where the secondary disaster occurred, the target escape path is reacquired.

[0092] It should be noted that, for secondary disasters, the coal mine safety monitoring system can be used to monitor the disaster situation underground in real time. For the location where the secondary disaster occurred underground, the name and serial number of the disaster node are searched and compared with the previous target escape path. If the tunnel node where the secondary disaster occurred is not included, the target escape path remains unchanged. If the tunnel node where the secondary disaster occurred is included, the equivalent length of the tunnel is set to infinity, the tunnel network is reconstructed, and the target escape path is obtained again.

[0093] The method for determining the escape path for underground water seepage disasters provided in the present application can obtain the escape path under the premise of ensuring safety through an improved shortest path algorithm. At the same time, the final target escape path can be dynamically obtained based on the real-time data information in the tunnel, and the disaster situation underground can be monitored in real time to dynamically adjust the target escape path, thereby improving the flexibility and reliability of obtaining the target escape path and providing more scientific and accurate decision-making support for underground water seepage disasters.

[0094] Furthermore, according to the method for determining the escape route of underground water seepage disasters proposed in the present application, a coal mine underground emergency rescue platform based on a three-dimensional geographic information system (GIS) map can be constructed to achieve three-dimensional visualization of underground tunnels and places, truly restore the spatial position relationship and fluctuation changes of the mine tunnel system, intuitively display the disaster avoidance route planning, virtually simulate the underground escape drill process, integrate rescue materials, rescue teams, emergency contacts and other information, and realize scientific management and decision-making of emergency rescue of coal mine accidents.

[0095] To sum up, the method for determining the escape path of underground water seepage disasters proposed in this application can obtain the escape path under the premise of ensuring safety through an improved shortest path algorithm. At the same time, the final target escape path can be dynamically obtained according to the real-time data information in the tunnel, and the disaster situation underground can be monitored in real time to dynamically adjust the target escape path, thereby improving the flexibility and reliability of obtaining the target escape path, providing more scientific and accurate decision-making support for underground water seepage disasters, and based on the coal mine underground emergency rescue platform, a rapid and intuitive three-dimensional expression of the disaster point location can be achieved, providing a reliable basis for formulating escape paths, accident investigations, optimizing escape paths and emergency rescue decisions.

[0096] Figure 6 It is a structural schematic diagram of a device for determining an escape route for underground water seepage disasters according to an embodiment disclosed in the present application.

[0097] like Figure 6 As shown, the underground water seepage disaster escape route determination device 100 includes: a first acquisition module 11, a second acquisition module 12, a third acquisition module 13 and a determination module 14.

[0098] A first acquisition module 11 is used to acquire an undirected graph corresponding to a lane, wherein the undirected graph includes lane nodes, lane edges and lane equivalent lengths;

[0099] A second acquisition module 12 is used to acquire the influencing factor of the tunnel equivalent length, and acquire the comprehensive tunnel equivalent length according to the influencing factor;

[0100] A third acquisition module 13 is used to acquire an escape path corresponding to the shortest total comprehensive lane equivalent length according to the comprehensive lane equivalent length and the improved shortest path algorithm;

[0101] The determination module 14 is used to obtain data information in the tunnel, and modify the escape path according to the data information to determine the target escape path.

[0102] According to an embodiment of the present application, the first acquisition module 11 is further used to: acquire spatial data of the lane; and abstract the lane into the undirected graph based on the spatial data.

[0103] According to one embodiment of the present application, the second acquisition module 12 is also used to: obtain the influencing factors of the lane; obtain the first travel time through the lane when the influencing factors exist and the second travel time through the lane when the influencing factors do not exist; and obtain the influencing factor of the equivalent length of the lane based on the first travel time and the second travel time.

[0104] According to an embodiment of the present application, the second acquisition module 12 is further used to: acquire the actual length of the tunnel; and acquire the comprehensive tunnel equivalent length according to the influencing factor and the actual length.

[0105] According to one embodiment of the present application, the third acquisition module 13 is also used to: determine the disaster source node and the escape node from the tunnel nodes, and obtain the distance set between the disaster source node and all the tunnel nodes; obtain the first node corresponding to the shortest total comprehensive tunnel equivalent length from the distance set; in response to the first node being consistent with the escape node, determine that the path between the disaster source node and the escape node is the escape path.

[0106] According to one embodiment of the present application, the device 100 is also used to: preset a marked node set and an unmarked node set of the escape path, wherein the marked node set is an empty set, and the unmarked node set includes all the lane nodes; in response to the first node being inconsistent with the escape node, the first node is added to the marked node set.

[0107] According to one embodiment of the present application, the device 100 is also used to: obtain the neighboring nodes of the first node, determine that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring node is less than the distance between the neighboring node and the disaster source node, then update the distance between the neighboring node and the disaster source node in the distance set and the parent node corresponding to the neighboring node in the parent node set; determine that the marked node set includes all the lane nodes, the unmarked node set is an empty set, and reversely iterate the parent node of the escape node to obtain the escape path.

[0108] According to one embodiment of the present application, the device 100 is further used to: in response to a secondary disaster occurring at the lane node, and the last target escape path includes the lane node where the secondary disaster occurred, reacquire the target escape path.

[0109] The embodiment of the present application provides a device for determining an escape path for underground water seepage disasters, obtains an undirected graph corresponding to a tunnel, obtains an influencing factor of the tunnel equivalent length, obtains a comprehensive tunnel equivalent length based on the influencing factor, obtains an escape path corresponding to the shortest total comprehensive tunnel equivalent length based on the comprehensive tunnel equivalent length and an improved shortest path algorithm, obtains data information in the tunnel, and modifies the escape path based on the data information to determine a target escape path. Thus, the present application can obtain an escape path under the premise of ensuring safety through an improved shortest path algorithm, and at the same time, can dynamically obtain the final target escape path based on real-time data information in the tunnel, thereby improving the accuracy and reliability of obtaining the target escape path, and providing more scientific and accurate decision support for underground water seepage disasters.

[0110] In order to implement the above embodiment, the present application also proposes an electronic device 2000, such as Figure 7 As shown, it includes a memory 210, a processor 220, and a computer program stored in the memory 210 and executable on the processor 220. When the processor executes the program, the aforementioned method for determining an escape route for underground water seepage disasters is implemented.

[0111] In order to implement the above-mentioned embodiments, the present application also proposes a non-transitory computer-readable storage medium storing computer instructions, which are used to implement the aforementioned method for determining an escape route for underground water seepage disasters when executed by a computer.

[0112] In the description of the present application, it should be understood that the terms "center", "longitudinal", "lateral", "length", "width", "thickness", "up", "down", "front", "back", "left", "right", "vertical", "horizontal", "top", "bottom", "inside", "outside", "clockwise", "counterclockwise", "axial", "radial", "circumferential" and the like indicate orientations or positional relationships based on the orientations or positional relationships shown in the accompanying drawings, and are only for the convenience of describing the present application and simplifying the description, and do not indicate or imply that the referred device or element must have a specific orientation, be constructed and operated in a specific orientation, and therefore should not be understood as a limitation on the present application.

[0113] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Thus, a feature defined as "first" or "second" may explicitly or implicitly include one or more of the features. In the description of this application, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0114] In this application, unless otherwise clearly specified and limited, the terms "installed", "connected", "connected", "fixed" and the like should be understood in a broad sense, for example, it can be a fixed connection, a detachable connection, or an integral connection; it can be a mechanical connection or an electrical connection; it can be a direct connection or an indirect connection through an intermediate medium, it can be the internal connection of two elements or the interaction relationship between two elements. For ordinary technicians in this field, the specific meanings of the above terms in this application can be understood according to specific circumstances.

[0115] In the present application, unless otherwise clearly specified and limited, a first feature being “above” or “below” a second feature may mean that the first and second features are in direct contact, or the first and second features are in indirect contact through an intermediate medium. Moreover, a first feature being “above”, “above”, and “above” a second feature may mean that the first feature is directly above or obliquely above the second feature, or simply means that the first feature is higher in level than the second feature. A first feature being “below”, “below”, and “below” a second feature may mean that the first feature is directly below or obliquely below the second feature, or simply means that the first feature is lower in level than the second feature.

[0116] In the description of this specification, the description with reference to the terms "one embodiment", "some embodiments", "example", "specific example", or "some examples" etc. means that the specific features, structures, materials or characteristics described in conjunction with the embodiment or example are included in at least one embodiment or example of the present application. In this specification, the schematic representations of the above terms do not necessarily refer to the same embodiment or example. Moreover, the specific features, structures, materials or characteristics described may be combined in any one or more embodiments or examples in a suitable manner. In addition, those skilled in the art may combine and combine the different embodiments or examples described in this specification and the features of the different embodiments or examples, without contradiction.

[0117] Although the embodiments of the present application have been shown and described above, it can be understood that the above embodiments are exemplary and cannot be understood as limitations on the present application. Ordinary technicians in this field can change, modify, replace and modify the above embodiments within the scope of the present application.

Claims

1. A method for determining an escape route for underground water seepage disasters, comprising: Obtaining an undirected graph corresponding to the lane, wherein the undirected graph includes lane nodes, lane edges, and lane equivalent lengths; Obtain the influencing factor of the tunnel equivalent length, and obtain the comprehensive tunnel equivalent length according to the influencing factor; wherein the influencing factor of the tunnel equivalent length is: λ=(T–t) / t Wherein, λ is the influencing factor of the equivalent length of the lane, T is the first travel time, and t is the second travel time; the method for obtaining the comprehensive equivalent length of the lane is: Among them, w is the equivalent length of the comprehensive roadway, d is the actual length of the roadway, k is the number of influencing factors, and λ is the influencing factor of the equivalent length of the roadway; According to the comprehensive tunnel equivalent length and the improved shortest path algorithm, an escape path corresponding to the shortest total comprehensive tunnel equivalent length is obtained; Acquiring data information in the lane, and modifying the escape path according to the data information to determine a target escape path; Wherein, obtaining the escape path corresponding to the shortest total comprehensive laneway equivalent length according to the comprehensive laneway equivalent length and the improved shortest path algorithm includes: Determine a disaster source node and an escape node from the lane nodes, and obtain a distance set between the disaster source node and all the lane nodes; Obtaining, from the distance set, a first node corresponding to the shortest total comprehensive lane equivalent length; In response to the first node being consistent with the escape node, determining a path between the disaster source node and the escape node as the escape path; Wherein, the determination method further includes: Presetting a marked node set and an unmarked node set of the escape path, wherein the marked node set is an empty set, and the unmarked node set includes all the lane nodes; In response to the first node being inconsistent with the escape node, adding the first node to the marked node set; Wherein, the determination method further includes: Obtaining neighboring nodes of the first node, determining that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring node is less than the distance between the neighboring node and the disaster source node, then updating the distance between the neighboring node and the disaster source node in the distance set and the parent node corresponding to the neighboring node in the parent node set; It is determined that the marked node set includes all the lane nodes, the unmarked node set is an empty set, and the parent node of the escape node is reversely iterated to obtain the escape path.

2. The determination method according to claim 1, wherein: The obtaining of the undirected graph corresponding to the lane comprises: Acquiring spatial data of the lane; The lane is abstracted into the undirected graph according to the spatial data.

3. The determination method according to claim 1, wherein: The obtaining of the influencing factors of the tunnel equivalent length includes: Obtaining influencing factors of the lane; Acquire a first travel time through the lane when the influencing factor exists and a second travel time through the lane when the influencing factor does not exist; The influencing factor of the lane equivalent length is obtained according to the first travel time and the second travel time.

4. The determination method according to claim 3, wherein: The obtaining of the comprehensive tunnel equivalent length according to the influencing factors includes: Obtaining the actual length of the lane; The comprehensive tunnel equivalent length is obtained according to the influencing factor and the actual length.

5. The determination method according to any one of claims 1 to 4, wherein: The determination method further includes: If a secondary disaster occurs to the lane node, and the last target escape path includes the lane node where the secondary disaster occurred, the target escape path is reacquired.

6. A device for determining an escape route for underground water seepage disaster, comprising: A first acquisition module is used to acquire an undirected graph corresponding to the lane, wherein the undirected graph includes lane nodes, lane edges and lane equivalent lengths; The second acquisition module is used to obtain the influencing factor of the tunnel equivalent length, and obtain the comprehensive tunnel equivalent length according to the influencing factor; wherein the influencing factor of the tunnel equivalent length is: λ=(T–t) / t Wherein, λ is the influencing factor of the equivalent length of the lane, T is the first travel time, and t is the second travel time; the method for obtaining the comprehensive equivalent length of the lane is: Among them, w is the equivalent length of the comprehensive roadway, d is the actual length of the roadway, k is the number of influencing factors, and λ is the influencing factor of the equivalent length of the roadway; A third acquisition module is used to acquire an escape path corresponding to the shortest total comprehensive lane equivalent length according to the comprehensive lane equivalent length and the improved shortest path algorithm; A determination module, used for acquiring data information in the lane, and modifying the escape path according to the data information to determine a target escape path; The third acquisition module is further used for: Determine a disaster source node and an escape node from the lane nodes, and obtain a distance set between the disaster source node and all the lane nodes; Obtaining, from the distance set, a first node corresponding to the shortest total comprehensive lane equivalent length; In response to the first node being consistent with the escape node, determining a path between the disaster source node and the escape node as the escape path; Wherein, the determination method further includes: Presetting a marked node set and an unmarked node set of the escape path, wherein the marked node set is an empty set, and the unmarked node set includes all the lane nodes; In response to the first node being inconsistent with the escape node, adding the first node to the marked node set; Wherein, the determination method further includes: Obtaining neighboring nodes of the first node, determining that the sum of the shortest distance from the disaster source node to the first node and the equivalent length from the first node to the neighboring node is less than the distance between the neighboring node and the disaster source node, then updating the distance between the neighboring node and the disaster source node in the distance set and the parent node corresponding to the neighboring node in the parent node set; It is determined that the marked node set includes all the lane nodes, the unmarked node set is an empty set, and the parent node of the escape node is reversely iterated to obtain the escape path.

7. An electronic device, characterized in that: Including memory and processor; The processor runs a program corresponding to the executable program code by reading the executable program code stored in the memory, so as to implement the method according to any one of claims 1 to 5.

Images