CN111027162B - Method for determining fire extinguishing plugging position of mine roadway network - Google Patents
Method for determining fire extinguishing plugging position of mine roadway network Download PDFInfo
- Publication number
- CN111027162B CN111027162B CN201911291814.4A CN201911291814A CN111027162B CN 111027162 B CN111027162 B CN 111027162B CN 201911291814 A CN201911291814 A CN 201911291814A CN 111027162 B CN111027162 B CN 111027162B
- Authority
- CN
- China
- Prior art keywords
- node
- fire
- point
- searching
- air
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 17
- 230000000903 blocking effect Effects 0.000 claims abstract description 10
- 238000005520 cutting process Methods 0.000 claims description 10
- 230000008676 import Effects 0.000 claims description 9
- 238000010845 search algorithm Methods 0.000 claims description 3
- 238000009472 formulation Methods 0.000 abstract description 2
- 239000000203 mixture Substances 0.000 abstract description 2
- 239000000779 smoke Substances 0.000 description 8
- 230000001105 regulatory effect Effects 0.000 description 5
- 230000001276 controlling effect Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000012544 monitoring process Methods 0.000 description 3
- 238000003892 spreading Methods 0.000 description 3
- 238000009792 diffusion process Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000009423 ventilation Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000033228 biological regulation Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 239000000428 dust Substances 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 238000004088 simulation Methods 0.000 description 1
- 230000001629 suppression Effects 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
- G06Q50/10—Services
- G06Q50/26—Government or public services
- G06Q50/265—Personal security, identity or safety
Landscapes
- Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Engineering & Computer Science (AREA)
- General Health & Medical Sciences (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Health & Medical Sciences (AREA)
- Economics (AREA)
- Computer Security & Cryptography (AREA)
- Human Resources & Organizations (AREA)
- Educational Administration (AREA)
- Primary Health Care (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Fire-Extinguishing By Fire Departments, And Fire-Extinguishing Equipment And Control Thereof (AREA)
- Ventilation (AREA)
Abstract
The invention provides a method for determining a fire extinguishing and blocking position of a mine roadway network, which adopts a single-point cut-set method, wherein the single-point cut-set method comprises the following steps: roadway net vertex setWherein V is a roadway network node set, and the fire position is a node V 0 The single-point cut set is an edge set which is expressed as a fire period plugging roadway set, and v can be obtained after deleting the edge set 0 And the fire disaster position is not communicated with S, namely the fire disaster position is not communicated with other roadways, namely the air door of the roadway where the fire disaster position is positioned is closed, so that the spread of the fire disaster is prevented. The invention provides scientific basis for emergency fire extinguishing in mine roadway network fire period by utilizing single-point cut-set algorithm, theoretical basis for formulation of fire extinguishing scheme, and determines all paths of mine roadway network by adopting depth exploration algorithm to avoid missing. The method provides a scientific, comprehensive and accurate fire extinguishing scheme for the mine fire disaster period, and particularly indicates which automatic air doors and plugging air bag devices of the roadway net tunnels should be closed in the fire disaster period.
Description
Technical Field
The invention belongs to the field of mine safety, and relates to a method for determining a fire extinguishing plugging position of a mine network.
Background
The stable and reliable ventilation system is an important guarantee for mine safety production, and emergency fire extinguishment in mine fire disaster period is the most effective way for reducing casualties and preventing secondary accidents. The students at home and abroad develop a great deal of research work in aspects of wind flow state, smoke diffusion law and the like in the mine fire period, also invent automatic air door and plugging air bag equipment and technology in various fire periods, simultaneously apply big data and simulation technology to analyze and predict the fire occurrence range, smoke dust and harmful gas diffusion paths, assist in making rescue and avoidance route planning, but always do not propose which of the automatic air door and plugging air bag devices should be closed and which should be opened in the fire period, judge only by the experience of an expert, and the students propose an automatic air door regulating and controlling system based on mine smoke monitoring, but because the complexity of the mine ventilation system leads to the smoke disturbance in the fire period, the effect of fire extinguishment cannot be achieved by the automatic air door regulating and controlling method only by the smoke monitoring, if the air door regulating and controlling is incorrect, the fire spreading can be accelerated, and serious consequences are caused.
Therefore, with the aim of reducing the speed of accelerating the fire spreading and greatly reducing the influence of the fire, it is necessary to propose a method for determining the fire extinguishing and blocking position of the mine network fire so as to solve the problem that the automatic air door and the blocking air bag device are closed and opened in need of improvement.
Disclosure of Invention
In order to solve the problems in the prior art, the invention provides a method for determining the fire extinguishing blocking position of a mine network fire disaster, which determines the blocking roadway scheme in the fire disaster period, closes an automatic air door or a blocking air bag device in the mine fire disaster period, and provides a fire extinguishing method in the fire disaster period so as to achieve the effect of closed fire extinguishing in the mine fire disaster period.
The technical proposal is as follows: a method for determining a fire extinguishing and blocking position of a mine network, comprising the following steps:
step 1: the set of the input roadway net roadway is e= { e 1 ,e 2 ,...,e n N is the number of lanes, and the input lane network node set is V= { V 1 ,ν 2 ,...,ν m And m is the number of nodes, determining the topological relation of the lane network and judging the connectivity of the lane network.
Step 2: determining a set of roadway net vertices
Step 3: determining fire tunnel e i ，e i E, e, determining roadway e i A fire position in (a) and setting the fire position as a node v o Node v o E, fire tunnel i Dividing into two lanes, dividing the two lanesThe lanes are respectively numbered as e o 、e' o 。
Step 4: find the dividing node v o Cut set d corresponding to all other nodes except k Cut set d= { D 1 ,d 2 ,..,d k ,...,d m { k e {1, 2..m }, the cutset d } k Is an edge set, d k Each element in the system represents one side, namely one roadway, and one side is formed by connecting two nodes.
Step 5: the air inlet searches forwards according to the wind direction, and a first node is searched by using a depth-first search algorithm, so that a single-point cut set A of the first node of the air inlet well is obtained 1-1 ＝d 1 ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node 2 ；
Cut set d of second node 2 Single point cutset a with first node 1-1 The union is calculated, and then the cut set d of the second node is subtracted 2 Single point cutset a with first node 1-1 The resulting difference, the edge set, is the single point cut A from the air intake to the second node 1-2 ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an outlet point is searched, ending searching of the first air path, so as to obtain a single-point cut set from the air inlet to all nodes on the first air path;
after the first wind path search is finished, returning to the previous node of the fire node or the exit point, continuing searching from the other path if the previous node has a turnout, continuing returning until the previous node does not have the turnout, continuing searching from the other path until the position of the node with the turnout is returned until the fire node or the exit point is searched, finishing the second wind path search, and further obtaining a single-point cut set from the air inlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or outlet points according to the steps until all the air paths are searched, and further obtaining single-point cut sets from the air inlets to all the nodes;
the single-point cut sets from the air inlet to all the nodes form a single-point cut set A of the air inlet well.
Step 6: searching backwards by the air outlet according to the reverse wind direction, searching a first node by using a depth-first searching algorithm, and then obtaining a single-point cut set B of the first node of the return wind well m-m ＝d m ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node m-1 ；
Cut set d of second node m-1 Single point cutset B with first node m-m The union is calculated, and then the cut set d of the second node is subtracted m-1 Single point cutset B with first node m-m The resulting difference, i.e., edge set, is the single point cut set B from the air outlet to the second node m-(m-1) ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an entrance point is searched, ending the searching of the first air path, and further obtaining a single-point cut set from the air outlet to all nodes on the first air path;
after the first wind path search is finished, returning to the last node of the fire node or the import point, continuing searching from the other path if the last node has a turnout, continuing returning until the node with the turnout is returned to continue searching from the other path, and until the fire node or the import point is searched, finishing the second wind path search, and further obtaining single-point cutsets from the air outlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or import points according to the steps until all air paths are searched, and further obtaining single-point cut sets from the air outlets to all nodes;
the single-point cut sets from the air outlet to all the nodes form a single-point cut set B of the return air shaft.
Step 7: the union of any one set of the single-point cutting sets A of the air inlet well and any one set of the single-point cutting sets B of the air return well is obtained to obtain a single-point cutting set C k ，C k The scheme is a scheme for plugging the roadway in the fire disaster period. During the fire period, C k The air doors and the blocking air bags of all the roadways in the road should be closedPreventing the spread of fire.
Compared with the prior art, the invention has the beneficial effects that:
the invention provides a single-point cut set concept, provides a single-point cut set as an edge set, and provides a single-point cut set method, wherein the single-point cut set method comprises the following steps: roadway net vertex setWherein V is a roadway network node set, and the fire position is a node V 0 The single-point cut set is an edge set which is expressed as a fire period plugging roadway set, and v can be obtained after deleting the edge set 0 The fire disaster position is not communicated with S, namely the fire disaster position is not communicated with other roadways, namely the air door of the roadway where the fire disaster position is located is closed, the spread of fire is prevented, a scientific basis is provided for the emergency fire extinguishing problem in the mine roadway network fire disaster period, a theoretical basis is provided for the formulation of a fire extinguishing scheme, and the automatic air door and the plugging air bag device are judged to be closed and opened in the fire disaster period instead of relying on experience. Meanwhile, a depth exploration algorithm is adopted to determine all the paths of the mine roadway network, so that the lack of leakage is avoided. Compared with the traditional automatic air door regulating and controlling system based on mine smoke monitoring, the fire extinguishing scheme determined by the single-point cut-and-set algorithm overcomes the defect of being influenced by smoke, solves the problem that an air door is not correctly regulated and controlled due to the influence of smoke disturbance in a fire period, and reduces the possibility of accelerating fire spreading due to incorrect air door regulation and control. The method provides a scientific, comprehensive and accurate fire extinguishing scheme for the mine fire disaster period, and particularly indicates which automatic air doors and plugging air bag devices of the roadway net tunnels should be closed in the fire disaster period.
Drawings
FIG. 1 is a schematic diagram of the topology of a roadway network according to the present invention;
FIG. 2 is a diagram of a network topology of the present invention updating lane numbers;
FIG. 3 is a schematic diagram of a node cutset in accordance with the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings in order that the invention may be more clearly understood.
A method of determining a fire suppression plugging location for a mine network fire in accordance with an embodiment of the present invention is described below with reference to fig. 1-3.
As shown in fig. 1, step one: determining a roadway net roadway set as e= { e 1 ,e 2 ,...,e n }，n＝10，V＝{ν 1 ,ν 2 ,...,ν m And m=8, the direct topological relation between the nodes and the roadway can be determined through the figure 1, and the roadway network communication can be judged. Step two: determining vertex sets
As shown in fig. 2 to 3, step three: determining a fire tunnel, and setting a fire position v in the fire tunnel 0 I.e. ignition point, node v o Dividing a fire tunnel into two tunnels, and respectively numbering the two tunnels as e o 、e' o 。
Step four: according to the single-point cut set basic algorithm, find out v 0 All other nodes except the corresponding cut set, d= { D 1 ,d 2 ,...,d m }，d 1 ＝{e 1 }，d 2 ＝{e 1 ,e 2 ,e 3 }，d 2 ＝{e 1 ,e 2 ,e 3 }，d 3 ＝{e 0 ,e 2 ,e 4 }，d 4 ＝{e 3 ,e 5 ,e 7 }d 5 ＝{e 4 ,e 5 ,e 6 }，d 6 ＝{e 6 ,e 7 ,e 9 }，d 7 ＝{e' 0 ,e 9 ,e 10 }，d 8 ＝{e 10 }。
Fifth step: the air inlet searches forwards according to the wind direction, and a first node is searched by using a depth-first search algorithm, so that a single-point cut set A of the first node of the air inlet well is obtained 1-1 ＝d 1 ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node 2 ；
Cutting of the second nodeSet d 2 Single point cutset a with first node 1-1 The union is calculated, and then the cut set d of the second node is subtracted 2 Single point cutset a with first node 1-1 The resulting difference, the edge set, is the single point cut A from the air intake to the second node 1-2 ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an outlet point is searched, ending searching of the first air path, so as to obtain a single-point cut set from the air inlet to all nodes on the first air path;
after the first wind path search is finished, returning to the previous node of the fire node or the exit point, continuing searching from the other path if the previous node has a turnout, continuing returning until the previous node does not have the turnout, continuing searching from the other path until the position of the node with the turnout is returned until the fire node or the exit point is searched, finishing the second wind path search, and further obtaining a single-point cut set from the air inlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or outlet points according to the steps until all the air paths are searched, and further obtaining single-point cut sets from the air inlets to all the nodes;
the single-point cut sets from the air inlet to all the nodes form a single-point cut set A of the air inlet well.
A 1-1 ＝d 1 ＝{e 1 }；
A 1-2 ＝(A 1-1 ∪d 2 )-(A 1-1 ∩d 2 )＝{e 2 ,e 3 }；
A 1-2-3 ＝(A 1-2 ∪d 3 )-(A 1-2 ∩d 3 )＝{e 0 ,e 3 ,e 4 }
Search v 0 Rollback to v 3 Then search v 5
A 1-2-3-5 ＝(A 1-2-3 ∪d 5 )-(A 1-2-3 ∩d 5 )＝{e 0 ,e 3 ,e 5 ,e 6 }；
A 1-2-3-5-6 ＝(A 1-2-3-5 ∪d 6 )-(A 1-2-3-5 ∩d 6 )＝{e 0 ,e 3 ,e 5 ,e 7 ,e 9 }；
A 1-2-3-5-6-7 ＝(A 1-2-3-5-6 ∪d 7 )-(A 1-2-3-5-6 ∩d 7 )＝{e 0 ,e' 0 ,e 3 ,e 5 ,e 7 ,e 1 }
Search v 8 Rollback to v 7 Continue to fall back to v 6 ，v 5 ，v 3 ，v 2 Then search v 4
A 1-2-4 ＝(A 1-2 ∪d 4 )-(A 1-2 ∩d 4 )＝{e 2 ,e 5 ,e 7 }；
A 1-2-4-5 ＝(A 1-2-4 ∪d 5 )-(A 1-2-4 ∩d 5 )＝{e 2 ,e 4 ,e 6 ,e 7 }；
A 1-2-4-5-6 ＝(A 1-2-4-5 ∪d 6 )-(A 1-2-4-5 ∩d 6 )＝{e 2 ,e 4 ,e 9 }；
A 1-2-4-5-6-7 ＝(A 1-2-4-5-6 ∪d 7 )-(A 1-2-4-5-6 ∩d 7 )＝{e' 0 ,e 2 ,e 4 ,e 10 }
Search v 8 Rollback to v 7 Continue to fall back to v 6 ，v 5 ，v 4 Then search v 6
A 1-2-4-6 ＝(A 1-2-4 ∪d 6 )-(A 1-2-4 ∩d 6 )＝{e 2 ,e 5 ,e 6 ,e 9 }；
A 1-2-4-6-7 ＝(A 1-2-4-6 ∪d 7 )-(A 1-2-4-6 ∩d 7 )＝{e' 0 ,e 2 ,e 5 ,e 6 ,e 10 }
Back to v 4 At the same time with v 4 Starting from two v 5 And v 6 Will v 5 And v 6 At the same time containNear single point cut-out is A 1-2-4-5-6 The content search has been completed before, continuing to fall back to v 2 At the same time with v 2 Starting from two v 3 And v 4 Will v 3 And v 4 And comprises a near single point cut set.
A 1-2-4-3 ＝(A 1-2-4 ∪d 3 )-(A 1-2-4 ∩d 3 )＝{e 0 ,e 4 ,e 5 ,e 7 }
Terminal node v 5 Searching
A 1-2-4-3-5 ＝(A 1-2-4-3 ∪d 5 )-(A 1-2-4-3 ∩d 5 )＝{e 0 ,e 6 ,e 7 }；
A 1-2-4-3-5-6 ＝(A 1-2-4-3-5 ∪d 6 )-(A 1-2-4-3-5 ∩d 6 )＝{e 0 ,e 9 }；
A 1-2-4-3-5-6-7 ＝(A 1-2-4-3-5-6 ∪d 7 )-(A 1-2-4-3-5-6 ∩d 7 )＝{e 0 ,e' 0 ,e 10 }
Rollback, i.e. without branch node, continues rollback until v 1 And finishing searching from the air inlet.
Sixth step: searching backwards by the air outlet according to the reverse wind direction, searching a first node by using a depth-first searching algorithm, and then obtaining a single-point cut set B of the first node of the return wind well 8-8 ＝d 8 ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node 7 ；
Cut set d of second node 7 Single point cutset B with first node 8-8 The union is calculated, and then the cut set d of the second node is subtracted 7 Single point cutset B with first node 8-8 The final difference, namely the edge set, is the single-point cut set B of the second node of the air outlet 8-7 ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an entrance point is searched, ending the searching of the first air path, and further obtaining a single-point cut set from the air outlet to all nodes on the first air path;
after the first wind path search is finished, returning to the last node of the fire node or the import point, continuing searching from the other path if the last node has a turnout, continuing returning until the node with the turnout is returned to continue searching from the other path, and until the fire node or the import point is searched, finishing the second wind path search, and further obtaining single-point cutsets from the air outlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or import points according to the steps until all air paths are searched, and further obtaining single-point cut sets from the air outlets to all nodes;
the single-point cut sets from the air outlet to all the nodes form a single-point cut set B of the return air shaft.
B 8-8 ＝d 8 ＝{e 10 }；
B 8-7 ＝(B 8-8 ∪d 7 )-(B 8-8 ∩d 7 )＝{e' 0 ,e 9 }
Search v 0 Rollback to v 7 Then search v 6
B 8-7-6 ＝(B 8-7 ∪d 6 )-(B 8-7 ∩d 6 )＝{e' 0 ,e 6 ,e 7 }；
B 8-7-6-4 ＝(B 8-7-6 ∪d 4 )-(B 8-7-6 ∩d 4 )＝{e' 0 ,e 3 ,e 5 ,e 6 ,}；
B 8-7-6-4-2 ＝(B 8-7-6-4 ∪d 2 )-(B 8-7-6-4 ∩d 2 )＝{e' 0 ,e 1 ,e 2 ,e 5 ,e 6 ,}
Search v 1 Rollback to v 2 Continue to fall back to v 4 ，v 6 Then search v 5
B 8-7-6-5 ＝(B 8-7-6 ∪d 5 )-(B 8-7-6 ∩d 5 )＝{e' 0 ,e 4 ,e 5 ,e 7 }；
B 8-7-6-5-3 ＝(B 8-7-6-5 ∪d 3 )-(B 8-7-6-5 ∩d 3 )＝{e' 0 ,e 0 ,e 2 ,e 5 ,e 7 }；
B 8-7-6-5-3-2 ＝(B 8-7-6-5-3 ∪d 2 )-(B 8-7-6-5-3 ∩d 2 )＝{e' 0 ,e 0 ,e 1 ,e 3 ,e 5 ,e 7 }
Search v 1 Rollback to v 2 Continue to fall back to v 3 ，v 5 Then search v 4
B 8-7-6-5-4 ＝(B 8-7-6-5 ∪d 4 )-(B 8-7-6-5 ∩d 4 )＝{e' 0 ,e 3 ,e 4 }；
B 8-7-6-5-4-2 ＝(B 8-7-6-5-4 ∪d 2 )-(B 8-7-6-5-4 ∩d 2 )＝{e' 0 ,e 1 ,e 2 ,e 4 }
Seventh step: the union of any one set of the single-point cutting sets A of the air inlet well and any one set of the single-point cutting sets B of the air return well is obtained to obtain a single-point cutting set C k ，C k Namely a scheme for plugging the roadway in the fire disaster period, C k The air doors and the blocking air bags of all the tunnels are closed, and the fire can be extinguished by matching control with the tunnels with the air doors.
Claims (1)
1. A method for determining a fire extinguishing and blocking position of a mine network, which is characterized by comprising the following steps:
step 1: the set of the input roadway net roadway is e= { e 1 ,e 2 ,...,e n N is the number of lanes, and the input lane network node set is V= { V 1 ,ν 2 ,...,ν m M is the number of nodes, determining the topological relation of the roadway network and judging the connectivity of the roadway network;
step 2: determining a set of roadway net vertices
Step 3: determining fire tunnel e i ,e i E, e, determining roadway e i A fire position in (a) and setting the fire position as a node v o Node v o E, fire tunnel i Dividing into two lanes, and respectively numbering the two lanes as e o 、e' o ；
Step 4: find the dividing node v o Cut set d corresponding to all other nodes except k Cut set d= { D 1 ,d 2 ,..,d k ,...,d m { k e {1, 2..m }, the cutset d } k Is an edge set, d k Each element in the system represents one side, namely one roadway, and one side is formed by connecting two nodes;
step 5: the air inlet searches forwards according to the wind direction, and a first node is searched by using a depth-first search algorithm, so that a single-point cut set A of the first node of the air inlet well is obtained 1-1 ＝d 1 ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node 2 ；
Cut set d of second node 2 Single point cutset a with first node 1-1 The union is calculated, and then the cut set d of the second node is subtracted 2 Single point cutset a with first node 1-1 The resulting difference, the edge set, is the single point cut A from the air intake to the second node 1-2 ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an outlet point is searched, ending searching of the first air path, so as to obtain a single-point cut set from the air inlet to all nodes on the first air path;
after the first wind path search is finished, returning to the previous node of the fire node or the exit point, continuing searching from the other path if the previous node has a turnout, continuing returning until the previous node does not have the turnout, continuing searching from the other path until the position of the node with the turnout is returned until the fire node or the exit point is searched, finishing the second wind path search, and further obtaining a single-point cut set from the air inlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or outlet points according to the steps until all the air paths are searched, and further obtaining single-point cut sets from the air inlets to all the nodes;
the single-point cut sets from the air inlet to all the nodes form a single-point cut set A of the air inlet well;
step 6: searching backwards by the air outlet according to the reverse wind direction, searching a first node by using a depth-first searching algorithm, and then obtaining a single-point cut set B of the first node of the return wind well m-m ＝d m ；
Continuing searching by using the depth-first searching algorithm, searching a second node, and knowing a cut set d of the second node m-1 ；
Cut set d of second node m-1 Single point cutset B with first node m-m The union is calculated, and then the cut set d of the second node is subtracted m-1 Single point cutset B with first node m-m The resulting difference, i.e., edge set, is the single point cut set B from the air outlet to the second node m-(m-1) ；
Continuing searching by using a depth-first searching algorithm, and when a fire node or an entrance point is searched, ending the searching of the first air path, and further obtaining a single-point cut set from the air outlet to all nodes on the first air path;
after the first wind path search is finished, returning to the last node of the fire node or the import point, continuing searching from the other path if the last node has a turnout, continuing returning until the node with the turnout is returned to continue searching from the other path, and until the fire node or the import point is searched, finishing the second wind path search, and further obtaining single-point cutsets from the air outlet to all nodes on the second wind path;
continuously backing back to search from fire nodes or import points according to the steps until all air paths are searched, and further obtaining single-point cut sets from the air outlets to all nodes;
the single-point cut sets from the air outlet to all the nodes form a single-point cut set B of the return air shaft;
step 7: the union of any one set of the single-point cutting sets A of the air inlet well and any one set of the single-point cutting sets B of the air return well is obtained to obtain a single-point cutting set C k ，C k The scheme is a scheme for plugging the roadway in the fire disaster period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291814.4A CN111027162B (en) | 2019-12-16 | 2019-12-16 | Method for determining fire extinguishing plugging position of mine roadway network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911291814.4A CN111027162B (en) | 2019-12-16 | 2019-12-16 | Method for determining fire extinguishing plugging position of mine roadway network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111027162A CN111027162A (en) | 2020-04-17 |
| CN111027162B true CN111027162B (en) | 2024-01-26 |
Family
ID=70209251
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911291814.4A Active CN111027162B (en) | 2019-12-16 | 2019-12-16 | Method for determining fire extinguishing plugging position of mine roadway network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111027162B (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5121344A (en) * | 1989-07-03 | 1992-06-09 | The United States Of America As Represented By The Secretary Of The Interior | Method of locating underground mines fires |
| US5909777A (en) * | 1996-11-12 | 1999-06-08 | Jamison Family Trust | Method and apparatus for stopping the spread of a fire in an underground mine |
| KR20100101365A (en) * | 2009-03-09 | 2010-09-17 | 연세대학교 산학협력단 | Media storing a program of detecting nodes which consist the closed path of the shortest distance using an shortest path matrix |
| CN108154265A (en) * | 2017-12-22 | 2018-06-12 | 中国矿业大学 | A kind of cellular automata optimization of mine fire best-effort path and bootstrap technique |
| CN109141573A (en) * | 2018-07-30 | 2019-01-04 | 太原理工大学 | Water level warning algorithm after a kind of water bursting in mine |
| CN109441545A (en) * | 2018-12-17 | 2019-03-08 | 西安科技大学 | A kind of auto-control damper system and regulation method based on mine flue gas monitoring |
-
2019
- 2019-12-16 CN CN201911291814.4A patent/CN111027162B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5121344A (en) * | 1989-07-03 | 1992-06-09 | The United States Of America As Represented By The Secretary Of The Interior | Method of locating underground mines fires |
| US5909777A (en) * | 1996-11-12 | 1999-06-08 | Jamison Family Trust | Method and apparatus for stopping the spread of a fire in an underground mine |
| KR20100101365A (en) * | 2009-03-09 | 2010-09-17 | 연세대학교 산학협력단 | Media storing a program of detecting nodes which consist the closed path of the shortest distance using an shortest path matrix |
| CN108154265A (en) * | 2017-12-22 | 2018-06-12 | 中国矿业大学 | A kind of cellular automata optimization of mine fire best-effort path and bootstrap technique |
| CN109141573A (en) * | 2018-07-30 | 2019-01-04 | 太原理工大学 | Water level warning algorithm after a kind of water bursting in mine |
| CN109441545A (en) * | 2018-12-17 | 2019-03-08 | 西安科技大学 | A kind of auto-control damper system and regulation method based on mine flue gas monitoring |
Non-Patent Citations (1)
| Title |
|---|
| 矿井火灾逃生路径规划及其三维仿真研究;刘笑笑;汪云甲;毕京学;徐亮;中国安全科学学报;第27卷(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111027162A (en) | 2020-04-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106530694B (en) | A kind of traffic congestion prediction technique and system based on traffic congestion propagation model | |
| CN104282162B (en) | A kind of crossing self-adapting signal control method based on real-time vehicle track | |
| CN106767860B (en) | A method of shortening intelligent automobile path planning search time based on heuristic search algorithm | |
| CN104317844B (en) | A kind of emergency processing method based on pipeline network of fuel gas in city topological analysis | |
| WO2019007126A1 (en) | Mfd and queuing length based road network boundary flow limiting control method under internet of vehicles | |
| Meneguzzer | Review of models combining traffic assignment and signal control | |
| CN104575108A (en) | Air traffic control automatic transfer system and method based on petri network | |
| WO2020173253A1 (en) | Method for optimizing cluster spacing of horizontal well for shale gas frcturing | |
| CN104200680A (en) | Traffic signal coordination control method of arterial street under super saturation traffic state | |
| CN111027162B (en) | Method for determining fire extinguishing plugging position of mine roadway network | |
| CN102663890B (en) | Method for determining left-turning forbiddance traffic limitation intersection by using floating car data | |
| CN110500512A (en) | Combustion gas method for analyzing cartridge igniter and device | |
| CN116187105B (en) | Fire evacuation planning method and system based on digital twin technology | |
| CN105654186A (en) | Indoor and outdoor integrated planning method used for emergency rescue optimal path calculation | |
| CN104775841A (en) | Ventilation network security division partitioning method oriented to mine air points | |
| CN111311028A (en) | Large-scale indoor personnel evacuation system based on improved particle swarm optimization algorithm | |
| CN109191873A (en) | A kind of method and device of traffic junction of two streams setting pre-signal lamp | |
| CN111953651B (en) | Urban road network cascade failure node identification method | |
| CN103191532A (en) | Method for determining optimum route for emergent personnel evacuation from disasters in intelligent building | |
| CN110778351A (en) | Combined ventilation and smoke exhaust method for urban underground intercommunication tunnel | |
| CN114743333A (en) | Intelligent building fire safety control system | |
| Gupta et al. | Simulation of pedestrian at intersection in urban congested area | |
| Casale | The automation of the aeraulic response in the case of a fire in a tunnel–first concrete answers | |
| CN109063282B (en) | Foundation pit layout method based on maximum channel and personnel density constraint | |
| CN109408950B (en) | Method for calculating four reasonable mining periods of mine by considering gas pre-extraction |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |