WO2016037308A1 - 智能型防灾逃生方法及其防灾逃生系统 - Google Patents

智能型防灾逃生方法及其防灾逃生系统 Download PDF

Info

Publication number
WO2016037308A1
WO2016037308A1 PCT/CN2014/086099 CN2014086099W WO2016037308A1 WO 2016037308 A1 WO2016037308 A1 WO 2016037308A1 CN 2014086099 W CN2014086099 W CN 2014086099W WO 2016037308 A1 WO2016037308 A1 WO 2016037308A1
Authority
WO
WIPO (PCT)
Prior art keywords
node
nodes
escape
disaster prevention
coefficient
Prior art date
Application number
PCT/CN2014/086099
Other languages
English (en)
French (fr)
Inventor
陈硕鸿
林筱玫
吴致颖
Original Assignee
陈硕鸿
林筱玫
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 陈硕鸿, 林筱玫 filed Critical 陈硕鸿
Priority to JP2017514564A priority Critical patent/JP6569964B2/ja
Priority to US15/509,862 priority patent/US10322302B2/en
Priority to EP14901524.0A priority patent/EP3192567A4/en
Priority to SG11201701864XA priority patent/SG11201701864XA/en
Priority to CN201480081845.6A priority patent/CN106999739B/zh
Priority to PCT/CN2014/086099 priority patent/WO2016037308A1/zh
Priority to TW104129849A priority patent/TWI567697B/zh
Priority to TW104129848A priority patent/TWI567696B/zh
Publication of WO2016037308A1 publication Critical patent/WO2016037308A1/zh

Links

Images

Classifications

    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B7/00—Signalling 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/06—Signalling 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/066—Signalling 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
    • A—HUMAN NECESSITIES
    • A62—LIFE-SAVING; FIRE-FIGHTING
    • A62B—DEVICES, APPARATUS OR METHODS FOR LIFE-SAVING
    • A62B3/00—Devices or single parts for facilitating escape from buildings or the like, e.g. protection shields, protection screens; Portable devices for preventing smoke penetrating into distinct parts of buildings
    • G—PHYSICS
    • G01—MEASURING; TESTING
    • G01C—MEASURING DISTANCES, LEVELS OR BEARINGS; SURVEYING; NAVIGATION; GYROSCOPIC INSTRUMENTS; PHOTOGRAMMETRY OR VIDEOGRAMMETRY
    • G01C21/00—Navigation; Navigational instruments not provided for in groups G01C1/00 - G01C19/00
    • G01C21/20—Instruments for performing navigational calculations
    • G01C21/206—Instruments for performing navigational calculations specially adapted for indoor navigation
    • G—PHYSICS
    • G08—SIGNALLING
    • G08B—SIGNALLING OR CALLING SYSTEMS; ORDER TELEGRAPHS; ALARM SYSTEMS
    • G08B17/00—Fire alarms; Alarms responsive to explosion

Definitions

  • the invention relates to an intelligent disaster prevention and escape method, in particular to an intelligent disaster prevention and escape method capable of generating a safe route planning according to a risk coefficient and a distance between adjacent nodes to provide real-time escape indication and an intelligent type thereof Disaster prevention and escape system.
  • the traditional escape sign does not guarantee that a safe and reliable escape route is indicated to facilitate evacuation and escape of people in the floor, and it is impossible to select an effective path with the best security in real time.
  • one of the objects of the present invention is to provide an intelligent disaster prevention and escape method capable of generating a safest path plan according to a risk coefficient and a distance between adjacent nodes to provide a real-time escape indication. And its intelligent disaster prevention and escape system to quickly guide personnel to escape and evacuate.
  • the present invention provides an intelligent disaster prevention and escape method, the method comprising the steps of: respectively sensing environmental information of a surrounding environment of a plurality of nodes of a region of a building to respectively generate multiple transmissions of the plurality of nodes Sense signal; calculating a risk coefficient of each node according to the plurality of sensing signals respectively; calculating a threat coefficient of the multiple paths according to the plurality of risk factors and a distance between the plurality of adjacent nodes, respectively, for performing a
  • the escape path planning calculus generates a safest path plan; and the plurality of escape indications of the plurality of nodes are respectively generated according to the safest path plan.
  • the escape route planning calculus is used to respectively treat each of the plurality of nodes as the starting point to form the safest path plan, wherein an escape direction is in the multiple nodes.
  • a node reaches the direction of the precursor node of the minimum threat coefficient.
  • the intelligent disaster prevention and escape method as described above wherein a threat coefficient of a plurality of paths is calculated according to the risk coefficient and a distance between a plurality of adjacent nodes to perform the escape route planning calculation and generate the safest path
  • the planning step is further used to: add an exit node of a second area to the area to calculate the safest path plan.
  • the invention further provides an intelligent disaster prevention and escape system, comprising multiple sensors and multiple escape parties To the pointing device and the processing unit.
  • the plurality of sensors are respectively disposed at each node of an area of a building, and are respectively used to sense environmental information of the surrounding environment of the plurality of nodes to respectively generate a plurality of sensing signals of the plurality of nodes;
  • the plurality of escape direction indicating devices are respectively disposed in the plurality of nodes of the area of the building, for respectively generating a plurality of escape indications of the plurality of nodes according to a safest path plan; and the processing unit is coupled to the plurality of The sensor and the plurality of escape direction indicating devices are configured to calculate a plurality of risk coefficients of the plurality of nodes according to the plurality of sensing signals respectively; and the processing unit respectively according to the plurality of risk factors and the plurality of adjacent nodes The distance between the multiple factors is used to calculate a threat coefficient for multiple paths to perform an escape path planning calculus and generate the safest
  • the processing unit calculates the minimum threat coefficient, update the record of the minimum threat coefficient of the path through the third node; repeatedly join the new node, and calculate the minimum threat coefficient of the new node to any of the precursor nodes until the region All nodes are selected to join.
  • the escape route planning algorithm is used to sequentially treat each of the plurality of nodes as the starting point to form the safest path plan, where an escape direction is the multiple nodes. A node in the direction reaches the direction of the precursor node of the minimum threat coefficient.
  • the intelligent disaster prevention and escape system as described above, wherein the threat coefficient is a product of the risk factor and the distance.
  • processing unit is further configured to add an exit node of a second area to the area to calculate the safest path plan.
  • the present invention has an advantageous effect that the present invention provides a safe and reliable real-time escape finger that can generate a safest path plan according to a risk factor and a distance between adjacent nodes.
  • the intelligent disaster prevention and escape method and its intelligent disaster prevention and escape system are used to quickly guide personnel to escape and evacuate to reduce the casualties that may occur when a disaster occurs.
  • FIG. 1 is a schematic diagram of an embodiment of an intelligent disaster prevention and escape system according to the present invention.
  • FIG. 2 is a schematic illustration of an embodiment of a plurality of nodes of a first region of a building of the present invention.
  • FIG. 3 is a schematic diagram of an embodiment of calculating a escape route planning calculus according to the present invention.
  • FIG. 4 is a schematic diagram of an embodiment of a plurality of nodes of a first region and a second region of a building of the present invention.
  • FIG. 5 is a schematic diagram of an embodiment of the present invention for adding an exit node of a second area to the first area to calculate the escape path planning calculation.
  • FIG. 6 is a flowchart of an operation example of an intelligent disaster prevention and escape method according to the present invention.
  • FIG. 7 is a flow chart showing an example of the operation of the detailed steps of step S630 of FIG. 6.
  • FIG. 1 is a schematic diagram of an embodiment of an intelligent disaster prevention and escape system 100 according to the present invention.
  • the intelligent disaster prevention and escape system 100 includes, but is not limited to, a plurality of sensors (eg, i sensors) S1 to Si, and multiple escape direction indicating devices (eg, j escape direction indicating devices).
  • DP1 to DPj and a processing unit 130.
  • a plurality of sensors S1 to Si are respectively disposed at each node of a region of a building for sensing environmental information of the surrounding environment of the plurality of nodes (for example, k nodes) N1 to Nk.
  • the plurality of sensors S1 to Si can sense temperature, smoke, flame, carbon monoxide concentration, and carbon dioxide concentration in the surrounding environment. Or any other hazardous gas to emit a plurality of sensing signals SS1 to SSi, but this is merely an example and is not a limitation of the present invention.
  • the plurality of escape direction indicating devices DP1 to DPj are respectively disposed in the plurality of nodes N1 to Nk in the area of the building, and are configured to respectively generate multiple escapes of the plurality of nodes N1 to Nk according to a safest path plan. Indicates DS1 to DSj.
  • the processing unit 130 is coupled to the plurality of sensors S1 to Si and the plurality of escape direction indicating devices DP1 to DPj for calculating the plurality of nodes N1 to Nk according to the plurality of sensing signals SS1 to SSi, respectively. Multiple risk factors RC1 ⁇ RCk. It should be noted that the processing unit 130 may receive the plurality of sensing signals SS1 SSS sensed by the plurality of sensors S1 to Si by using a wireless or wired manner, but this is only one of the embodiments of the present invention. It is not a limitation of the invention.
  • the processing unit 130 performs an escape path planning calculation according to the plurality of risk factors RC1 RC RCk and a distance D1 DDh between the plurality of adjacent nodes to generate the safe path planning, for example, the processing unit
  • the minimum threat coefficient may be generated by using the distances D1 to Dh between the plurality of adjacent nodes as the weights of the plurality of risk factors RC1 to RCk, respectively.
  • the processing unit 130 may be implemented by using a server or a computer, but the present invention is not limited thereto.
  • the distances D1 to Dh between the plurality of adjacent nodes may be built in the server or the computer, but this is not a limitation of the present invention.
  • FIG. 2 is a schematic diagram of an embodiment of a plurality of nodes in a first area of a building of the present invention.
  • the first area includes five nodes N1 to N5, wherein the node N1 and the node N3 are respectively egress nodes, and a plurality of sensors S1 to S5 are disposed on the five nodes N1 to N5.
  • Multiple sensors on each node can be used to sense ambient temperature, smoke, flame, carbon monoxide, carbon dioxide, infrared, and other environmental information in the surrounding environment to generate a plurality of sensing signals SS1 SS SS5, for example
  • the processing unit 130 may perform positive planning on the temperature, the smoke concentration, the carbon monoxide concentration, the carbon dioxide concentration, or the infrared flame sensor in the sensing signals SS1 SSSS, respectively. The calculation is performed, and then the risk factors RC1 to RC5 are calculated.
  • the distance D between all adjacent nodes is set to 1, so that the minimum threat coefficient on each node is the risk coefficient.
  • the value (weight is 1), but this is not a limitation of the present invention.
  • the fire point is located at the boundary between the node N1 and the node N4. Therefore, the plurality of sensors S1 and S4 on the node N1 and the node N4 detect an abnormal state. Therefore, the processing unit 130 calculates the nodes N1 to N5 respectively.
  • the risk factors RC1 to RC5 are node N1 (125000), node N2 (0), node N3 (15625), node N4 (125000), and node N5 (0), respectively.
  • FIG. 3 is a schematic diagram of calculating the escape path planning calculus according to the present invention.
  • the processing unit 130 considers a first node (egress node N1) of the plurality of nodes as a point together, and at this time, the node N1 to the node N1 (N1->N1) has the smallest threat.
  • the coefficient is 125000 and the precursor node is updated to N1->N1;
  • step a2 in a plurality of second nodes (nodes N2, N3, N4, N5) connected to the first node (node N1) and not yet selected, selecting to join a specific second node having a minimum threat coefficient (node N2), the minimum threat coefficient of node N1 to node N1 (N1->N1) is 125000, and the minimum threat coefficient of node N2 to node N1 (N2->N1) is 125000 and the precursor node is updated to N1- >N1 and N2->N1;
  • step a3 a third node (node N3) of the area is added to update the minimum threat coefficient reaching the first node (node N1) and the second node (node N2) respectively, and the node N3 is
  • step a5 Add a new node N5 in step a5.
  • step a6 the minimum threat coefficients of the nodes N1, N2, N3, N4 and N5 to the exit node N1 are: 125000, 125000, 140625, 250,000 and 250,000, respectively.
  • the escape route planning calculation is used to sequentially treat each of the plurality of nodes (for example, the exit node N3) as the starting point.
  • the processing unit 130 calculates the minimum threat coefficient
  • the record of the minimum threat coefficient is updated; for example, in step c1, the node N3 is taken as a joint point, and the node N3 to the node N3 (N3-> N3)
  • the minimum threat coefficient is 15625.
  • the minimum threat coefficient from the original node N3 to the node N1 (N3->N1) is 140625, so the record of updating the minimum threat coefficient is 15625 and the precursor node is updated to N1->N1, N2- >N1, N3->N3, N4->N2 and N5->N4.
  • step c2 in a plurality of second nodes (nodes N1, N2, N4, N5) connected to the first node (node N3) and not yet selected, selecting to join a specific second node having a minimum threat coefficient (node N2), the minimum threat coefficient of node N3 to node N3 (N3->N3) is 15625, and the minimum threat coefficient of node N2 to node N3 (N2->N3) is 15625 compared with the original node N2 to node N1.
  • the minimum threat coefficient of (N2->N1) is 125000, so the record of updating the minimum threat coefficient is 15625 and the precursor node is updated to N1->N1, N2->N3,N3->N3,N4->N2,N5 -> N4;
  • steps c3 to c6 are similar to the above steps, and those skilled in the art should be able to understand the operation principle of steps C3 to C6 from the above description, and will not be described here for the sake of brevity.
  • the minimum threat coefficients of the nodes N1, N2, N3, N4 and N5 to the exit node N1 are: 125000, 15626, 15625, 140625 and 140625, respectively.
  • the minimum threat coefficient of the node N2 to the exit node N3 is 15625, which is smaller than the minimum threat coefficient 125000 of the node N2 to the exit node N1; That is, one of the plurality of nodes reaches the direction of the precursor node of the minimum threat coefficient. Therefore, when the node is at the node N2, it is safer to escape to the node N3 (compared to the node N2 to the node N1), therefore,
  • the processing unit 130 controls the indicator light DP2 on the node N2 to guide the direction of the outlet N3.
  • FIG. 4 is a schematic diagram of an embodiment of a plurality of nodes N1 to N6 of a first area and a second area of a building according to the present invention.
  • an exit node N6 of the second area is at a distance of 2 from the node N5 of the first area, and the egress node N6 is a remote egress node.
  • FIG. 5 is used to add an exit node of a second area.
  • the processing unit 130 is configured to add an egress node N6 of a second area to the first area to calculate the most secure path plan, and in the steps f1 to f7, the egress node N3 is used as the Starting point to form the safest path plan, because the principles of steps f1 to f7 are similar to the above steps, and those skilled in the art should be able to understand the operation principle of steps f1 to f7 from the above description, and for the sake of brevity, no longer Narration.
  • the distance between an exit node N6 of the second area and the node N5 of the first area is 2, so in computing node N5 to node N6 (N5->N6) or node N6 to node N5 (N6-> In the case of N5), the weight is 2.
  • node N5 is added.
  • Step f7 confirms that the minimum threat coefficients of nodes N1, N2, N3, N4, N5, and N6 to the exit node N6 are: 125000, 15626, 15625, 140625, 31250, and 15625, respectively.
  • the minimum threat coefficient from node N5 to the egress node N6 is 15625, which is smaller than the minimum threat coefficient 250000 and node N5 from the node N5 to the egress node N1.
  • the minimum threat coefficient 140625 of the exit node N3 is even smaller. That is, when the person is at the node N5, it is safer to escape to the remote exit node N6 of the second area (because the threat coefficient value is the smallest), therefore, the processing unit 130 controls the indicator light DP5 on the node N5. The remote exit node N6 of the second area is guided in the direction.
  • the escape route planning calculus may also use the known shortest distance of the plurality of nodes to be set to infinity or a relatively large value, and the distance from the starting point to the starting point. Set to 0, but the present invention is not limited to this.
  • FIG. 6 is a flowchart of an operation example of an intelligent disaster prevention and escape method according to the present invention, including but not limited to the following steps (note that if substantially the same result is obtained, Then these steps do not have to be performed in accordance with the execution order shown in Figure 6):
  • Step S600 Start.
  • Step S610 respectively sensing environmental information of a surrounding environment of a plurality of nodes of a region of a building to respectively generate a plurality of sensing signals of the plurality of nodes.
  • Step S620 Calculate a plurality of risk factors of the plurality of nodes according to the plurality of sensing signals, respectively.
  • Step S630 Perform an escape path planning calculation to generate a safest path plan according to the plurality of risk factors and a distance between the plurality of adjacent nodes, respectively.
  • Step S640 Generate multiple escape indications of the multiple nodes according to the most secure path plan.
  • step S610 is performed by the plurality of sensors S1 to Si; steps S620 and S630 are performed by the processing unit 130; and step S640 is performed by the plurality of escape direction indicating devices DP1.
  • ⁇ DPj is executed.
  • FIG. 7 is a flowchart of an operation example of the detailed steps of step S630 of FIG. 6, including but not limited to the following steps (note that if substantially the same result is obtained, these The steps are not necessarily performed in accordance with the order of execution shown in Figure 7):
  • Step S631 using a first node of the plurality of nodes as a computing node, and selecting a specific one having a minimum threat coefficient among the plurality of second nodes connected to the first node and not yet selected. Two nodes.
  • Step S632 Add a third node of the area to update the minimum threat coefficient that reaches the first node and the second node respectively, where when the minimum threat coefficient is calculated, the record of the minimum threat coefficient is updated. . That is, after the third node is added, the threat coefficient of “the third node arrives at the first node” or “the third node reaches the second node” is separately updated; if a smaller threat coefficient is calculated The value of the threat coefficient of the path through the third node is updated and replaced, so that the third node arrives at the path of the first node or the path to the second node. The value of its threat coefficient will be the smallest value.
  • the "the third node arrives at the first node” may or may not pass through the second node.
  • Step S633 repeatedly adding a new node until all nodes of the area are added; wherein the minimum threat coefficient is that the risk factor and the product of the distance have the smallest value.
  • the present invention provides an intelligent disaster prevention and escape method capable of generating a safe and reliable real-time escape indication according to a risk factor and a distance between adjacent nodes to provide a safe and reliable real-time escape indication and an intelligent disaster prevention method thereof.
  • Escape system to quickly and safely guide people to escape and evacuate.
  • the remarkable result of the present invention compared with the existing building survival system technology is that it is possible to select a safest route for a part of the floor in a sudden situation such as a disaster, or to select a safe according to the current situation in a sudden situation such as a disaster.
  • the present invention can be based on the disaster in real time
  • the situation changes dynamically over time to dynamically select the safe optimal path, and can meet the security, intelligence, reliability and real-time requirements of intelligent building personnel evacuation and escape.

Abstract

一种智能型防灾逃生方法，包括下列步骤：分别传感一建筑物的一区域的多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号；分别依据该多个传感信号来计算该多个节点的多个危险系数；分别依据该多个危险系数以及多个相邻节点之间的一距离，来执行一逃生路径规划演算以产生一最安全路径规划；以及依据该最安全路径规划来分别产生该多个节点的多个逃生指示。本发明的有益效果是可依据危险系数以及相邻节点之间的距离来产生最安全路径规划以提供安全的实时逃生指示，以快速的引导人员逃生疏散来减少人员伤亡。

Description

智能型防灾逃生方法及其防灾逃生系统 技术领域
本发明涉及一种智能型防灾逃生方法，尤其涉及一种可依据危险系数以及相邻节点之间的距离来产生最安全路径规划以提供实时逃生指示的智能型防灾逃生方法及其智能型防灾逃生系统。
背景技术
随着城市都市化的发展，现今的建筑物的趋势是越来越高层化、大型化以及复杂化，如此一来，一旦在大楼内发生灾害其所造成的伤亡必定非常惨重，所以大楼内的消防问题也日益受到重视。因此，目前大楼的公共设施都设置有紧急逃生出口以及逃生指示牌，以便在灾难发生时引导受困民众往安全逃生路线逃生，但是，传统的逃生指示牌只是单纯的指向当前楼层的出口，既没有考虑实时的突发状况，也没有考虑到在突发情况下传统的逃生指示牌指示的路径是否为最可靠且安全的路径。
也就是说，传统的逃生指示牌并不能保证指示一条安全性与可靠性比较高的逃生路径以方便楼层中的人员疏散与逃生，更加做不到实时选择安全性最佳的有效路径。
因此，如何提供最可靠且安全的逃生路线指示以降低火场内的人员伤亡，为本领域的重要课题之一。
发明内容
因此，本发明的目的之一在于提出一种可依据危险系数以及相邻节点之间的距离来产生最安全路径规划以提供实时逃生指示的智能型防灾逃生方法 及其智能型防灾逃生系统，以快速引导人员逃生疏散。
本发明提供一种智能型防灾逃生方法，该方法包括有下列步骤：分别传感一建筑物的一区域的多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号；分别依据该多个传感信号来计算每一节点的危险系数；分别依据该多个危险系数以及多个相邻节点之间的距离来计算多个路径的威胁系数，用以执行一逃生路径规划演算并产生一最安全路径规划；依据该最安全路径规划来分别产生该多个节点的多个逃生指示。
如上所述的智能型防灾逃生方法，其中，该逃生路径规划演算执行以下步骤：以该多个节点中的一第一节点当作一起算点，在与该第一节点相连且尚未被选取的多个第二节点中，选择加入具有该最小威胁系数的一特定第二节点；新增该区域的一第三节点，分别更新该第三节点到达该第一节点或该第二节点的威胁系数，当计算出该最小威胁系数时，则更新通过该第三节点的路径的最小威胁系数的纪录；重复加入新节点，并计算该新节点到任一前驱节点的最小威胁系数直到该区域的所有节点都被选取加入为止。在进一步的实施例中，该逃生路径规划演算是用来分别将该多个节点中的每一出口节点当作该起算点以形成该最安全路径规划，其中一逃生方向为该多个节点中的一节点到达该最小威胁系数的前驱节点方向。
如上所述的智能型防灾逃生方法，其中，依据该危险系数以及多个相邻各节点之间的距离来计算多个路径的威胁系数，以进行该逃生路径规划演算并产生该最安全路径规划的步骤另用来：将一第二区域的一出口节点新增至该区域以计算该最安全路径规划。
如上所述的智能型防灾逃生方法，其中，依据该多个传感信号来计算该多个节点的危险系数的步骤另用来：分别将该多个传感信号进行正规划运算。
本发明另提供一种智能型防灾逃生系统，包括多个传感器、多个逃生方 向指示装置以及处理单元。该多个传感器分别设置于一建筑物的一区域的每一节点，用来分别传感该多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号；该多个逃生方向指示装置分别设置于该建筑物的该区域的该多个节点，用来依据一最安全路径规划来分别产生该多个节点的多个逃生指示；以及该处理单元耦接多个该传感器及该多个逃生方向指示装置，用来分别依据该多个传感信号来计算该多个节点的多个危险系数；以及该处理单元分别依据该多个危险系数以及多个相邻节点之间的距离来计算多个路径的威胁系数，用以执行一逃生路径规划演算并产生该最安全路径规划。
如上所述的智能型防灾逃生系统，其中，该逃生路径规划演算执行以下步骤：以该多个节点中的一第一节点当作一起算点，在与该第一节点相连且尚未被选取的多个第二节点中，选择加入具有该最小威胁系数的一特定节点；新增该区域的一第三节点，分别更新该第三节点到达该第一节点或该第二节点的威胁系数，当该处理单元计算出该最小威胁系数时，则更新通过该第三节点的路径的最小威胁系数的纪录；重复加入新节点，并计算该新节点到任一前驱节点的最小威胁系数直到该区域的所有节点都被选取加入为止。在进一步的实施例中，该逃生路径规划演算系用来依序将该多个节点中的每一出口节点当作该起算点以形成该最安全路径规划，其中一逃生方向为该多个节点中的一节点到达该最小威胁系数的前驱节点方向。
如上所述的智能型防灾逃生系统，其中，该威胁系数为该危险系数与该距离的积。
如上所述的智能型防灾逃生系统，其中，该处理单元另用来将一第二区域的一出口节点新增至该区域以计算该最安全路径规划。
综上所述，本发明的有益效果是，本发明提供一种可依据危险系数以及相邻节点之间的距离来产生最安全路径规划以提供安全且可靠的实时逃生指 示的智能型防灾逃生方法及其智能型防灾逃生系统，以快速的引导人员逃生疏散来减少灾害发生时可能造成的人员伤亡。
为让本发明的上述目的、特征和优点更能明显易懂，下文将以实施例并配合所附图式，作详细说明如下。需注意的是，附图中的各组件仅为示意，并未按照各组件的实际比例进行绘示。
附图说明
图1为本发明一种智能型防灾逃生系统的一实施例的示意图。
图2为本发明的建筑物的一第一区域的多个节点的一实施例的示意图。
图3为本发明计算逃生路径规划演算的一实施例的示意图。
图4为本发明的建筑物的一第一区域及一第二区域的多个节点的一实施例的示意图。
图5为本发明用来将一第二区域的一出口节点新增至该第一区域以计算该逃生路径规划演算的一实施例的示意图。
图6为本发明一种智能型防灾逃生方法的一操作范例的流程图。
图7为图6的步骤S630的详细步骤的一操作范例的流程图。
具体实施方式
在说明书及后续的申请专利范围当中使用了某些词汇来指称特定的组件。所属领域中具有相关知识的技术人员应可理解，硬件制造商可能会用不同的名词来称呼同样的组件。本说明书及后续的申请专利范围并不以名称的差异来作为区分组件的方式，而是以组件在功能上的差异来作为区分的准则。在通篇说明书及后续的请求项当中所提及的“包括”为一开放式的用语，故应解释成“包括但不限定于”。另外，“耦接”一词在此包括任何直接及间接的电气连接手段。因此，若文中描述一第一装置耦接于一第二装置，则代表该第一装置可直接电气连接于该第二装置，或透过其他装置或连接手段间 接地电气连接至该第二装置。
请参考图1，图1为本发明一种智能型防灾逃生系统100的一实施例的示意图。如图1所示，智能型防灾逃生系统100包括有(但不局限于)：多个传感器(例如i个传感器)S1～Si、多个逃生方向指示装置(例如j个逃生方向指示装置)DP1～DPj以及一处理单元130。值得注意的是，多个传感器S1～Si系分别设置于一建筑物的一区域的每一节点，用来分别传感该多个节点(例如k个节点)N1～Nk的周遭环境的环境信息，以分别产生该多个节点N1～Nk的多个传感信号SS1～SSi，举例而言，多个传感器S1～Si可传感其周遭环境中的温度、烟雾、火焰、一氧化碳浓度、二氧化碳浓度或其他任何危险气体以发出多个传感信号SS1～SSi，但此仅为举例说明，并非本发明的限制条件。多个逃生方向指示装置DP1～DPj系分别设置于该建筑物的该区域的该多个节点N1～Nk，用来依据一最安全路径规划来分别产生该多个节点N1～Nk的多个逃生指示DS1～DSj。另外，处理单元130耦接至该多个传感器S1～Si及该多个逃生方向指示装置DP1～DPj，用来分别依据该多个传感信号SS1～SSi来计算该多个节点N1～Nk的多个危险系数RC1～RCk。值得注意的是，处理单元130可以利用无线或有线的方式来接收该多个传感器S1～Si所传感的该多个传感信号SS1～SSi，然此仅是本发明的实施例之一，并非本发明的限制条件。之后，处理单元130分别依据该多个危险系数RC1～RCk以及多个相邻节点之间的一距离D1～Dh来执行一逃生路径规划演算以产生该最安全路径规划，举例而言，处理单元130在计算该最安全路径规划时可以用多个相邻节点之间的距离D1～Dh来分别作为该多个危险系数RC1～RCk的权重来产生该最小威胁系数。另外，在本发明的一实施例中，处理单元130可利用一服务器或一计算机来实现，但本发明并不局限于此。另外，该多个相邻节点之间的距离D1～Dh可以内建于该服务器或该计算机中，但此也非本发明的限制条件。
请注意，上述的个数i、j、k、h仅为范例说明，其可各为相同或者不同的数值，并非本发明的限制条件。
接下来，举个例子来说明本发明的该逃生路径规划演算的相关运作。请参考图2，图2为本发明的建筑物的一第一区域的多个节点的一实施例的示意图。如图2所示，该第一区域包括有5个节点N1～N5，其中节点N1及节点N3分别为出口节点，另外，在这5个节点N1～N5上皆设置有多个传感器S1～S5，每个节点上的多个传感器可以用来传感该节点中的周遭环境的温度、烟雾、火焰、一氧化碳、二氧化碳、红外线、等环境信息来产生多个个传感信号SS1～SS5，举例而言，温度(Temperature)越高代表越危险、烟雾(Smoke)浓度越高代表越危险、一氧化碳浓度越高代表越危险、二氧化碳浓度越高代表越危险以及红外线式火焰传感器侦测到波长越大(超过1.0μm)代表危险越高，因此，处理单元130可以根据每一节点上的传感信号SS1～SS5来计算该每一节点N1～N5上的危险系数RC1～RC5。值得注意的是，在本发明一实施例中，处理单元130可以对传感信号SS1～SS5中的温度、烟雾浓度、一氧化碳浓度、二氧化碳浓度或红外线式火焰传感器侦测到波长先分别进行正规划运算，之后再进行计算危险系数RC1～RC5。
请再参照图2，在此实施例中，为了方便计算，所有相邻节点之间的距离D都是设为1，如此一来，每一节点上的该最小威胁系数便是该危险系数的数值(权重为1)，但此并非本发明的限制条件。另外，假设起火点位于节点N1与节点N4的交界，因此，节点N1与节点N4上的多个传感器S1及S4侦测到异常状态，因此，处理单元130便分别计算出节点N1～N5的上的危险系数RC1～RC5分别为节点N1(125000)、节点N2(0)、节点N3(15625)、节点N4(125000)及节点N5(0)。
接着，请同时参照图2及图3，图3为本发明计算该逃生路径规划演算的示意图。如图3所示，在步骤a1，处理单元130以该多个节点中的一第一节点(出口节点N1)当作一起算点，此时节点N1到节点N1(N1-＞N1)最小威胁系数为125000且前驱节点更新为N1-＞N1；
在步骤a2，在与该第一节点(节点N1)相连且尚未被选取的多个第二节点(节点N2、N3、N4、N5)中，选择加入具有一最小威胁系数的一特定第二节点(节点N2)，此时节点N1到节点N1(N1-＞N1)的最小威胁系数为125000，而节点N2到节点N1(N2-＞N1)的最小威胁系数为125000且前驱节点更新为N1-＞N1及N2-＞N1；
在步骤a3，新增该区域的一第三节点(节点N3)，以分别更新到达该第一节点(节点N1)与该第二节点(节点N2)的该最小威胁系数，此时节点N3到节点N1(N3-＞N1)的最小威胁系数为125000+0*1+15625*1＝140625且前驱节点更新为N1-＞N1、N2-＞N1及N3-＞N2，之后，重复加入新节点(节点N4、N5)，直到该区域的所有节点都被加入为止(步骤a4、步骤a5)。
例如：在步骤a4中加入新节点N4，此时节点N4到节点N1(N4-＞N1)的最小威胁系数为125000+0*1+125000*1＝250000且前驱节点更新为N1-＞N1、N2-＞N1、N3-＞N2及N4-＞N2；
在步骤a5中加入新节点N5，此时节点N5到节点N1(N5-＞N1)的最小威胁系数为125000+0*1+125000*1+0*1＝250000且前驱节点更新为N1-＞N1、N2-＞N1、N3-＞N2、N4-＞N2及N5-＞N4；
最后，在步骤a6确认，节点N1、N2、N3、N4及N5到出口节点N1的最小威胁系数分别为：125000、125000、140625、250000及250000。
另外，请继续参照图2及图3，在本实施例中，该逃生路径规划演算是用来依序将该多个节点中的每一出口节点(例如：出口节点N3)当作该起算点 以形成该最安全路径规划。请注意，当处理单元130计算出该最小威胁系数时，则更新该最小威胁系数的纪录；例如在步骤c1，以节点N3为当作一起算点，此时节点N3到节点N3(N3-＞N3)最小威胁系数为15625较原先节点N3到节点N1(N3-＞N1)的最小威胁系数为140625小，因此更新该最小威胁系数的纪录为15625且前驱节点更新为N1-＞N1、N2-＞N1、N3-＞N3、N4-＞N2及N5-＞N4。
在步骤c2，在与该第一节点(节点N3)相连且尚未被选取的多个第二节点(节点N1、N2、N4、N5)中，选择加入具有一最小威胁系数的一特定第二节点(节点N2)，此时节点N3到节点N3(N3-＞N3)的最小威胁系数为15625，而节点N2到节点N3(N2-＞N3)的最小威胁系数为15625较原先节点N2到节点N1(N2-＞N1)的最小威胁系数为125000小，因此更新该最小威胁系数的纪录为15625且前驱节点更新为N1-＞N1，N2-＞N3，N3-＞N3，N4-＞N2，N5-＞N4；同理，步骤c3～c6原理与上述步骤相似，熟知此项技艺人士应可从上面的说明来了解步骤C3～C6的运作原理，为简洁起见在此不在赘述。最后，在步骤c6确认，节点N1、N2、N3、N4及N5到出口节点N1的最小威胁系数分别为：125000、15626、15625、140625及140625。值得注意的是，从图3的步骤a6以及步骤c6可知，节点N2到该出口节点N3的最小威胁系数为15625，比节点N2到该出口节点N1的最小威胁系数125000还要小；因为逃生方向乃是该多个节点中的一节点到达该最小威胁系数的前驱节点方向，所以，人员在节点N2时，往节点N3方向逃生是较安全的(与节点N2到节点N1相比较)，因此，处理单元130会控制节点N2上的到指示灯DP2往出口N3方向导引。
请参考图4，图4为本发明的建筑物的一第一区域及一第二区域的多个节点N1～N6的一实施例的示意图。如图4所示，该第二区域的一出口节点N6与该第一区域的节点N5距离为2，且出口节点N6为一远程出口节点。请同时再参照图4及图5，图5为本发明用来将一第二区域的一出口节点新增 至该第一区域以计算该逃生路径规划演算的一实施例的示意图。如图5所示，该处理单元130用来将一第二区域的一出口节点N6新增至该第一区域以计算该最安全路径规划，在步骤f1～f7中以出口节点N3当作该起算点以形成该最安全路径规划，因为步骤f1～f7原理与上述步骤相似，熟知此项技术的人员应可从上面的说明来了解步骤f1～f7的运作原理，为简洁起见在此不再赘述。值得注意的是，该第二区域的一出口节点N6与该第一区域的节点N5距离为2，所以在计算节点N5到节点N6(N5-＞N6)或节点N6到节点N5(N6-＞N5)时，权重为2，例如，在步骤f2，新增节点N5，此时节点N5到节点N6(N5-＞N6)的最小威胁系数为15625*2+0＝31250，同理，最后在步骤f7确认，节点N1、N2、N3、N4、N5及N6到出口节点N6的最小威胁系数分别为：125000、15626、15625、140625、31250及15625。此外，请再注意，从图3的步骤a6、步骤c6以及步骤f7可知，节点N5到该出口节点N6的最小威胁系数为15625，比节点N5到出口节点N1的最小威胁系数250000以及节点N5到出口节点N3的最小威胁系数140625还要小。即，人员在节点N5时，往该第二区域的远程出口节点N6方向逃生是较安全的(因为其威胁系数值最小)，因此，该处理单元130会控制节点N5上的到指示灯DP5往该第二区域的远程出口节点N6方向导引。
此外，在本发明其他实施例中，该逃生路径规划演算也可以利用将该多个节点的已知最短距离先设成无穷大或一相对较大数值，以及将该起算点到该起算点间距离设为0，然本发明并不局限于此。
请参考图6，图6为本发明一种智能型防灾逃生方法的一操作范例的流程图，其包括(但不局限于)以下的步骤(请注意，假若可获得实质上相同的结果，则这些步骤并不一定要遵照图6所示的执行次序来执行)：
步骤S600：开始。
步骤S610：分别传感一建筑物的一区域的多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号。
步骤S620：分别依据该多个传感信号来计算该多个节点的多个危险系数。
步骤S630：分别依据该多个危险系数以及多个相邻节点之间的一距离，来执行一逃生路径规划演算以产生一最安全路径规划。
步骤S640：依据该最安全路径规划来分别产生该多个节点的多个逃生指示。
请搭配图6所示的各步骤以及图1所示的各组件即可了解各组件如何运作，为简洁起见，故于此不再赘述。值得注意的是，于本实施例中，步骤S610是由多个传感器S1～Si所执行之；步骤S620、S630是由处理单元130所执行之；而步骤S640是由多个逃生方向指示装置DP1～DPj所执行之。
请参考图7，图7为图6的步骤S630的详细步骤的一操作范例的流程图，其包括(但不局限于)以下的步骤(请注意，假若可获得实质上相同的结果，则这些步骤并不一定要遵照第7图所示的执行次序来执行)：
步骤S631：以该多个节点中的一第一节点当作一起算点，在与该第一节点相连且尚未被选取的多个第二节点中，选择加入具有一最小威胁系数的一特定第二节点。
步骤S632：新增该区域的一第三节点，以分别更新到达该第一节点与该第二节点的该最小威胁系数，其中当计算出该最小威胁系数时，则更新该最小威胁系数的纪录。亦即，新增该第三节点之后，需分别更新”该第三节点到达该第一节点”或”该第三节点到达该第二节点”的威胁系数；若计算出一更小的威胁系数的数值时，即更新、置换(replace)其通过该第三节点的路径的威胁系数的数值，使该第三节点不论是到达该第一节点的路径，或是到达该第二节点的路径，其威胁系数的数值都会是最小的值。在此，”该第三节点到达该第一节点”可以是经过第二节点，也可以不经过该第二节点。
步骤S633：重复加入新节点，直到该区域的所有节点都被加入为止；其中该最小威胁系数系为该危险系数以及该距离的积的数值最小。
请搭配图7所示的各步骤、图1所示的各组件以及图2、图3所示的实施例即可了解各组件如何运作，为简洁起见，故于此不再赘述。
综上所述，本发明提供一种可依据危险系数以及相邻节点之间的距离来产生最安全路径规划以提供安全且可靠的实时逃生指示的智能型防灾逃生方法及其智能型防灾逃生系统，以快速且安全的引导人员逃生疏散。本发明与现有大楼求生系统技术相比的显著成果在于：能够考虑灾害等突发状况下，保证楼层中的部分位置选择最安全路径，或在灾害等突发情况点根据当前情况选择一条安全且路径最优的人员疏散路径，尽可能增加大楼中人员的逃生可能性与人员疏散的安全性；由于突发情况随时间的变化，通道也会随着发生变化，本发明能够实时地根据灾害的情况随时间变化来动态选择安全最优路径，并且能够满足智能大楼人员疏散与逃生的安全性、智慧性、可靠性与实时性的需求。
以上所述仅为本发明的较佳实施例，凡依本发明申请专利范围所 做的均等变化与修饰，皆应属本发明的涵盖范围。

Claims (9)

  1. 一种智能型防灾逃生方法，包括：
    分别传感一建筑物的一区域的多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号；
    分别依据该多个传感信号来计算每一节点的危险系数；
    分别依据该多个危险系数以及多个相邻节点之间的距离来计算多个个路径的威胁系数，用以执行一逃生路径规划演算并产生一最安全路径规划；以及
    依据该最安全路径规划来分别产生该多个节点的多个逃生指示。
  2. 如权利要求1所述的智能型防灾逃生方法，其特征在于，该逃生路径规划演算系执行以下步骤：
    以该多个节点中的一第一节点当作一起算点，在与该第一节点相连且尚未被选取的多个第二节点中，选择加入具有该最小威胁系数的一特定第二节点；
    新增该区域的一第三节点，分别更新该第三节点到达该第一节点或该第二节点的威胁系数，当计算出该最小威胁系数时，则更新通过该第三节点的路径的最小威胁系数的纪录；以及
    重复加入新节点，并计算该新节点到任一前驱节点的最小威胁系数直到该区域的所有节点都被选取加入为止。
  3. 如权利要求2所述的智能型防灾逃生方法，其特征在于，该逃生路径规划演算系用来分别将该多个节点中的每一出口节点当作该起算点以形成该最安全路径规划，其中一逃生方向为该多个节点中的一节点到达该最小威胁系数的前驱节点方向。
  4. 如权利要求1所述的智能型防灾逃生方法，其特征在于，依据该危险系数以及多个相邻各节点之间的距离来来计算多个路径的威胁系数，以进行该逃生路径规划演算并产生该最安全路径规划的步骤另用来：将一第二区域的一出口节点新增至该区域以计算该最安全路径规划。
  5. 如权利要求1所述的智能型防灾逃生方法，其特征在于，依据该多个传感信号来计算该多个节点的危险系数的步骤另用来：分别将该多个传感信号进行正规划运算。
  6. 一种智能型防灾逃生系统，包括：
    多个传感器，分别设置于一建筑物的一区域的每一节点，用来分别传感该多个节点的周遭环境的环境信息，以分别产生该多个节点的多个传感信号；
    多个逃生方向指示装置，分别设置于该建筑物的该区域的该多个节点，用来依据一最安全路径规划来分别产生该多个节点的多个逃生指示；以及
    一处理单元，耦接多个该传感器及该多个逃生方向指示装置，用来分别依据该多个传感信号来计算该多个节点的多个危险系数；以及分别依据该多个危险系数以及多个相邻节点之间的距离来计算多个个路径的威胁系数，用以执行一逃生路径规划演算并产生该最安全路径规划。
  7. 如权利要求6所述的智能型防灾逃生系统，其特征在于，该逃生路径规划演算执行以下步骤：
    以该多个节点中的一第一节点当作一起算点，在与该第一节点相连且尚未被选取的多个第二节点中，选择加入具有该最小威胁系数的一特定节点；
    新增该区域的一第三节点，分别更新该第三节点到达该第一节点或该第二节点的威胁系数，当该处理单元计算出该最小威胁系数时，则更新通过该第三节点的路径的最小威胁系数的纪录；以及
    重复加入新节点，并计算该新节点到任一前驱节点的最小威胁系数直到该区域的所有节点都被选取加入为止。
  8. 如权利要求6所述的智能型防灾逃生系统，其特征在于，该逃生路径规划演算系用来依序将该多个节点中的每一出口节点当作该起算点以形成该最安全路径规划，其中一逃生方向为该多个节点中的一节点到达该最小威胁系数的前驱节点方向。
  9. 如权利要求6所述的智能型防灾逃生系统，其特征在于，该处理单元另用来将一第二区域的一出口节点新增至该区域以计算该最安全路径规划。
PCT/CN2014/086099 2014-09-09 2014-09-09 智能型防灾逃生方法及其防灾逃生系统 WO2016037308A1 (zh)

Priority Applications (8)

Application Number Priority Date Filing Date Title
JP2017514564A JP6569964B2 (ja) 2014-09-09 2014-09-09 スマート防災避難方法及びその防災避難システム
US15/509,862 US10322302B2 (en) 2014-09-09 2014-09-09 Intelligent disaster prevention and escape method and system
EP14901524.0A EP3192567A4 (en) 2014-09-09 2014-09-09 Intelligent disaster prevention and escape method and disaster prevention and escape system thereof
SG11201701864XA SG11201701864XA (en) 2014-09-09 2014-09-09 Intelligent disaster prevention and escape method and disaster prevention and escape system thereof
CN201480081845.6A CN106999739B (zh) 2014-09-09 2014-09-09 智能型防灾逃生方法及其防灾逃生系统
PCT/CN2014/086099 WO2016037308A1 (zh) 2014-09-09 2014-09-09 智能型防灾逃生方法及其防灾逃生系统
TW104129849A TWI567697B (zh) 2014-09-09 2015-09-09 智慧型疏散系統及其控制方法
TW104129848A TWI567696B (zh) 2014-09-09 2015-09-09 智慧型停車場管理系統及其控制方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2014/086099 WO2016037308A1 (zh) 2014-09-09 2014-09-09 智能型防灾逃生方法及其防灾逃生系统

Publications (1)

Publication Number Publication Date
WO2016037308A1 true WO2016037308A1 (zh) 2016-03-17

Family

ID=55458234

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2014/086099 WO2016037308A1 (zh) 2014-09-09 2014-09-09 智能型防灾逃生方法及其防灾逃生系统

Country Status (6)

Country Link
US (1) US10322302B2 (zh)
EP (1) EP3192567A4 (zh)
JP (1) JP6569964B2 (zh)
CN (1) CN106999739B (zh)
SG (1) SG11201701864XA (zh)
WO (1) WO2016037308A1 (zh)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111652409A (zh) * 2020-04-30 2020-09-11 广州富港万嘉智能科技有限公司 一种火灾逃生方案规划方法、存储介质及建筑用火警系统
CN111982113A (zh) * 2020-07-22 2020-11-24 湖南大学 路径生成方法、装置、设备及存储介质

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US10514669B1 (en) 2014-04-25 2019-12-24 State Farm Mutual Automobile Insurance Company Systems and methods for managing the operation of devices within a property
US10249158B1 (en) 2014-10-07 2019-04-02 State Farm Mutual Automobile Insurance Company Systems and methods for automatically responding to a fire
US10825318B1 (en) 2018-04-09 2020-11-03 State Farm Mutual Automobile Insurance Company Sensing peripheral heuristic evidence, reinforcement, and engagement system
CN112770462A (zh) * 2021-01-18 2021-05-07 海洋王（东莞）照明科技有限公司 照明系统及其控制方法

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101315725A (zh) * 2008-07-14 2008-12-03 浙江工业大学 基于无线传感网络的火灾逃生分布式节点引导系统
WO2012069272A1 (de) * 2010-11-23 2012-05-31 Siemens Aktiengesellschaft Verfahren und system zur routenberechnung
CN202995948U (zh) * 2012-11-27 2013-06-12 福建省泉州市第七中学 基于智能路径的火灾动态逃生引导系统
CN103170071A (zh) * 2013-02-26 2013-06-26 中国科学院自动化研究所 一种智能楼宇火警人员疏散动态路径指示系统
CN203253071U (zh) * 2013-01-29 2013-10-30 中国科学院自动化研究所 智能楼宇消防逃生路径多功能指示装置

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP2582011B2 (ja) * 1991-09-24 1997-02-19 株式会社コーアツ 避難誘導方法
US5543789A (en) * 1994-06-24 1996-08-06 Shields Enterprises, Inc. Computerized navigation system
JP3425276B2 (ja) * 1995-08-11 2003-07-14 株式会社日立製作所 情報通知システム
US8836580B2 (en) 2005-05-09 2014-09-16 Ehud Mendelson RF proximity tags providing indoor and outdoor navigation and method of use
US8346474B2 (en) * 2008-08-28 2013-01-01 Honeywell International Inc. Method of route retrieval
CN102324064B (zh) * 2011-08-25 2013-06-19 陈�光 基于传感带的动态火灾风险评估方法与系统
US9644974B2 (en) * 2011-10-19 2017-05-09 Honeywell International Inc. Model-based generation of information and evacuation messages
TWI451362B (zh) 2012-11-29 2014-09-01 Univ Nat Chiao Tung 快速疏導系統及其方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101315725A (zh) * 2008-07-14 2008-12-03 浙江工业大学 基于无线传感网络的火灾逃生分布式节点引导系统
WO2012069272A1 (de) * 2010-11-23 2012-05-31 Siemens Aktiengesellschaft Verfahren und system zur routenberechnung
CN202995948U (zh) * 2012-11-27 2013-06-12 福建省泉州市第七中学 基于智能路径的火灾动态逃生引导系统
CN203253071U (zh) * 2013-01-29 2013-10-30 中国科学院自动化研究所 智能楼宇消防逃生路径多功能指示装置
CN103170071A (zh) * 2013-02-26 2013-06-26 中国科学院自动化研究所 一种智能楼宇火警人员疏散动态路径指示系统

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3192567A4 *

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111652409A (zh) * 2020-04-30 2020-09-11 广州富港万嘉智能科技有限公司 一种火灾逃生方案规划方法、存储介质及建筑用火警系统
CN111982113A (zh) * 2020-07-22 2020-11-24 湖南大学 路径生成方法、装置、设备及存储介质
CN111982113B (zh) * 2020-07-22 2022-09-06 湖南大学 路径生成方法、装置、设备及存储介质

Also Published As

Publication number Publication date
CN106999739A (zh) 2017-08-01
US20170304659A1 (en) 2017-10-26
EP3192567A4 (en) 2018-05-02
CN106999739B (zh) 2020-04-14
JP6569964B2 (ja) 2019-09-04
JP2017528840A (ja) 2017-09-28
US10322302B2 (en) 2019-06-18
SG11201701864XA (en) 2017-04-27
EP3192567A1 (en) 2017-07-19

Similar Documents

Publication Publication Date Title
WO2016037308A1 (zh) 智能型防灾逃生方法及其防灾逃生系统
Ryu IoT-based intelligent for fire emergency response systems
US9721457B2 (en) Global positioning system equipped with hazard detector and a system for providing hazard alerts thereby
US20120047083A1 (en) Fire Situation Awareness And Evacuation Support
CN109035641B (zh) 考虑烟气影响的火灾疏散路径动态优化与可视方法
US20100057354A1 (en) Method of Route Retrieval
KR101893040B1 (ko) 대피 경로 안내 시스템 및 방법
KR101631090B1 (ko) 건물 모델링 데이터를 이용한 화재감지시스템 및 화재대응방법
KR102086564B1 (ko) IoT 기반의 지능형 피난 유도 시스템
KR20140124462A (ko) 화재 대피자 상황정보 제공 시스템 및 방법
KR101551716B1 (ko) 아날로그 주소형 감지기를 이용한 건축물 소방안전 시스템
KR20170088105A (ko) 건축물 내에 설치되어 있는 ｉｏｔ센서 기반의 화재 예방 및 대피유도 방법
TWI567697B (zh) 智慧型疏散系統及其控制方法
CN111915823A (zh) 消防系统、服务器及移动终端设备
Shaharuddin et al. The role of IoT sensor in smart building context for indoor fire hazard scenario: A systematic review of interdisciplinary articles
Wong et al. Indoor navigation and information sharing for collaborative fire emergency response with BIM and multi-user networking
KR20180096308A (ko) 비상시 안전 유도 표시 방법
CN113744476B (zh) 建筑物内应急疏散指引方法及装置
US20220128467A1 (en) Detecting and Monitoring Gas Leaks in an Industrial Setting
JP2008102670A (ja) 集合住宅用避難誘導システム
TW201712642A (zh) 室內避難引導方法及系統
KR101582033B1 (ko) 대원의 위치 및 고립 추적 방법 및 장치
JP6601058B2 (ja) 情報処理装置、情報処理方法、及び情報処理システム
Al-Hady et al. Development of IoT-Based Automated Dynamic Emergency Response System Against Fire Incidents in Academic Building
Wehbi Integration of BIM and digital technologies for smart indoor hazards management

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 14901524

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017514564

Country of ref document: JP

Kind code of ref document: A

NENP Non-entry into the national phase

Ref country code: DE

REEP Request for entry into the european phase

Ref document number: 2014901524

Country of ref document: EP

WWE Wipo information: entry into national phase

Ref document number: 15509862

Country of ref document: US

Ref document number: 2014901524

Country of ref document: EP