CN109035641A - Consider the fire evacuation path dynamic optimization and visual method that flue gas influences - Google Patents

Consider the fire evacuation path dynamic optimization and visual method that flue gas influences Download PDF

Info

Publication number
CN109035641A
CN109035641A CN201810676890.6A CN201810676890A CN109035641A CN 109035641 A CN109035641 A CN 109035641A CN 201810676890 A CN201810676890 A CN 201810676890A CN 109035641 A CN109035641 A CN 109035641A
Authority
CN
China
Prior art keywords
node
fire
channel
evacuation
path
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.)
Granted
Application number
CN201810676890.6A
Other languages
Chinese (zh)
Other versions
CN109035641B (en
Inventor
王彦富
李彪
王静
刘子墨
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing Happy Rabbit Education Technology Co ltd
Original Assignee
China University of Petroleum East China
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China University of Petroleum East China filed Critical China University of Petroleum East China
Priority to CN201810676890.6A priority Critical patent/CN109035641B/en
Publication of CN109035641A publication Critical patent/CN109035641A/en
Application granted granted Critical
Publication of CN109035641B publication Critical patent/CN109035641B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G08SIGNALLING
    • G08BSIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B7/00Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00
    • G08B7/06Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00 using electric transmission, e.g. involving audible and visible signalling through the use of sound and light sources
    • G08B7/066Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00 using electric transmission, e.g. involving audible and visible signalling through the use of sound and light sources guiding along a path, e.g. evacuation path lighting strip
    • GPHYSICS
    • G08SIGNALLING
    • G08BSIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B7/00Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00
    • G08B7/06Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00 using electric transmission, e.g. involving audible and visible signalling through the use of sound and light sources
    • G08B7/062Signalling systems according to more than one of groups G08B3/00 - G08B6/00; Personal calling systems according to more than one of groups G08B3/00 - G08B6/00 using electric transmission, e.g. involving audible and visible signalling through the use of sound and light sources indicating emergency exits

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Business, Economics & Management (AREA)
  • Emergency Management (AREA)
  • Alarm Systems (AREA)
  • Fire Alarms (AREA)
  • Emergency Lowering Means (AREA)

Abstract

The invention discloses a kind of fire evacuation path dynamic optimization that consideration flue gas influences and visual methods comprising receives the fire information that fire detector uploads, determines that position occurs for fire;Space three-dimensional geometric path network when fire do not occur for building is obtained, position is occurred according to fire and is placed obstacles node or obstacle channel, evacuation starting point and evacuation terminal;Fire smoke data and visibility information are obtained, determines fire spread region according to fire smoke data, updates the type of the type and channel that are located at the road-net node in fire spread region;Update the channel equivalent length of the accessible canal in fire spread region;According to updated space three-dimensional geometric path network, the optimal evacuation path of position to be evacuated to each outlet is obtained using dijkstra's algorithm;Optimal evacuation path is sent to command centre and evacuee's mobile terminal, and returns and receives the fire information step that fire detector uploads, until all evacuees successful evacuation.

Description

Consider the fire evacuation path dynamic optimization and visual method that flue gas influences
Technical field
The present invention relates to a kind of evacuating personnel method for obtaining path, more particularly to one kind based on dijkstra's algorithm and to consider The fire evacuation path dynamic optimization and visual method that fire smoke influences.
Background technique
For a long time, fire is always the security of the lives and property for threatening the mankind, therefore after fire occurs for building how Safe and effective evacuation route is selected under the rapid complex environment of fire development, is correct guidance evacuating personnel, reduction personnel The important leverage of injures and deaths.Currently, having many routing resources is suggested and is applied to evacuating personnel, but these evacuation paths Algorithm is mostly static path-finding method, is difficult to cause to dredge according to fire spread situation dynamic adjustment evacuation path when fire occurs The blindness and hysteresis quality of commanding and decision-making are dissipated, but also trapped person possibly can not successfully escape.
Therefore, it needs to consider fire spread situation and fire smoke to fire escape when carrying out evacuation Path selection It influences.
Summary of the invention
For above-mentioned deficiency in the prior art, the technical solution adopted by the present invention is the fire that flue gas influences the considerations of offer Calamity evacuates path dynamic optimization and visual method can be according to fire spread situation dynamic adjustment evacuation path.
In order to achieve the above object of the invention, the technical solution adopted by the present invention are as follows:
The fire evacuation path dynamic optimization and visual method of a kind of consideration flue gas influence are provided comprising:
The fire information that fire detector uploads is received, and determines that position occurs for fire;
Space three-dimensional geometric path network when fire does not occur for building is obtained, and fire generation position is set as hindering Hinder node or obstacle channel, position to be evacuated is set as evacuation starting point, and each outlet port of building is set as evacuation terminal;
The fire smoke data and visibility information of sensor acquisition are obtained, and determine that fire is climing according to fire smoke data Prolong region, updates the class of the type and channel that are located at the road-net node in fire spread region in space three-dimensional geometric path network Type;
Update the channel equivalent length of the accessible canal in fire spread region:
Lij=(kgij×kvij)×lij
Wherein, LijFor channel equivalent length;kgijCoefficient is influenced for ladder access;kvijCoefficient is influenced for smokescope;lijIt is logical Road physical length;
According to updated space three-dimensional geometric path network, position to be evacuated is obtained to each using dijkstra's algorithm The optimal evacuation path of outlet;And
Optimal evacuation path is sent to command centre and evacuee's mobile terminal, and returns to reception fire detector The fire information step of upload, until all evacuees successful evacuation.
Further, the ladder access influences the calculation formula of coefficient are as follows:
Wherein, m is standardized human body's mass;G is acceleration of gravity;v0For the speed of human body proper motion;θijFor inclination angle Degree;P0For the walking ability of the mankind.
Further, the smokescope influences the calculation formula of coefficient are as follows:
kvij=(1+ah+Lr)
Wherein, ahCoefficient is influenced for fire smoke layer height;LrCoefficient is influenced for visibility;
The fire smoke layer height influences the acquisition methods of coefficient are as follows:
As H > 6m, ahIt is 0;As 4m < H≤6m, ahIt is 0.1;As 2m < H≤4m, ahIt is 0.5;As 1.8m < H When≤2m, ahIt is 1;As 1.6m < H≤1.8m, ahIt is 2;As H≤1.6m, ahFor ∞, node or channel impassabitity at this time, H For smoke layer height.
The visibility influences the acquisition methods of coefficient are as follows:
As K > 20m, LrIt is 1;As 10m < K≤20m, LrIt is 1.25;As 5m < K≤10m, LrIt is 2.95;Work as 3m When≤K≤5m, LrIt is 6.25;As K < 3m, LrFor ∞, node or channel impassabitity, K are flue gas visibility at this time.
Further, it is described using dijkstra's algorithm obtain the optimal evacuation path of position to be evacuated to each outlet into One step includes:
S1, the node initialized in the node set S of shortest path are evacuation starting point astart, the not determining shortest path of initialization Node in the node set U of diameter is except astartOuter all nodes;
Node and evacuation starting point a in S2, calculate node set UstartConnect the equivalent length in the channel formed;
S3, choose node set U in evacuation starting point astartThe shortest node of equivalent length for connecting the channel formed adds Ingress set S, and it is deleted from node set U;
The node being newly added in S4, calculate node set S connect the equivalent length in the channel to be formed with the node of node set U Degree;
S5, the shortest node addition of equivalent length for connecting the channel to be formed in node set U with newly added node is chosen Node set S, and it is deleted from node set U, and return step S4, until the node in node set U all adds In ingress set S.
Further, consider the fire evacuation path dynamic optimization and visual method that flue gas influences further include:
Safety needed for being calculated according to the speed of the equivalent distances length in the optimal evacuation path and human normal movement is dredged Dissipate the time;
The required safe escape time and the optimal evacuation path are sent to command centre simultaneously and by evacuation people Member's mobile terminal.
Further, the construction method of the space three-dimensional geometric path network are as follows:
Obtain the evacuating personnel path network of building;According to evacuating personnel path network, using the node-arc section of graph theory Construct the space three-dimensional geometric path network of building;
The road network attribute of the space three-dimensional geometric path network includes nodal community and channel attributes;
Node ViAttribute definition be Vi(t, SVi, Hi, Ki), wherein t is time, SViFor node type, LiAnd KiRespectively For node smoke layer height and visibility;The type of node includes ladder access mouth node, Egress node, security node, risk symptoms node And obstacle nodes;
Channel EijAttribute definition is Eij{ t, SEij, Hij, Kij, Lij, Dij, wherein SEijFor channel type, LijAnd KijPoint It Wei not node ViWith node VjThe smoke layer height and visibility in the channel of formation, LijFor channel EijEquivalent length, DijFor by saving Point ViIt is directed toward node ViOriented evacuation path;The type in channel includes: exit passageway, ladder access, hazardous path and obstacle channel.
It is dynamically cooked up the invention has the benefit that the method that this programme provides can send out sprawling situation according to fire The optimal evacuation path of position to be evacuated to each outlet, and by evacuation route real-time display in evacuation road network, to be stranded Personnel carry out rapid evacuation and commanding carries out evacuation commanding and decision-making.
Detailed description of the invention
Fig. 1 is the flow chart for considering the fire evacuation path dynamic optimization that flue gas influences and visual method.
Fig. 2 be this programme embodiment in building path network and Initial Stage of Fire node to be evacuated to each outlet most Excellent evacuation path profile.
Fig. 3 dredges for node to be evacuated after fire generation 60s update road network in this programme embodiment to the optimal of each outlet Dissipate path profile.
Specific embodiment
A specific embodiment of the invention is described below, in order to facilitate understanding by those skilled in the art this hair It is bright, it should be apparent that the present invention is not limited to the ranges of specific embodiment, for those skilled in the art, As long as various change is in the spirit and scope of the present invention that the attached claims limit and determine, these variations are aobvious and easy See, all are using the innovation and creation of present inventive concept in the column of protection.
The process for considering the fire evacuation path dynamic optimization that flue gas influences and visual method is shown with reference to Fig. 1, Fig. 1 Figure, as shown in Figure 1, this method 100 includes step 101 to step 106.
In a step 101, the fire information that fire detector uploads is received, and determines that position occurs for fire.In the present invention One embodiment in, temperature sensor, smoke-detecting sensor, infrared emission photoelectric sensor, ultraviolet flame can be passed through One or more modes such as sensor, video system obtain fire location, can also acquire fire or fire and smoke spread region in real time, lead to Road or the fire informations such as node smoke layer height and visibility, and data are transmitted at data by wired or wireless mode Manage module.
In a step 102, space three-dimensional geometric path network when fire does not occur for building is obtained, and fire is occurred Position is set as obstacle nodes or obstacle channel, and position to be evacuated is set as evacuation starting point, and each outlet port of building is set It is set to evacuation terminal.
With reference to Fig. 2, it is assumed that Fig. 2 interior joint 14 is that position occurs for fire, sets obstacle nodes or channel for node 14, will Position to be evacuated where node 11 is set as starting point astart, set each outlet port (such as node 73,82,83) to The terminal a of dijkstra's algorithmend
In one embodiment of the invention, the construction method of the space three-dimensional geometric path network are as follows:
Obtain the evacuating personnel path network of building;According to evacuating personnel path network, using the node-arc section of graph theory Construct the space three-dimensional geometric path network of building;
The road network attribute of the space three-dimensional geometric path network includes nodal community and channel attributes;
Node ViAttribute definition be Vi(t, SVi, Hi, Ki), wherein t is time, SViFor node type, HiAnd KiRespectively For node smoke layer height and visibility;The type of node includes ladder access mouth node (square nodes), Egress node (hexagon section Point), security node (circular node), risk symptoms node (round shaded nodes) and obstacle nodes (triangular nodes).
Security node is the node that can not had free passage by influence of fire, and personnel can pass through safely;Risk symptoms node is Node in fire spread region, but the fire threat being subject to is smaller, and personnel can still pass through;Obstacle nodes indicate on fire The node that point, fire spreading region can not be walked.Node type can change with fire development, when security node, ladder access section When fire detector monitors that smoke layer height is less than 6m or flue gas visibility less than 20m at point, Egress node, node type becomes For risk symptoms node.When fire detector monitors that smoke layer height or flue gas visibility reach critical value or fire spread to node When place, node type becomes obstacle nodes from risk symptoms node.
Channel EijAttribute definition is Eij{ t, SEij, Hij, Kij, Lij, Dij, wherein SEijFor channel type, HijAnd KijPoint It Wei not node ViWith node VjBetween channel EijThe smoke layer height and visibility at place, LijFor channel EijEquivalent length, DijIt serves as reasons Node ViIt is directed toward node ViOriented evacuation path;The type in channel includes: exit passageway (fine line), ladder access (double solid line), danger Channel (heavy line) and obstacle channel (dotted line).
Exit passageway refers to the not channel by influence of fire;Hazardous path refers to fire spread region still accessible canal;Barrier Channel is hindered to refer to the impassable channel in fire spread region, channel type can change with fire development, when exit passageway, ladder access When place's fire detector monitors that smoke layer height is less than 6m or flue gas visibility less than 20m, channel type becomes hazardous path. When fire detector monitors smoke layer height or flue gas visibility reaches at critical value or fire spread to channel, channel class Type becomes obstacle channel from hazardous path.
If node ViWith node VjIt is not attached to, node ViWith node VjConnected but ViOr VjFor obstacle nodes, node ViWith section Point VjConnected but channel EijFor obstacle channel, then channel EijEquivalent length is ∞.
In step 103, the fire smoke data and visibility information for obtaining detector acquisition, update space three-dimensional geometry It is located at the type of the road-net node in fire spread region and the type (Fig. 3 is updated to by Fig. 2) in channel in path network, with real-time Show that fire smoke spreads region, fire smoke spreads region by hazardous path, risk symptoms node, obstacle channel, obstacle nodes table Show.
At step 104, the channel equivalent length of the accessible canal in fire spread region is updated:
Lij=(kgij×kvij)×lij
Wherein, LijFor channel equivalent length;kgijCoefficient is influenced for ladder access;kvijCoefficient is influenced for smokescope;lijIt is logical Road physical length.
When implementation, the preferred ladder access of this programme influences the calculation formula of coefficient are as follows:
Wherein, m is standardized human body's mass (by taking adult man as an example, enabling m=80kg), unit kg;G is gravity acceleration Degree, unit m/s2;v0(by taking adult man as an example, v is enabled for the speed of human body proper motion0=1.25m/s), unit m/s; θijFor tilt angle;P0For the walking ability W (by taking adult man as an example, enabling P=200W) of the mankind, unit W.
The calculation formula of smokescope influence coefficient are as follows:
kvij=(1+ah+Lr)
Wherein, ahCoefficient is influenced for fire smoke layer height;LrCoefficient is influenced for visibility;
The acquisition methods of fire smoke layer height influence coefficient are as follows:
As H > 6m, ahIt is 0;As 4m < H≤6m, ahIt is 0.1;As 2m < H≤4m, ahIt is 0.5;As 1.8m < H When≤2m, ahIt is 1;As 1.6m < H≤1.8m, ahIt is 2;As H≤1.6m, ahFor ∞, node or channel impassabitity at this time.
The visibility influences the acquisition methods of coefficient are as follows:
As K > 20m, LrIt is 1;As 10m < K≤20m, LrIt is 1.25;As 5m < K≤10m, LrIt is 2.95;Work as 3m When≤K≤5m, LrIt is 6.25;As K < 3m, LrFor ∞, node or channel impassabitity at this time.
In step 105, according to updated space three-dimensional geometric path network (occur fire 60s after, the space of Fig. 2 After three-dimensional geometry path network updates, the type of each node and each channel type and node to be evacuated to each outlet it is optimal It is as shown in Figure 3 to evacuate path), the optimal evacuation path of position to be evacuated to each outlet is obtained using dijkstra's algorithm.
In one embodiment of the invention, described that position to be evacuated is obtained to each outlet using dijkstra's algorithm Optimal evacuation path further comprises:
S1, S1, the node initialized in the node set S of shortest path are evacuation starting point astart, initialize and do not determine most Node in the node set U of short path is except astartOuter all nodes;
Node and evacuation starting point a in S2, calculate node set UstartConnect the equivalent length in the channel formed;
S3, choose node set U in evacuation starting point astartThe shortest node of equivalent length for connecting the channel formed adds Ingress set S, and it is deleted from node set U;
The node being newly added in S4, calculate node set S connect the equivalent length in the channel to be formed with the node of node set U Degree;
S5, the shortest node addition of equivalent length for connecting the channel to be formed in node set U with newly added node is chosen Node set S, and it is deleted from node set U, and return step S4, until the node in node set U all adds In ingress set S.
In step 106, optimal evacuation path is sent to command centre and evacuee's mobile terminal, and returns to step Rapid 101, until all evacuees successful evacuation.
Since optimal evacuation path generally there are several, in order to preferably help evacuee's rapid evacuation, flue gas is considered The fire evacuation path dynamic optimization and visual method of influence further include: according to the equivalent distances length in the optimal evacuation path The safe escape time needed for being calculated with the speed of human normal movement;Safe escape time needed for will be described and the optimal evacuation Path is sent to command centre and evacuee's mobile terminal simultaneously.
After command centre and evacuee's mobile terminal receive required safe escape time and optimal evacuation path, dredged It dissipating personnel selection one outlet or commanding and specifies one outlet as emergency exit for it, this is exported to number of evacuation+1, Outlet refers to the number for selecting the outlet as emergency exit, every one people of successful evacuation, to number of evacuation -1 to number of evacuation.
Space three-dimensional geometric path network real-time display respectively node 11 to be evacuated to each outlet optimal evacuation path (Fig. 2, Directed walk in Fig. 3), while being sequentially listed according to equivalent distances length and calculating the required safe escape time, wherein optimal Evacuate path and required safe escape time reference table 1.
Table 1
In conclusion influence of the fire to evacuation road network can be considered in real time using the method that this programme provides, according to working as Preceding fire spread situation Dynamic Programming goes out the optimal evacuation path of position to be evacuated to each outlet, and shows in real time in road network Show, evacuates commanding and decision-making convenient for commanding and personnel to be evacuated smoothly evacuate.

Claims (6)

1. considering the fire evacuation path dynamic optimization and visual method that flue gas influences characterized by comprising
The fire information that fire detector uploads is received, and determines that position occurs for fire;
Space three-dimensional geometric path network when fire does not occur for building is obtained, and sets obstacle section for fire generation position Point or obstacle channel, position to be evacuated are set as evacuation starting point, and each outlet port of building is set as evacuation terminal;
The fire smoke data and visibility information of sensor acquisition are obtained, and determine fire spread area according to fire smoke data Domain updates the type of the type and channel that are located at the road-net node in fire spread region in space three-dimensional geometric path network;
Update the channel equivalent length of the accessible canal in fire spread region:
Lij=(kgij×kvij)×lij
Wherein, LijFor channel equivalent length;kgijCoefficient is influenced for ladder access;kvijCoefficient is influenced for smokescope;lijFor channel reality Border length;
According to updated space three-dimensional geometric path network, position to be evacuated is obtained to each outlet using dijkstra's algorithm Optimal evacuation path;And
Optimal evacuation path is sent to command centre and evacuee's mobile terminal, and returns and receives fire detector upload Fire information step, until all evacuees successful evacuation.
2. the fire evacuation path dynamic optimization and visual method according to claim 1 for considering that flue gas influences, feature It is, the ladder access influences the calculation formula of coefficient are as follows:
Wherein, m is standardized human body's mass;G is acceleration of gravity;v0For the speed of human body proper motion;θijFor tilt angle;P0 For the walking ability of the mankind.
3. the fire evacuation path dynamic optimization and visual method according to claim 1 or 2 for considering that flue gas influences, special Sign is that the smokescope influences the calculation formula of coefficient are as follows:
kvij=(1+ah+lr)
Wherein, ahCoefficient is influenced for fire smoke layer height;lrCoefficient is influenced for visibility;
The fire smoke layer height influences the acquisition methods of coefficient are as follows:
As H > 6m, ahIt is 0;As 4m < H≤6m, ahIt is 0.1;As 2m < H≤4m, ahIt is 0.5;As 1.8m < H≤2m When, ahIt is 1;As 1.6m < H≤1.8m, ahIt is 2;As H≤1.6m, ahFor ∞, node or channel impassabitity, H are cigarette at this time Gas-bearing formation height;
The visibility influences the acquisition methods of coefficient are as follows:
As K > 20m, LrIt is 1;As 10m < K≤20m, LrIt is 1.25;As 5m < K≤10m, LrIt is 2.95;As 3m≤K When≤5m, LrIt is 6.25;As K < 3m, LrFor ∞, node or channel impassabitity, K are flue gas visibility at this time.
4. the fire evacuation path dynamic optimization and visual method according to claim 1 for considering that flue gas influences, feature It is, the optimal evacuation path for obtaining position to be evacuated to each outlet using dijkstra's algorithm further comprises:
S1, the node initialized in the node set S of shortest path are evacuation starting point astart, the not determining shortest path of initialization Node in node set U is except astartOuter all nodes;
Node and evacuation starting point a in S2, calculate node set UstartConnect the equivalent length in the channel formed;
S3, choose node set U in evacuation starting point astartSection is added in the shortest node of equivalent length for connecting the channel formed Point set S, and it is deleted from node set U;
The node being newly added in S4, calculate node set S connect the equivalent length in the channel to be formed with the node of node set U;
S5, the shortest node addition node of equivalent length for connecting the channel to be formed in node set U with newly added node is chosen Set S, and it is deleted from node set U, and return step S4, until section is all added in the node in node set U In point set S.
5. the fire evacuation path dynamic optimization and visual method according to claim 1 or 4 for considering that flue gas influences, special Sign is, further includes:
When safe escape needed for being calculated according to the speed of the equivalent distances length in the optimal evacuation path and human normal movement Between;
The required safe escape time and the optimal evacuation path are sent to command centre simultaneously and evacuee moves Dynamic terminal.
6. the fire evacuation path dynamic optimization and visual method according to claim 1 for considering that flue gas influences, feature It is, the construction method of the space three-dimensional geometric path network are as follows:
Obtain the evacuating personnel path network of building;According to evacuating personnel path network, constructed using the node-arc section of graph theory The space three-dimensional geometric path network of building;
The road network attribute of the space three-dimensional geometric path network includes nodal community and channel attributes;
Node ViAttribute definition be Vi(t, SVi, Hi, Ki), wherein t is time, SViFor node type, LiAnd KiRespectively node Smoke layer height and visibility at i;The type of node includes ladder access mouth node, Egress node, security node, risk symptoms node and barrier Hinder node;
Channel EijAttribute definition is Eij{ t, SEij, Hij, Kij, Lij, Dij, wherein SEijFor channel type, LijAnd KijRespectively save Point ViWith node VjBetween channel EijThe smoke layer height and visibility at place, LijFor channel EijEquivalent length, DijFor by node Vi It is directed toward node ViOriented evacuation path;The type in channel includes: exit passageway, ladder access, hazardous path and obstacle channel.
CN201810676890.6A 2018-06-27 2018-06-27 Dynamic optimization and visualization method for fire evacuation path considering smoke influence Expired - Fee Related CN109035641B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810676890.6A CN109035641B (en) 2018-06-27 2018-06-27 Dynamic optimization and visualization method for fire evacuation path considering smoke influence

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810676890.6A CN109035641B (en) 2018-06-27 2018-06-27 Dynamic optimization and visualization method for fire evacuation path considering smoke influence

Publications (2)

Publication Number Publication Date
CN109035641A true CN109035641A (en) 2018-12-18
CN109035641B CN109035641B (en) 2020-04-14

Family

ID=64611048

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810676890.6A Expired - Fee Related CN109035641B (en) 2018-06-27 2018-06-27 Dynamic optimization and visualization method for fire evacuation path considering smoke influence

Country Status (1)

Country Link
CN (1) CN109035641B (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110083113A (en) * 2019-03-30 2019-08-02 天津大学 Fire evacuation system and method based on computer vision and heuristic search algorithm
CN110533232A (en) * 2019-08-15 2019-12-03 哈尔滨工程大学 A method of calculating the most short evacuation path of passenger boat personnel
CN113701757A (en) * 2021-08-04 2021-11-26 江西省科院科技园发展有限公司 Indoor navigation system and method for fire fighting and emergency
CN114255555A (en) * 2020-09-23 2022-03-29 深圳富桂精密工业有限公司 Fire escape guiding method, server and storage medium
CN116884167A (en) * 2023-09-08 2023-10-13 山东舒尔智能工程有限公司 Intelligent fire control video monitoring and alarm linkage control system

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103394171A (en) * 2013-08-02 2013-11-20 重庆大学 Large high-rise building indoor fire urgent evacuation indication escape method and system
CN103830855A (en) * 2014-03-17 2014-06-04 中国科学技术大学 Dynamic firefighting emergency evacuation indicating system for large-scale public building
CN104331750A (en) * 2014-10-30 2015-02-04 国网上海市电力公司 Optimal escape route acquisition method based on Dijkstra algorithm
JP2016035765A (en) * 2015-10-14 2016-03-17 株式会社ティーエヌケー Evacuation guiding system
CN107438030A (en) * 2016-05-27 2017-12-05 邻元科技(北京)有限公司 A kind of method, system and device of path optimization
CN108171373A (en) * 2017-12-26 2018-06-15 杭州电子科技大学 A kind of chemical industrial park poison gas reveals best-effort path planing method

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103394171A (en) * 2013-08-02 2013-11-20 重庆大学 Large high-rise building indoor fire urgent evacuation indication escape method and system
CN103830855A (en) * 2014-03-17 2014-06-04 中国科学技术大学 Dynamic firefighting emergency evacuation indicating system for large-scale public building
CN104331750A (en) * 2014-10-30 2015-02-04 国网上海市电力公司 Optimal escape route acquisition method based on Dijkstra algorithm
JP2016035765A (en) * 2015-10-14 2016-03-17 株式会社ティーエヌケー Evacuation guiding system
CN107438030A (en) * 2016-05-27 2017-12-05 邻元科技(北京)有限公司 A kind of method, system and device of path optimization
CN108171373A (en) * 2017-12-26 2018-06-15 杭州电子科技大学 A kind of chemical industrial park poison gas reveals best-effort path planing method

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
梅志斌: "建筑物火灾中人员疏散路径优化自适应蚁群算法", 《沈阳建筑大学学报(自然科学版)》 *

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110083113A (en) * 2019-03-30 2019-08-02 天津大学 Fire evacuation system and method based on computer vision and heuristic search algorithm
CN110533232A (en) * 2019-08-15 2019-12-03 哈尔滨工程大学 A method of calculating the most short evacuation path of passenger boat personnel
CN114255555A (en) * 2020-09-23 2022-03-29 深圳富桂精密工业有限公司 Fire escape guiding method, server and storage medium
CN113701757A (en) * 2021-08-04 2021-11-26 江西省科院科技园发展有限公司 Indoor navigation system and method for fire fighting and emergency
CN113701757B (en) * 2021-08-04 2024-05-28 江西省产业技术研究院 Indoor navigation system and method for fire emergency
CN116884167A (en) * 2023-09-08 2023-10-13 山东舒尔智能工程有限公司 Intelligent fire control video monitoring and alarm linkage control system
CN116884167B (en) * 2023-09-08 2023-12-05 山东舒尔智能工程有限公司 Intelligent fire control video monitoring and alarm linkage control system

Also Published As

Publication number Publication date
CN109035641B (en) 2020-04-14

Similar Documents

Publication Publication Date Title
CN109035641A (en) Consider the fire evacuation path dynamic optimization and visual method that flue gas influences
CN112327914B (en) Indoor collaborative path planning method and system for high-rise fire-fighting multiple unmanned aerial vehicles
Jiang Mobile fire evacuation system for large public buildings based on artificial intelligence and IoT
Pu et al. Evacuation route calculation of inner buildings
US20100057354A1 (en) Method of Route Retrieval
KR101835434B1 (en) Method and Apparatus for generating a protection image, Method for mapping between image pixel and depth value
CN108710976B (en) Dynamic escape route generation method, server and system
EP2736027B1 (en) Method and system for evacuation support
KR101840560B1 (en) System and method for providing 3-dimension path upon fire occurrence
US11127282B2 (en) Contextualized augmented reality display system
WO2016073292A1 (en) Dynamic acquisition terminal for behavior statistic information of people, evacuation system and method
KR101706664B1 (en) Terminal and Exit course guide system using that terminal and method thereof
KR101796385B1 (en) System and method for providing optimal path upon fire occurrence
KR101895569B1 (en) Smart evacuation guide system and method using virtual reality and context awareness algorithm
WO2016037308A1 (en) Intelligent disaster prevention and escape method and disaster prevention and escape system thereof
KR101917215B1 (en) Disaster preparedness guide method, and recording medium storing program for executing the same, and recording medium storing program for executing the same
KR20210096392A (en) intelligent evacuation guidance simulation system for disaster situation
KR101766747B1 (en) Method For Displaying Screen of Terminal and Exit course
CN110110389A (en) A kind of indoor and outdoor evacuation emulation method that actual situation combines
EP3062297A1 (en) Emergency guidance system and method
Khan et al. An IoT based intelligent fire evacuation system
CN107438030A (en) A kind of method, system and device of path optimization
KR100791365B1 (en) Acquiring method of shortest path of emergency evacuation system
KR20210080145A (en) Intelligent apparatus for dealing with fire and application of mobile terminal therewith
WO2023205337A1 (en) System for real time simultaneous user localization and structure mapping

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
TR01 Transfer of patent right

Effective date of registration: 20220107

Address after: No. 302, Zhongyang Road, Xuanwu District, Nanjing, Jiangsu 210008

Patentee after: Nanjing happy rabbit Education Technology Co.,Ltd.

Address before: 266580 No. 66 Changjiang West Road, Huangdao District, Qingdao, Shandong.

Patentee before: CHINA University OF PETROLEUM (EAST CHINA)

TR01 Transfer of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20200414

CF01 Termination of patent right due to non-payment of annual fee