TY - JOUR
T1 - Safest-path planning approach for indoor fire evacuation
AU - Shih, Guan Rong
AU - Tsai, Pei Hsuan
N1 - Funding Information:
This research was funded by National Science and Technology Council (Taiwan) with grant numbers of 111-2221-E-006-115-MY2 and 108-2221-E-006-095-MY2 , and National Cheng-Kung University .
Publisher Copyright:
© 2023 Elsevier Ltd
PY - 2023/7
Y1 - 2023/7
N2 - Many evacuation approaches have been proposed to assist people in escaping from fires. Traditional approaches focus on finding the nearest exit and planning the shortest path. However, they involve disadvantages as they are inflexible and time-consuming to adapt to the dynamic spread of fires. Advanced approaches exploit real-time data provided by a sensor network to dynamically determine evacuation exits and paths. Their disadvantages include local optimal solutions and excessive dependence on the sensor network, which may be destroyed in fires. In contrast to previous approaches, in this study, we adopt fire prediction to determine the safest path. In addition, a path planning algorithm is proposed to utilize the prediction data in parallel. In contrast to previous approaches, in this study, we adopt fire prediction to determine the safest path. In addition, a path planning algorithm is proposed to utilize the prediction data in parallel. In the simulations, we adopted the fire trends simulated by the fire dynamic simulation tool, PyroSim. Common safety procedures are flexibly applied to our approach by transforming and modeling. The effects of a crowded area are disregarded. The survival rate and computation time are considered critical performance measurements. The experimental results indicate that our approach is 10 times faster than other approaches and exhibits a survival rate more than 10% higher than prior methods.
AB - Many evacuation approaches have been proposed to assist people in escaping from fires. Traditional approaches focus on finding the nearest exit and planning the shortest path. However, they involve disadvantages as they are inflexible and time-consuming to adapt to the dynamic spread of fires. Advanced approaches exploit real-time data provided by a sensor network to dynamically determine evacuation exits and paths. Their disadvantages include local optimal solutions and excessive dependence on the sensor network, which may be destroyed in fires. In contrast to previous approaches, in this study, we adopt fire prediction to determine the safest path. In addition, a path planning algorithm is proposed to utilize the prediction data in parallel. In contrast to previous approaches, in this study, we adopt fire prediction to determine the safest path. In addition, a path planning algorithm is proposed to utilize the prediction data in parallel. In the simulations, we adopted the fire trends simulated by the fire dynamic simulation tool, PyroSim. Common safety procedures are flexibly applied to our approach by transforming and modeling. The effects of a crowded area are disregarded. The survival rate and computation time are considered critical performance measurements. The experimental results indicate that our approach is 10 times faster than other approaches and exhibits a survival rate more than 10% higher than prior methods.
UR - http://www.scopus.com/inward/record.url?scp=85159917954&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85159917954&partnerID=8YFLogxK
U2 - 10.1016/j.ijdrr.2023.103760
DO - 10.1016/j.ijdrr.2023.103760
M3 - Article
AN - SCOPUS:85159917954
SN - 2212-4209
VL - 93
JO - International Journal of Disaster Risk Reduction
JF - International Journal of Disaster Risk Reduction
M1 - 103760
ER -