CN111027162A - Method for determining fire extinguishing and blocking position of mine roadway network - Google Patents

Abstract

The invention provides a method for determining a fire extinguishing blocking position of a mine roadway network, which adopts a single-point cut-and-gather method, and comprises the following steps: set of network vertices

Wherein V is a roadway network node set, and the fire position is a node V₀The single-point cut set is an edge set which is represented as a blocked roadway set in the fire period, and v can be enabled after the edge set is deleted₀And the S is not communicated, namely the fire position is not communicated with other roadways, namely the air door of the roadway where the fire position is located is closed, and the fire is prevented from spreading. The invention provides scientific basis for the emergency fire-extinguishing problem of the mine roadway network in the fire period by using the single-point cut-set algorithm, provides theoretical basis for the formulation of the fire-extinguishing scheme, and simultaneously determines all the passages of the mine roadway network by using the depth exploration algorithm to avoid missing. The method is mine fireThe period provides a scientific, comprehensive and accurate fire extinguishing scheme, and scientifically points out the automatic air doors and the blocking air bag devices of which roadway meshes should be closed in the fire period in detail.

Description

Method for determining fire extinguishing and blocking position of mine roadway network

Technical Field

The invention belongs to the field of mine safety, and relates to a method for determining a fire extinguishing and blocking position of a mine roadway network.

Background

The stable and reliable ventilation system is an important guarantee for the safe production of a mine, and emergency fire extinguishing in the period of mine fire is the most effective way for reducing casualties and preventing secondary accidents. Scholars at home and abroad develop a great deal of research work on the aspects of the air flow state, the smoke diffusion rule and the like in the period of mine fire, also invent equipment and technology of automatic air doors and blocking air bags in various periods of fire, meanwhile, big data and simulation technology are used to analyze and predict the fire occurrence range and the smoke and dust and harmful gas diffusion path, help to make a rescue and disaster avoidance route plan, but no automatic air door and air bag blocking device is provided, which should be closed and which should be opened in the fire period, and the judgment is carried out only by the experience of experts, and scholars provide an automatic air door regulating and controlling system based on mine smoke monitoring, however, due to the complexity of a mine ventilation system, the smoke is disordered in a fire period, the fire extinguishing effect cannot be achieved only by automatically regulating and controlling the air door by a smoke monitoring method, and if the air door is incorrectly regulated and controlled, the fire spread may be accelerated, so that more serious consequences are caused.

Therefore, in order to reduce the speed of spreading the fire and greatly reduce the influence of the fire, it is necessary to provide a method for determining the fire extinguishing blocking position of the mine roadway network so as to solve the problem that the automatic air door and the blocking air bag device which are required to be improved are closed and opened.

Disclosure of Invention

In order to solve the problems in the prior art, the invention provides a method for determining a fire extinguishing blocking position of a mine roadway network.

The technical scheme is as follows: a method for determining a fire extinguishing blocking position of a mine roadway network comprises the following steps:

step 1: the input roadway network roadway set is e ═ e₁,e₂,...,e_nN is the number of lanes, and the input lane network node set is V ═ V₁,ν₂,...,ν_mAnd 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 set of network vertices

And step 3: determining fire lanes e_i，e_iE is left to e, and a roadway e is determined_iAnd setting the location of the fire to node v_oNode v_oTo fire roadway e_iDividing the tunnel into two tunnels, and numbering the two tunnels as e_o、e'_o。

And 4, step 4: finding the division node v_oCut sets d corresponding to all other nodes except_kThe cut set D ═ D₁,d₂,..,d_k,...,d_mK ∈ {1, 2., m }, said cut-set d_kIs a set of edges, d_kEach element in the group represents an edge, namely a roadway, and one edge is formed by connecting two nodes.

And 5: the air inlet is used for searching forwards according to the wind direction, a first node is searched by using a depth-first search algorithm, and then a single-point cut set A of the first node of the air inlet shaft is obtained_1-1＝d₁；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node₂；

Cutting set d of second node₂Single point cut set A with first node_1-1Solving a union set, and then subtracting a cut set d of the second node₂Single point cut set A with first node_1-1The resulting difference, i.e., the edge set, is the single point cut set A from the air inlet to the second node_1-2；

Continuing searching by using a depth-first search algorithm, and when a fire node or an exit point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air inlet to all nodes on the first air passage;

after the first air path is searched, returning to the previous node of the fire node or the exit point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork is searched from the other path until the fire node or the exit point is searched, and finishing the search of the second air path so as to obtain a single-point cut set of all nodes from the air inlet to the second air path;

continuing to retreat and search from fire nodes or outlet points according to the steps until all air paths are searched, and further solving a single-point cut set from the air inlet to all nodes;

and the single-point cutting sets from the air inlet to all the nodes form a single-point cutting set A of the air inlet shaft.

Step 6: the air outlet searches backwards according to the upwind direction, and after a first node is searched by using a depth-first search algorithm, a single-point cut set B of the first node of the return air shaft is obtained_m-m＝d_m；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node_m-1；

Cutting set d of second node_m-1Single point cut set B with first node_m-mSolving a union set, and then subtracting a cut set d of the second node_m-1Single point cut set B with first node_m-mThe resulting difference, i.e. the 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 search algorithm, and when a fire node or an entrance point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air outlet to all nodes on the first air passage;

after the search of the first air path is finished, returning to the previous node of the fire node or the entrance point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork continues to search from the other path until the fire node or the entrance point is searched, and finishing the search of the second air path so as to obtain a single-point cut set from the air outlet to all nodes on the second air path;

continuing to retreat and search from the fire node or the entrance point according to the steps until all air paths are searched, and further solving a single-point cut set from the air outlet to all nodes;

and the single-point cut from the air outlet to all the nodes forms a single-point cut B of the return air shaft.

And 7: combining any set in the single-point cut set A of the air inlet shaft with any set in the single-point cut set B of the air return shaft to obtain a single-point cut set C_k，C_kNamely a scheme for blocking the roadway in the fire period. Period of fire, C_kThe air doors and the plugging air bags of all the roadways in the tunnel are closed to prevent the fire from spreading.

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, which comprises the following steps: set of network vertices

Wherein V is a roadway network node set, and the fire position is a node V₀The single-point cut set is an edge set which is represented as a blocked roadway set in the fire period, and v can be enabled after the edge set is deleted₀The automatic air door and the plugging air bag device are not communicated with the S, namely the fire position is not communicated with other roadways, namely the air door of the roadway where the fire position is located is closed, so that the fire is prevented from spreading, a scientific basis is provided for the emergency fire extinguishing problem of a mine roadway network in the fire 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 not judged to be closed and opened only by depending on experience in the fire period. And meanwhile, a depth exploration algorithm is adopted, all the passages of the mine roadway network are determined, and the missing 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-set algorithm overcomes the defect of being influenced by smoke, solves the problem of incorrect air door regulation and control due to the influence of smoke disturbance in the period of fire,the possibility of increasing the fire spread due to incorrect air door control is reduced. The method provides a scientific, comprehensive and accurate fire extinguishing scheme for the mine fire period, and scientifically indicates which automatic air doors and air bag blocking devices of the roadway net roadways should be closed in the fire period in detail.

Drawings

FIG. 1 is a schematic diagram of a topology relationship of a network according to the present invention;

FIG. 2 is a diagram of a topology relationship of a network of lanes for updating lane numbers according to the present invention;

FIG. 3 is a node cut set diagram according to the present invention.

Detailed Description

In order that the invention may be more clearly understood, the invention is described in further detail with reference to the accompanying drawings.

A method of determining a location of a mine roadway network fire suppression block provided 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 set as e ═ e₁,e₂,...,e_n}，n＝10，V＝{ν₁,ν₂,...,ν_m8, the direct topological relation between the nodes and the roadway can be determined through the graph 1, and the communication of the roadway network can be judged. Step two: determining a set of vertices

As shown in fig. 2 to 3, step three: determining a fire tunnel, and setting a fire position v in the fire tunnel₀I.e. the point of ignition, node v_oDividing the fire tunnel into two tunnels, and numbering the two tunnels as e_o、e'_o。

Step four: solving the v division according to the basic algorithm of the single-point cut set₀Cut sets corresponding to all other nodes except for D ═ D₁,d₂,...,d_m}，d₁＝{e₁}，d₂＝{e₁,e₂,e₃}，d₂＝{e₁,e₂,e₃}，d₃＝{e₀,e₂,e₄}，d₄＝{e₃,e₅,e₇}d₅＝{e₄,e₅,e₆}，d₆＝{e₆,e₇,e₉}，d₇＝{e'₀,e₉,e₁₀}，d₈＝{e₁₀}。

The fifth step: the air inlet is used for searching forwards according to the wind direction, a first node is searched by using a depth-first search algorithm, and then a single-point cut set A of the first node of the air inlet shaft is obtained_1-1＝d₁；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node₂；

Cutting set d of second node₂Single point cut set A with first node_1-1Solving a union set, and then subtracting a cut set d of the second node₂Single point cut set A with first node_1-1The resulting difference, i.e., the edge set, is the single point cut set A from the air inlet to the second node_1-2；

Continuing searching by using a depth-first search algorithm, and when a fire node or an exit point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air inlet to all nodes on the first air passage;

after the first air path is searched, returning to the previous node of the fire node or the exit point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork is searched from the other path until the fire node or the exit point is searched, and finishing the search of the second air path so as to obtain a single-point cut set of all nodes from the air inlet to the second air path;

continuing to retreat and search from fire nodes or outlet points according to the steps until all air paths are searched, and further solving a single-point cut set from the air inlet to all nodes;

and the single-point cutting sets from the air inlet to all the nodes form a single-point cutting set A of the air inlet shaft.

A_1-1＝d₁＝{e₁}；

A_1-2＝(A_1-1∪d₂)-(A_1-1∩d₂)＝{e₂,e₃}；

A_1-2-3＝(A_1-2∪d₃)-(A_1-2∩d₃)＝{e₀,e₃,e₄}

Search for v₀Recede to v₃Then search for v₅

A_1-2-3-5＝(A_1-2-3∪d₅)-(A_1-2-3∩d₅)＝{e₀,e₃,e₅,e₆}；

A_1-2-3-5-6＝(A_1-2-3-5∪d₆)-(A_1-2-3-5∩d₆)＝{e₀,e₃,e₅,e₇,e₉}；

A_1-2-3-5-6-7＝(A_1-2-3-5-6∪d₇)-(A_1-2-3-5-6∩d₇)＝{e₀,e'₀,e₃,e₅,e₇,e₁}

Search for v₈Recede to v₇Continue to go back to v₆，v₅，v₃，v₂Then search for v₄

A_1-2-4＝(A_1-2∪d₄)-(A_1-2∩d₄)＝{e₂,e₅,e₇}；

A_1-2-4-5＝(A_1-2-4∪d₅)-(A_1-2-4∩d₅)＝{e₂,e₄,e₆,e₇}；

A_1-2-4-5-6＝(A_1-2-4-5∪d₆)-(A_1-2-4-5∩d₆)＝{e₂,e₄,e₉}；

A_1-2-4-5-6-7＝(A_1-2-4-5-6∪d₇)-(A_1-2-4-5-6∩d₇)＝{e'₀,e₂,e₄,e₁₀}

Search for v₈Recede to v₇Continue to go back to v₆，v₅，v₄Then search for v₆

A_1-2-4-6＝(A_1-2-4∪d₆)-(A_1-2-4∩d₆)＝{e₂,e₅,e₆,e₉}；

A_1-2-4-6-7＝(A_1-2-4-6∪d₇)-(A_1-2-4-6∩d₇)＝{e'₀,e₂,e₅,e₆,e₁₀}

All the time back to v₄Simultaneously with v₄With two v as starting points₅And v₆V is to be₅And v₆Also includes a near single point cut set, namely A_1-2-4-5-6The content search has been completed before, and the rollback continues to v₂Simultaneously with v₂With two v as starting points₃And v₄V is to be₃And v₄While containing near single point cutsets.

A_1-2-4-3＝(A_1-2-4∪d₃)-(A_1-2-4∩d₃)＝{e₀,e₄,e₅,e₇}

To the end node v₅Searching

A_1-2-4-3-5＝(A_1-2-4-3∪d₅)-(A_1-2-4-3∩d₅)＝{e₀,e₆,e₇}；

A_1-2-4-3-5-6＝(A_1-2-4-3-5∪d₆)-(A_1-2-4-3-5∩d₆)＝{e₀,e₉}；

A_{1-2-4-3-5-6-7}＝(A_1-2-4-3-5-6∪d₇)-(A_1-2-4-3-5-6∩d₇)＝{e₀,e'₀,e₁₀}

Rollback, e.g. no branching node, continues until v is reached₁And finishing the search from the air inlet.

And a sixth step: searching backwards from the air outlet according to the upwind direction, and utilizingAfter the first node is searched by the depth-first search algorithm, the single-point cut set B of the first node of the return air shaft is obtained_8-8＝d₈；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node₇；

Cutting set d of second node₇Single point cut set B with first node_8-8Solving a union set, and then subtracting a cut set d of the second node₇Single point cut set B with first node_8-8The resulting difference, i.e. 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 search algorithm, and when a fire node or an entrance point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air outlet to all nodes on the first air passage;

after the search of the first air path is finished, returning to the previous node of the fire node or the entrance point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork continues to search from the other path until the fire node or the entrance point is searched, and finishing the search of the second air path so as to obtain a single-point cut set from the air outlet to all nodes on the second air path;

continuing to retreat and search from the fire node or the entrance point according to the steps until all air paths are searched, and further solving a single-point cut set from the air outlet to all nodes;

and the single-point cut from the air outlet to all the nodes forms a single-point cut B of the return air shaft.

B_8-8＝d₈＝{e₁₀}；

B_8-7＝(B_8-8∪d₇)-(B_8-8∩d₇)＝{e'₀,e₉}

Search for v₀Recede to v₇Then search for v₆

B_8-7-6＝(B_8-7∪d₆)-(B_8-7∩d₆)＝{e'₀,e₆,e₇}；

B_8-7-6-4＝(B_8-7-6∪d₄)-(B_8-7-6∩d₄)＝{e'₀,e₃,e₅,e₆,}；

B_8-7-6-4-2＝(B_8-7-6-4∪d₂)-(B_8-7-6-4∩d₂)＝{e'₀,e₁,e₂,e₅,e₆,}

Search for v₁Recede to v₂Continue to go back to v₄，v₆Then search for v₅

B_8-7-6-5＝(B_8-7-6∪d₅)-(B_8-7-6∩d₅)＝{e'₀,e₄,e₅,e₇}；

B_8-7-6-5-3＝(B_8-7-6-5∪d₃)-(B_8-7-6-5∩d₃)＝{e'₀,e₀,e₂,e₅,e₇}；

B_8-7-6-5-3-2＝(B_8-7-6-5-3∪d₂)-(B_8-7-6-5-3∩d₂)＝{e'₀,e₀,e₁,e₃,e₅,e₇}

Search for v₁Recede to v₂Continue to go back to v₃，v₅Then search for v₄

B_8-7-6-5-4＝(B_8-7-6-5∪d₄)-(B_8-7-6-5∩d₄)＝{e'₀,e₃,e₄}；

B_8-7-6-5-4-2＝(B_8-7-6-5-4∪d₂)-(B_8-7-6-5-4∩d₂)＝{e'₀,e₁,e₂,e₄}

The seventh step: combining any set in the single-point cut set A of the air inlet shaft with any set in the single-point cut set B of the air return shaft to obtain a single-point cut set C_k，C_kNamely a scheme for blocking the roadway in the period of fire disasterPeriod, C_kAnd the air doors and the plugging air bags of all the roadways are closed and are matched with the roadway with the air doors for control, so that the fire suffocation fire extinguishment can be realized.

Claims (1)

1. A method for determining a fire extinguishing blocking position of a mine roadway network is characterized by comprising the following steps:

step 1: the input roadway network roadway set is e ═ e₁,e₂,...,e_nN is the number of lanes, and the input lane network node set is V ═ V₁,ν₂,...,ν_mDetermining a topological relation of the lane networks and judging connectivity of the lane networks, wherein m is the number of nodes;

step 2: determining set of network vertices

And step 3: determining fire lanes e_i,e_iE is left to e, and a roadway e is determined_iAnd setting the location of the fire to node v_oNode v_oTo fire roadway e_iDividing the tunnel into two tunnels, and numbering the two tunnels as e_o、e'_o；

And 4, step 4: finding the division node v_oCut sets d corresponding to all other nodes except_kThe cut set D ═ D₁,d₂,..,d_k,...,d_mK ∈ {1, 2., m }, said cut-set d_kIs a set of edges, d_kEach element in the group represents an edge, namely a roadway, and one edge is formed by connecting two nodes;

and 5: the air inlet is used for searching forwards according to the wind direction, a first node is searched by using a depth-first search algorithm, and then a single-point cut set A of the first node of the air inlet shaft is obtained_1-1＝d₁；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node₂；

Cutting set d of second node₂Single point cut set A with first node_1-1Union setThen subtracting the cut set d of the second node₂Single point cut set A with first node_1-1The resulting difference, i.e., the edge set, is the single point cut set A from the air inlet to the second node_1-2；

Continuing searching by using a depth-first search algorithm, and when a fire node or an exit point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air inlet to all nodes on the first air passage;

after the first air path is searched, returning to the previous node of the fire node or the exit point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork is searched from the other path until the fire node or the exit point is searched, and finishing the search of the second air path so as to obtain a single-point cut set of all nodes from the air inlet to the second air path;

continuing to retreat and search from fire nodes or outlet points according to the steps until all air paths are searched, and further solving a single-point cut set from the air inlet to all 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 shaft;

step 6: the air outlet searches backwards according to the upwind direction, and after a first node is searched by using a depth-first search algorithm, a single-point cut set B of the first node of the return air shaft is obtained_m-m＝d_m；

Continuing to search by using a depth-first search algorithm to search a second node, namely a known cut set d of the second node_m-1；

Cutting set d of second node_m-1Single point cut set B with first node_m-mSolving a union set, and then subtracting a cut set d of the second node_m-1Single point cut set B with first node_m-mThe resulting difference, i.e. the 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 search algorithm, and when a fire node or an entrance point is searched, finishing searching of the first air passage, and further obtaining a single-point cut set from the air outlet to all nodes on the first air passage;

after the search of the first air path is finished, returning to the previous node of the fire node or the entrance point, if the previous node has a fork, continuing to search from the other path, if the previous node has no fork, continuing to return until the node returning to the fork continues to search from the other path until the fire node or the entrance point is searched, and finishing the search of the second air path so as to obtain a single-point cut set from the air outlet to all nodes on the second air path;

continuing to retreat and search from the fire node or the entrance point according to the steps until all air paths are searched, and further solving a single-point cut set from the air outlet 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;

and 7: combining any set in the single-point cut set A of the air inlet shaft with any set in the single-point cut set B of the air return shaft to obtain a single-point cut set C_k，C_kNamely a scheme for blocking the roadway in the fire period.

Images