CN117217400A - Mine disaster avoidance route planning method and device, electronic equipment and storage medium - Google Patents
Mine disaster avoidance route planning method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN117217400A CN117217400A CN202311483721.8A CN202311483721A CN117217400A CN 117217400 A CN117217400 A CN 117217400A CN 202311483721 A CN202311483721 A CN 202311483721A CN 117217400 A CN117217400 A CN 117217400A
- Authority
- CN
- China
- Prior art keywords
- roadway
- undirected graph
- mine
- weighted undirected
- acquiring
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 51
- 230000004044 response Effects 0.000 claims description 10
- 238000010586 diagram Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 7
- 238000004590 computer program Methods 0.000 description 4
- 239000007789 gas Substances 0.000 description 3
- 238000003491 array Methods 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 238000005065 mining Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 2
- 241001050985 Disco Species 0.000 description 1
- 239000000428 dust Substances 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000003550 marker Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
Abstract
The application provides a planning method, a planning device, electronic equipment and a storage medium for a mine disaster avoidance route, wherein the method comprises the following steps: responding to mine disasters, and acquiring a first weighted undirected graph of the mine; acquiring first position information of underground personnel and second position information of disaster avoidance positions; determining a first point position corresponding to the underground personnel in the first weighted undirected graph based on the first position information; determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information; and planning a disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location and the second point location. By the technical scheme provided by the embodiment of the application, a reasonable disaster avoidance route can be rapidly planned for underground personnel when mine disasters occur in the mine, and the disaster avoidance efficiency of the underground personnel is improved.
Description
Technical Field
The present application relates to the field of mine safety technologies, and in particular, to a method and apparatus for planning a mine disaster avoidance route, an electronic device, and a storage medium.
Background
In the related art, when underground disasters occur in a mine, underground personnel mainly rely on an advanced disaster avoidance route to avoid the disasters, and the advanced disaster avoidance route cannot be updated in time along with the development condition of the disasters, so that the disaster avoidance efficiency of the underground personnel is low.
Disclosure of Invention
The present application aims to solve at least one of the technical problems in the related art to some extent.
In a first aspect, the present application provides a method for planning a disaster avoidance route of a mine, including: responding to mine disasters, and acquiring a first weighted undirected graph of the mine; acquiring first position information of underground personnel and second position information of disaster avoidance positions; determining a first point position corresponding to the underground personnel in the first weighted undirected graph based on the first position information; determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information; and planning a disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location and the second point location.
In one implementation, the obtaining the first weighted undirected graph of the mine includes: acquiring a topological connection relationship between a roadway of the mine and a roadway intersection point; acquiring a traffic influence factor corresponding to the roadway; based on the traffic influence factors, acquiring equivalent lengths corresponding to the roadway; and acquiring the first weighted undirected graph based on the equivalent length corresponding to the roadway and the topological connection relation.
In an optional implementation manner, the acquiring, based on the traffic impact factor, the equivalent length corresponding to the roadway includes: acquiring the roadway length and the normal passing time corresponding to the roadway; acquiring a first passing time corresponding to the roadway when the passing influence factor exists; acquiring an influence multiplier factor corresponding to the roadway based on the normal passing time and the first passing time; and acquiring the equivalent length corresponding to the roadway based on the influence multiplier factor corresponding to the roadway and the roadway length.
In an alternative implementation, the traffic impact factor includes at least one of: the roadway type of the roadway; the roadway gradient of the roadway; wind speed in the roadway; the number of obstacles in the roadway; and the influence factors caused by the mine disaster.
In an alternative implementation, the method further comprises: updating the traffic impact factor in response to the lapse of a preset time; updating the first weighted undirected graph based on the updated traffic impact factors, and acquiring a second weighted undirected graph; and updating the disaster avoidance route based on the second weighted undirected graph.
In one implementation, the planning the disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location, and the second point location includes: based on a Dikk algorithm, acquiring a shortest path between the first point location and the second point location in the first weighted undirected graph; and planning the disaster avoidance route based on the shortest path.
In one implementation, the method further comprises: generating disaster avoidance prompt information based on the disaster avoidance route; pushing the disaster avoidance prompt information to underground personnel.
In a second aspect, the present application provides a planning apparatus for a mine disaster avoidance route, including: the first processing module is used for responding to mine disasters occurring in a mine and acquiring a first weighted undirected graph of the mine; the acquisition module is used for acquiring first position information of underground personnel and second position information of disaster avoidance positions; the second processing module is used for determining a first point position corresponding to the underground personnel in the first weighted undirected graph based on the first position information; the third processing module is used for determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information; and the route planning module is used for planning a disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location and the second point location.
In one implementation, the first processing module is specifically configured to: acquiring a topological connection relationship between a roadway of the mine and a roadway intersection point; acquiring a traffic influence factor corresponding to the roadway; based on the traffic influence factors, acquiring equivalent lengths corresponding to the roadway; and acquiring the first weighted undirected graph based on the equivalent length corresponding to the roadway and the topological connection relation.
In an alternative implementation, the first processing module is specifically configured to: acquiring the roadway length and the normal passing time corresponding to the roadway; acquiring a first passing time corresponding to the roadway when the passing influence factor exists; acquiring an influence multiplier factor corresponding to the roadway based on the normal passing time and the first passing time; and acquiring the equivalent length corresponding to the roadway based on the influence multiplier factor corresponding to the roadway and the roadway length.
In an alternative implementation, the traffic impact factor includes at least one of: the roadway type of the roadway; the roadway gradient of the roadway; wind speed in the roadway; the number of obstacles in the roadway; and the influence factors caused by the mine disaster.
In an alternative implementation, the apparatus further includes: the fourth processing module is used for updating the traffic influence factor in response to the preset time; the fifth processing module is used for updating the first weighted undirected graph based on the updated traffic impact factors and obtaining a second weighted undirected graph; and a sixth processing module, configured to update the disaster avoidance route based on the second weighted undirected graph.
In one implementation, the route planning module is specifically configured to: based on a Dikk algorithm, acquiring a shortest path between the first point location and the second point location in the first weighted undirected graph; and planning the disaster avoidance route based on the shortest path.
In one implementation, the apparatus further comprises: the generation module is used for generating disaster avoidance prompt information based on the disaster avoidance route; and the prompt module is used for pushing the disaster avoidance prompt information to underground personnel.
In a third aspect, the present application proposes an electronic device comprising: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect.
In a fourth aspect, the present application proposes a computer readable storage medium storing instructions that, when executed, cause the method according to the first aspect to be implemented.
In a fifth aspect, the application proposes a computer program product comprising a computer program which, when executed by a processor, implements the steps of the method according to the first aspect.
The method, the device, the electronic equipment and the storage medium for planning the mine disaster avoidance route can acquire the weighted undirected graph corresponding to the mine in the mine disaster, and determine the first point position corresponding to the weighted undirected graph of underground personnel and the second point position corresponding to the disaster avoidance position in the weighted undirected graph, so that the disaster avoidance route of the underground personnel is planned based on the weighted undirected graph, the first point position and the second point position. Reasonable disaster avoidance routes can be planned for underground personnel rapidly, and disaster avoidance efficiency of the underground personnel is improved.
Additional aspects and advantages of the application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the application.
Drawings
The foregoing and/or additional aspects and advantages of the application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings, in which:
fig. 1 is a schematic flow chart of a planning method for a mine disaster avoidance route according to an embodiment of the present application;
FIG. 2 is a schematic flow chart of another method for planning a mine disaster avoidance route according to an embodiment of the present application;
FIG. 3 is a schematic flow chart of a method for planning a mine disaster avoidance route according to an embodiment of the present application;
fig. 4 is a schematic diagram of a planning scheme of a mine disaster avoidance route according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a planning apparatus for a mine disaster avoidance line according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of another planning apparatus for mine disaster avoidance routes according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a planning apparatus for a mine disaster avoidance line according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to like or similar elements or elements having like or similar functions throughout. The embodiments described below by referring to the drawings are illustrative and intended to explain the present application and should not be construed as limiting the application.
The following describes a method and a device for planning a mine disaster avoidance route according to an embodiment of the present application with reference to the accompanying drawings.
Fig. 1 is a flow chart of a planning method for a mine disaster avoidance route according to an embodiment of the present application. As shown in fig. 1, the method may include, but is not limited to, the steps of:
step S101: and responding to mine disasters, and acquiring a first weighted undirected graph of the mine.
For example, in response to a mine disaster occurring in a mine, a first weighted undirected graph corresponding to the mine is acquired. The sides in the first weighted undirected graph correspond to the roadways in the mine, the weight values of the sides in the first weighted undirected graph correspond to the difficulty level of roadway traffic in the mine, and the nodes in the first weighted undirected graph correspond to the crossing points of the roadways in the mine.
Step S102: and acquiring first position information of underground personnel and second position information of disaster avoidance positions.
Specifically, first position information of the position of underground personnel in the mine and second position information of the position of a disaster-avoidance escape opening in the mine are obtained.
It should be noted that in the embodiment of the present application, the number of the underground personnel is at least one. When the underground personnel are multiple, the first position information corresponding to each underground personnel can be acquired respectively, and the subsequent steps are executed based on the first position information corresponding to each underground personnel respectively.
It should be noted that, in the embodiment of the present application, at least one disaster avoidance location is provided. When the disaster avoidance positions are multiple, second position information corresponding to each disaster avoidance position can be obtained respectively, and subsequent steps are executed based on the second position information corresponding to each disaster avoidance position respectively.
Step S103: and determining a corresponding first point position of the underground personnel in the first weighted undirected graph based on the first position information.
For example, based on first location information of the downhole personnel, a corresponding first point location of the downhole personnel in the first weighted undirected graph is determined.
Taking the first position information as an example of an intersection point of the lane a and the lane B, an intersection point of a side corresponding to the lane a and a side corresponding to the lane B in the first weighted undirected graph is taken as a first point location.
As another example, taking the first position information as one position in the roadway a, there are an intersection a and an intersection B at both ends of the roadway a, respectively. The intersection point (e.g., intersection point a) that is closer to the downhole personnel is taken as the first point.
As yet another example, the first location information is taken as an example of one location in the lane a. And adding the point corresponding to the first position information as a new node into the first weighted undirected graph, and taking the new node as a first point position.
Step S104: and determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information.
For example, based on second position information of the disaster avoidance position, a second point position of the disaster avoidance position corresponding to the first weighted undirected graph is determined.
Taking the second position information as an example of an intersection point of the lane a and the lane B, the intersection point of the side corresponding to the lane a and the side corresponding to the lane B in the first weighted undirected graph is taken as a second point location.
As another example, taking the second position information as one position in the lane a, there are an intersection a and an intersection B at both ends of the lane a, respectively. The intersection point (e.g., intersection point a) that is closer to the downhole personnel is taken as the second point location.
As yet another example, the second location information is taken as an example of one location in the lane a. And adding the point corresponding to the second position information as a new node into the first weighted undirected graph, and taking the new node as a second point position.
Step S105: and planning a disaster avoidance route of underground personnel based on the first weighted undirected graph, the first point location and the second point location.
For example, a shortest path algorithm is adopted, a shortest path from a first point position to a second point position is calculated based on the first weighted undirected graph, and a disaster avoidance route of underground personnel is planned according to a roadway corresponding to the path.
By implementing the embodiment of the application, the weighted undirected graph corresponding to the mine can be obtained when the mine disaster occurs in the mine, and the first point position corresponding to the weighted undirected graph of underground personnel and the second point position corresponding to the disaster avoiding position in the weighted undirected graph are determined, so that the disaster avoiding route of the underground personnel is planned based on the weighted undirected graph, the first point position and the second point position. Reasonable disaster avoidance routes can be planned for underground personnel rapidly, and disaster avoidance efficiency of the underground personnel is improved.
In one implementation, an influence factor that affects the passage of underground personnel in a roadway can be obtained, and weight values corresponding to all sides in the undirected graph are determined based on the influence factor, so that a first weighted undirected graph is obtained. As an example, please refer to fig. 2, fig. 2 is a schematic diagram of another planning method for a mine disaster avoidance route according to an embodiment of the present application. As shown in fig. 2, the method may include, but is not limited to, the following steps.
Step S201: and responding to mine disasters, and acquiring topological connection relations between the roadways of the mine and the roadway crossing points.
For example, in response to a mine disaster, a mine mining engineering drawing is taken as a base drawing, the central line of a roadway and the intersection points between the roadways are extracted, and the topological connection relationship between the roadway of the mine and the intersection points of the roadway is obtained.
Step S202: and obtaining a traffic influence factor corresponding to the roadway.
For example, the influence factors influencing the traffic of the personnel in each roadway are obtained respectively through a plurality of sensors preset in each roadway.
In an alternative implementation, the traffic impact factor includes at least one of: roadway type of roadway; roadway gradient of the roadway; wind speed in a roadway; the number of obstacles in the roadway; the impact factors caused by mine disasters.
Step S203: and acquiring the equivalent length corresponding to the roadway based on the traffic influence factor.
For example, based on the traffic impact factors corresponding to each roadway, the equivalent length corresponding to the underground personnel when the underground personnel avoid the disaster through each roadway is calculated and obtained.
In an optional implementation manner, the obtaining, based on the traffic impact factor, the equivalent length corresponding to the roadway includes:
step A1: and obtaining the roadway length and the normal passing time corresponding to the roadway.
Specifically, the roadway length of each roadway and the normal transit time required by underground personnel to normally pass through each roadway when no mine disaster occurs are respectively obtained.
Step A2: and when the traffic influence factors exist, acquiring first traffic time corresponding to the roadway.
As an example, taking a plurality of traffic impact factors as an example, a first traffic time required for a down-hole person to pass through each roadway when each traffic impact factor exists is acquired respectively.
Step A3: and acquiring an influence multiplier factor corresponding to the roadway based on the normal passing time and the first passing time.
For example, set upiAndjthe roadway is provided with two corresponding nodes at two ends of any roadwaye ij Is the normal transit time oft(e ij ) Roadway in the presence of any influencing factore ij Is the first transit time ofT(e ijj ) Then pass through the roadwaye ij The impact multiplier factor corresponding to the time pass impact factor can be expressed as follows.
λ ij (e ij ) = [T(e ijj ) –t(e ij )] /t(e ij )
Wherein lambda is ij (e ij ) To influence the multiplier factor.
Step A4: and acquiring the equivalent length corresponding to the roadway based on the influence multiplier factor and the roadway length corresponding to the roadway.
For example, corresponding weight values are set for each different influence multiplier factor in advance, and the influence multiplier factors corresponding to each roadway are multiplied by the roadway lengths respectively to obtain equivalent lengths corresponding to the roadways.
As an example, the equivalent length corresponding to a roadway may be obtained by the following formula.
Wherein,is a roadwaye ij Corresponding equivalent length, +.>Is a roadwaye ij Is>Is a roadwaye ij And K corresponding to the K influence multiplier factors are positive integers.
In some embodiments of the present application, the equivalent length corresponding to the roadway may be obtained by using the method described above in combination with the weight value corresponding to each influencing multiplier factor.
In the embodiment of the application, the influence factors caused by the mine disaster can include, but are not limited to, the water level of the accumulated water in the roadway caused by the mine disaster, the concentration of harmful gas in the roadway caused by the mine disaster, the concentration of dust in the roadway caused by the mine disaster, and the like.
Step S204: and acquiring a first weighted undirected graph based on the equivalent length and the topological connection relation corresponding to the roadway.
For example, the intersection points of the lanes are used as nodes of the undirected graph, the lanes between the intersection points of the lanes are used as edges between the nodes in the undirected graph based on the topological connection relationship, the equivalent length corresponding to the lanes is used as a weight value of the edges corresponding to the lanes, and the first weighted undirected graph is generated.
Step S205: and acquiring first position information of underground personnel and second position information of disaster avoidance positions.
For example, first position information of underground personnel is obtained through positioning equipment carried by the underground personnel, and second position information of a preset disaster avoidance position is obtained.
Step S206: and determining a corresponding first point position of the underground personnel in the first weighted undirected graph based on the first position information.
In the embodiment of the present application, step S206 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S207: and determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information.
In the embodiment of the present application, step S207 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S208: and planning a disaster avoidance route of underground personnel based on the first weighted undirected graph, the first point location and the second point location.
For example, the shortest path from the first point to the second point in the first weighted undirected graph can be obtained by the following formula, and the disaster avoidance route of the underground personnel can be planned according to the shortest path.
Wherein L is the total equivalent length of the shortest path,p*for the shortest path to be a short-path,sas a first point location of the first point,tas a second point location of the first point location,pis the slavesTo the point oftIs provided with a path for the path of (a),is a roadwaye ij Equivalent length of (d).
By implementing the embodiment of the application, the influence factors influencing the passage of underground personnel in a roadway can be obtained when mine disasters occur in the mine, the weight values corresponding to all sides of the undirected graph are determined based on the influence factors, the weighted undirected graph corresponding to the mine is obtained, the first point position corresponding to the underground personnel in the weighted undirected graph and the second point position corresponding to the disaster avoiding position in the weighted undirected graph are determined, and the disaster avoiding route of the underground personnel is planned based on the weighted undirected graph, the first point position and the second point position. The method can rapidly plan the optimal disaster avoidance route for underground personnel according to actual conditions, and improves disaster avoidance efficiency of the underground personnel.
In one implementation, an optimal path between a first point location corresponding to a downhole personnel and a second point location corresponding to a disaster avoidance location may be obtained to plan a disaster avoidance route based on the optimal path. As an example, please refer to fig. 3, fig. 3 is a schematic diagram of a planning method for a mine disaster avoidance route according to an embodiment of the present application. As shown in fig. 3, the method may include, but is not limited to, the following steps.
Step S301: and responding to mine disasters, and acquiring a first weighted undirected graph of the mine.
In the embodiment of the present application, step S301 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S302: and acquiring first position information of underground personnel and second position information of disaster avoidance positions.
In the embodiment of the present application, step S302 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S303: and determining a corresponding first point position of the underground personnel in the first weighted undirected graph based on the first position information.
In the embodiment of the present application, step S303 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S304: and determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information.
In the embodiment of the present application, step S304 may be implemented in any manner of each embodiment of the present application, which is not limited to this embodiment, and is not described in detail.
Step S305: based on the Dikk algorithm, a shortest path between a first point location and a second point location in the first weighted undirected graph is obtained.
For example, a node corresponding to the first point is used as a starting node, a node corresponding to the second point is used as a target node, and a disco tesla algorithm is used to obtain a shortest path from the starting node to the target node in the first weighted undirected graph.
For example, set the optimal path marker node setp* And unlabeled node setsp* Whereinp* Is a set of the empty cells in the cell,qincluding all nodes in the first weighted undirected graph. Initializing a node corresponding to a person in the wellv s To all nodes (including nodesv s ) Distance set Dist of infinity; initializing a node set father site before each node as an empty set, and setting nodes in a distance set Distv s To the nodev s Is initialized to 0; node corresponding to minimum distance in distance set Distv a Judgingv a Whether or not it is a target nodev t If yes, ending; otherwise, node is connected withv a From a collectionqRemove, and nodev a Added to a collectionp* In (a) and (b); acquisition nodev a Distance from its neighboring node (not involvingp* Node in (a)), if (nodev a Is the shortest distance+node of (2)v a To the nodev b Is equivalent length wab of (2)<Nodes in distance set Distv b And updating the node in Distv b Is to and from the distance of the nodes in the integrated father sitev b A corresponding front node; repeating the above steps until nodes are all gathered from the setqIs removed from and added to the collectionp* In (a) and (b); and iterating according to the parent node reverse direction of the target node, and outputting the shortest path.
In the embodiment of the present application, when the number of the second points is plural, the shortest path corresponding to the first point and each second point may be obtained, and the shortest path corresponding to each second point may be obtained as the shortest path available.
Step S306: and planning a disaster avoidance route based on the shortest path.
For example, roadway intersection points corresponding to nodes included in the shortest path and roadways corresponding to edges included in the shortest path are obtained, and ancestors formed by the roadway intersection points and the roadways are used as disaster avoidance routes.
By implementing the embodiment of the application, the influence factors influencing the passage of underground personnel in a roadway can be obtained when mine disasters occur in the mine, the weight values corresponding to all sides of the undirected graph are determined based on the influence factors, the weighted undirected graph corresponding to the mine is obtained, the first point position corresponding to the underground personnel in the weighted undirected graph and the second point position corresponding to the disaster avoiding position in the weighted undirected graph are determined, and therefore, the shortest path between the first point position and the second point position is obtained based on the Dikk algorithm and is used as the disaster avoiding route of the underground personnel. The method can rapidly plan the optimal disaster avoidance route for underground personnel according to actual conditions, and improves disaster avoidance efficiency of the underground personnel.
In some embodiments of the present application, the above method may further comprise the steps of:
step B1: and updating the traffic impact factor in response to the preset time.
For example, the traffic impact factors for the respective lanes are retrieved in response to a lapse of a preset time (e.g., 5 minutes).
Step B2: and updating the first weighted undirected graph based on the updated traffic impact factors, and acquiring a second weighted undirected graph.
For example, the equivalent length of each roadway of the mine is recalculated based on the updated traffic impact factors, and the weight value of the corresponding side of each roadway in the first weighted undirected graph is updated based on the equivalent length obtained by recalculation, so as to obtain the second weighted undirected graph.
In some embodiments of the present application, it may be determined whether the roadway is capable of communicating with underground personnel according to the traffic impact factor, and after determining that the roadway is incapable of communicating with underground personnel, removing edges corresponding to the non-trafficable roadway from the first weighted undirected graph.
As an example, the traffic impact factor is the concentration of harmful gases caused by mine disasters. And determining the roadway as a roadway incapable of being passed by underground personnel in response to the concentration of the harmful gas in the roadway being greater than a preset concentration threshold.
Step B3: and updating the disaster avoidance route based on the second weighted undirected graph.
For example, based on the second weighted undirected graph, a new disaster avoidance line is obtained by using the method provided by any of the embodiments of the present application. For example, the method as in the aforementioned step S105 is employed.
In some embodiments of the present application, the above method may further comprise the steps of: generating disaster avoidance prompt information based on the disaster avoidance route; and pushing disaster avoidance prompt information to underground personnel.
As an example, disaster avoidance prompt information for guiding a travel route of a downhole person is generated based on a disaster avoidance route, and the disaster avoidance prompt information is broadcasted through a voice device near the location of the downhole person.
As another example, disaster avoidance prompt information for guiding the travel route of the underground personnel is generated based on the disaster avoidance route, and the disaster avoidance prompt information is pushed to terminal equipment corresponding to the underground personnel.
In some embodiments of the present application, the method provided in any of the foregoing embodiments of the present application may be used to obtain the shortest path from each node to the disaster avoidance location, and display the shortest path on the electronic information sign set in advance for each node.
Referring to fig. 4, fig. 4 is a schematic diagram of a planning scheme of a mine disaster avoidance route according to an embodiment of the present application. In this scheme, as shown in fig. 4, when a mine disaster occurs in a mine, a directed graph corresponding to the mine can be generated according to a mine mining engineering graph, and a roadway peer influence factor influencing underground personnel on the roadway peer is determined, so that an equivalent length corresponding to the roadway is calculated according to the roadway peer influence factor, the equivalent length of the roadway is used as a weight value of a roadway corresponding side in an undirected graph to obtain a weighted undirected graph, so that an optimal disaster avoidance path of the underground personnel to go to a disaster avoidance position is planned according to the weighted undirected graph, and related information of the optimal disaster avoidance path is issued in various modes to assist the underground personnel in avoiding the disaster.
Referring to fig. 5, fig. 5 is a schematic structural diagram of a planning apparatus for a mine disaster avoidance line according to an embodiment of the present application. As shown in fig. 5, the apparatus 500 includes: a first processing module 501, configured to obtain a first weighted undirected graph of a mine in response to occurrence of a mine disaster in the mine; the acquiring module 502 is configured to acquire first position information of a downhole personnel and second position information of a disaster avoidance position; a second processing module 503, configured to determine a first point location corresponding to the underground personnel in the first weighted undirected graph based on the first location information; a third processing module 504, configured to determine a second point location corresponding to the disaster avoidance location in the first weighted undirected graph based on the second location information; the route planning module 505 is configured to plan a disaster avoidance route for a downhole personnel based on the first weighted undirected graph, the first point location, and the second point location.
In one implementation, the first processing module 501 is specifically configured to: obtaining a topological connection relationship between a roadway of a mine and a roadway intersection; acquiring a traffic influence factor corresponding to a roadway; based on the traffic influence factors, acquiring equivalent lengths corresponding to the roadways; and acquiring a first weighted undirected graph based on the equivalent length and the topological connection relation corresponding to the roadway.
In an alternative implementation, the first processing module 501 is specifically configured to: acquiring the roadway length and normal passing time corresponding to the roadway; acquiring a first passing time corresponding to a roadway when a passing influence factor exists; acquiring an influence multiplier factor corresponding to a roadway based on the normal passing time and the first passing time; and acquiring the equivalent length corresponding to the roadway based on the influence multiplier factor and the roadway length corresponding to the roadway.
In an alternative implementation, the traffic impact factor includes at least one of: roadway type of roadway; roadway gradient of the roadway; wind speed in a roadway; the number of obstacles in the roadway; the impact factors caused by mine disasters.
In an alternative implementation, the apparatus further includes a fourth processing module. As an example, please refer to fig. 6, fig. 6 is a schematic diagram of another planning apparatus for a mine disaster avoidance route according to an embodiment of the present application. As shown in fig. 6, the apparatus 600 further includes: a fourth processing module 606 for updating the traffic impact factor in response to the lapse of a preset time; a fifth processing module 607, configured to update the first weighted undirected graph based on the updated traffic impact factor, and obtain a second weighted undirected graph; a sixth processing module 608 is configured to update the disaster avoidance route based on the second weighted undirected graph. The modules 601 to 605 in fig. 6 have the same structure and function as the modules 501 to 505 in fig. 5.
In one implementation, the route planning module 505 is specifically configured to: based on a Dikk algorithm, acquiring a shortest path between a first point location and a second point location in a first weighted undirected graph; and planning a disaster avoidance route based on the shortest path.
In one implementation, the apparatus further includes a generating module and a prompting module. As an example, please refer to fig. 7, fig. 7 is a schematic diagram of a planning apparatus for a mine disaster avoidance route according to an embodiment of the present application. As shown in fig. 7, the apparatus 700 further includes a generating module 706, configured to generate disaster avoidance prompt information based on the disaster avoidance route; and the prompt module 707 is used for pushing disaster avoidance prompt information to underground personnel. The modules 701-705 in fig. 7 have the same structure and function as the modules 501-505 in fig. 5.
By the device, the weighted undirected graph corresponding to the mine can be obtained when the mine disaster occurs in the mine, the first point position corresponding to the weighted undirected graph of underground personnel and the second point position corresponding to the disaster avoiding position in the weighted undirected graph are determined, and therefore the disaster avoiding route of the underground personnel is planned based on the weighted undirected graph, the first point position and the second point position. Reasonable disaster avoidance routes can be planned for underground personnel rapidly, and disaster avoidance efficiency of the underground personnel is improved.
It should be noted that the explanation of the foregoing embodiments of the method for planning a mine disaster avoidance line is also applicable to the device for planning a mine disaster avoidance line in this embodiment, and will not be repeated here.
In order to achieve the above embodiment, the present application further provides an electronic device. Referring to fig. 8, fig. 8 is a schematic structural diagram of an electronic device according to an embodiment of the present application. As shown in fig. 8, the electronic device 800 includes: a processor 801 and a memory 802 communicatively connected to the processor 801; the memory 802 stores computer-executable instructions; the processor 801 executes computer-executable instructions stored in the memory to implement the methods provided by the previous embodiments.
In order to implement the above-described embodiments, the present application also proposes a computer-readable storage medium having stored therein computer-executable instructions that, when executed by a processor, are adapted to implement the methods provided by the foregoing embodiments.
In order to implement the above embodiments, the present application also proposes a computer program product comprising a computer program which, when executed by a processor, implements the method provided by the above embodiments.
In the foregoing description of embodiments, reference has been made to the terms "one embodiment," "some embodiments," "example," "a particular example," or "some examples," etc., meaning that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, schematic representations of the above terms are not necessarily directed to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, the different embodiments or examples described in this specification and the features of the different embodiments or examples may be combined and combined by those skilled in the art without contradiction.
Furthermore, the terms "first," "second," and the like, are used for descriptive purposes only and are not to be construed as indicating or implying a relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include at least one such feature. In the description of the present application, the meaning of "plurality" means at least two, for example, two, three, etc., unless specifically defined otherwise.
Any process or method descriptions in flow charts or otherwise described herein may be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps of the process, and additional implementations are included within the scope of the preferred embodiment of the present application in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order from that shown or discussed, depending on the functionality involved, as would be understood by those reasonably skilled in the art of the embodiments of the present application.
Logic and/or steps represented in the flowcharts or otherwise described herein, e.g., a ordered listing of executable instructions for implementing logical functions, can be embodied in any computer-readable medium for use by or in connection with an instruction execution system, apparatus, or device, such as a computer-based system, processor-containing system, or other system that can fetch the instructions from the instruction execution system, apparatus, or device and execute the instructions. For the purposes of this description, a "computer-readable medium" can be any means that can contain, store, communicate, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device. More specific examples (a non-exhaustive list) of the computer-readable medium would include the following: an electrical connection (electronic device) having one or more wires, a portable computer diskette (magnetic device), a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber device, and a portable compact disc read-only memory (CDROM). In addition, the computer readable medium may even be paper or other suitable medium on which the program is printed, as the program may be electronically captured, via, for instance, optical scanning of the paper or other medium, then compiled, interpreted or otherwise processed in a suitable manner, if necessary, and then stored in a computer memory.
It is to be understood that portions of the present application may be implemented in hardware, software, firmware, or a combination thereof. In the above-described embodiments, the various steps or methods may be implemented in software or firmware stored in a memory and executed by a suitable instruction execution system. As with the other embodiments, if implemented in hardware, may be implemented using any one or combination of the following techniques, as is well known in the art: discrete logic circuits having logic gates for implementing logic functions on data signals, application specific integrated circuits having suitable combinational logic gates, programmable Gate Arrays (PGAs), field Programmable Gate Arrays (FPGAs), and the like.
Those of ordinary skill in the art will appreciate that all or a portion of the steps carried out in the method of the above-described embodiments may be implemented by a program to instruct related hardware, where the program may be stored in a computer readable storage medium, and where the program, when executed, includes one or a combination of the steps of the method embodiments.
In addition, each functional unit in the embodiments of the present application may be integrated in one processing module, or each unit may exist alone physically, or two or more units may be integrated in one module. The integrated modules may be implemented in hardware or in software functional modules. The integrated modules may also be stored in a computer readable storage medium if implemented in the form of software functional modules and sold or used as a stand-alone product.
The above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, or the like. While embodiments of the present application have been shown and described above, it will be understood that the above embodiments are illustrative and not to be construed as limiting the application, and that variations, modifications, alternatives and variations may be made to the above embodiments by one of ordinary skill in the art within the scope of the application.
Claims (10)
1. The planning method of the mine disaster avoidance route is characterized by comprising the following steps of:
responding to mine disasters, and acquiring a first weighted undirected graph of the mine;
acquiring first position information of underground personnel and second position information of disaster avoidance positions;
determining a first point position corresponding to the underground personnel in the first weighted undirected graph based on the first position information;
determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information;
and planning a disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location and the second point location.
2. The method of claim 1, wherein the obtaining a first weighted undirected graph of the mine comprises:
acquiring a topological connection relationship between a roadway of the mine and a roadway intersection point;
acquiring a traffic influence factor corresponding to the roadway;
based on the traffic influence factors, acquiring equivalent lengths corresponding to the roadway;
and acquiring the first weighted undirected graph based on the equivalent length corresponding to the roadway and the topological connection relation.
3. The method of claim 2, wherein the obtaining the equivalent length corresponding to the roadway based on the traffic impact factor comprises:
acquiring the roadway length and the normal passing time corresponding to the roadway;
acquiring a first passing time corresponding to the roadway when the passing influence factor exists;
acquiring an influence multiplier factor corresponding to the roadway based on the normal passing time and the first passing time;
and acquiring the equivalent length corresponding to the roadway based on the influence multiplier factor corresponding to the roadway and the roadway length.
4. The method of claim 2, wherein the traffic impact factor comprises at least one of:
the roadway type of the roadway;
the roadway gradient of the roadway;
wind speed in the roadway;
the number of obstacles in the roadway;
and the influence factors caused by the mine disaster.
5. The method as recited in claim 2, wherein said method further comprises:
updating the traffic impact factor in response to the lapse of a preset time;
updating the first weighted undirected graph based on the updated traffic impact factors, and acquiring a second weighted undirected graph;
and updating the disaster avoidance route based on the second weighted undirected graph.
6. The method of claim 1, wherein the planning the disaster avoidance route for the downhole personnel based on the first weighted undirected graph, the first point location, and the second point location comprises:
based on a Dikk algorithm, acquiring a shortest path between the first point location and the second point location in the first weighted undirected graph;
and planning the disaster avoidance route based on the shortest path.
7. The method of any one of claims 1-6, further comprising:
generating disaster avoidance prompt information based on the disaster avoidance route;
pushing the disaster avoidance prompt information to underground personnel.
8. A mine disaster avoidance line planning device, comprising:
the first processing module is used for responding to mine disasters occurring in a mine and acquiring a first weighted undirected graph of the mine;
the acquisition module is used for acquiring first position information of underground personnel and second position information of disaster avoidance positions;
the second processing module is used for determining a first point position corresponding to the underground personnel in the first weighted undirected graph based on the first position information;
the third processing module is used for determining a second point position corresponding to the disaster avoidance position in the first weighted undirected graph based on the second position information;
and the route planning module is used for planning a disaster avoidance route of the underground personnel based on the first weighted undirected graph, the first point location and the second point location.
9. An electronic device, comprising: a processor, and a memory communicatively coupled to the processor;
the memory stores computer-executable instructions;
the processor executes computer-executable instructions stored in the memory to implement the method of any one of claims 1 to 7.
10. A computer readable storage medium having stored therein computer executable instructions which when executed by a processor are adapted to carry out the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311483721.8A CN117217400A (en) | 2023-11-09 | 2023-11-09 | Mine disaster avoidance route planning method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202311483721.8A CN117217400A (en) | 2023-11-09 | 2023-11-09 | Mine disaster avoidance route planning method and device, electronic equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117217400A true CN117217400A (en) | 2023-12-12 |
Family
ID=89051489
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202311483721.8A Pending CN117217400A (en) | 2023-11-09 | 2023-11-09 | Mine disaster avoidance route planning method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117217400A (en) |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106910139A (en) * | 2017-02-22 | 2017-06-30 | 北京石油化工学院 | A kind of prominent flooding disaster emergency evacuation analogy method in colliery |
| WO2023273091A1 (en) * | 2021-06-29 | 2023-01-05 | 中煤科工开采研究院有限公司 | Method for preventing and controlling rock bursts in development roadway group |
| CN115759496A (en) * | 2022-11-07 | 2023-03-07 | 煤炭科学技术研究院有限公司 | Method and device for determining escape path of underground water-permeable disaster and electronic equipment |
-
2023
- 2023-11-09 CN CN202311483721.8A patent/CN117217400A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106910139A (en) * | 2017-02-22 | 2017-06-30 | 北京石油化工学院 | A kind of prominent flooding disaster emergency evacuation analogy method in colliery |
| WO2023273091A1 (en) * | 2021-06-29 | 2023-01-05 | 中煤科工开采研究院有限公司 | Method for preventing and controlling rock bursts in development roadway group |
| CN115759496A (en) * | 2022-11-07 | 2023-03-07 | 煤炭科学技术研究院有限公司 | Method and device for determining escape path of underground water-permeable disaster and electronic equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102663890B (en) | Method for determining left-turning forbiddance traffic limitation intersection by using floating car data | |
| Asadabadi et al. | Optimal transportation and shoreline infrastructure investment planning under a stochastic climate future | |
| CN104236577B (en) | A kind of information processing method and electronic equipment | |
| CN110174110B (en) | Map corresponding method and device, electronic equipment and computer readable medium | |
| Asadabadi et al. | Assessing strategies for protecting transportation infrastructure from an uncertain climate future | |
| CN103471603A (en) | Method and apparatus for matching of bus route and road network | |
| US10706720B2 (en) | Predicting vehicle travel times by modeling heterogeneous influences between arterial roads | |
| CN117217400A (en) | Mine disaster avoidance route planning method and device, electronic equipment and storage medium | |
| Lee et al. | Congestion pattern model for predicting short-term traffic decongestion times | |
| JP4364896B2 (en) | Linear facility maintenance management method and program | |
| CN111953651A (en) | Urban road network cascade failure node identification method | |
| CN112923941A (en) | Route planning method, data mining method, corresponding device and electronic equipment | |
| CN115759496A (en) | Method and device for determining escape path of underground water-permeable disaster and electronic equipment | |
| CN114218344A (en) | Map data updating method, apparatus, device, storage medium, and program product | |
| CN111862594B (en) | Method, device and storage medium for identifying weak unit in road traffic network | |
| CN105701555A (en) | Method and system for dividing road network | |
| JP6805195B2 (en) | Route calculation method, route calculation device and program | |
| WO2021253869A1 (en) | Subsidence early warning method and system, terminal device, and storage medium | |
| Al-Kuwari et al. | Forensic tracking and mobility prediction in vehicular networks | |
| Bowles et al. | Evacuation and life-loss estimation model for natural and dam break floods | |
| Pregnolato et al. | Towards integrating modelling of floodinduced bridge failures | |
| CN117437329B (en) | High-consequence region drawing method, system, readable storage medium and computer device | |
| CN117475641B (en) | Method, device, equipment and medium for detecting traffic state of expressway | |
| CN116720634B (en) | Park operation data processing method and system | |
| CN117727190B (en) | Method and system for controlling shunting traffic lights of smart city vehicles |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |