China Safety Science Journal ›› 2019, Vol. 29 ›› Issue (4): 51-57.doi: 10.16265/j.cnki.issn1003-3033.2019.04.009

• Safety Systematology • Previous Articles     Next Articles

Shortest path optimal algorithm for emergency evacuation based on cellular automata

HE Mengnan1, FU Yuling1,2, CHEN Cheng1, HE Hubin1, LIN Yuqing1, CHEN Qiuwen1   

  1. 1 Center for Eco-Environmental Research, Naning Hydraulic Research Institute, Nanjing Jiangsu 210029, China;
    2 College of Hehai, Chongqing Jiaotong University, Chongqing 400074, China
  • Received:2018-12-19 Revised:2019-01-28 Online:2019-04-28 Published:2020-11-04

Abstract: To plan the shortest emergency evacuation route scientifically and efficiently, an optimal algorithm for GSPCA was put forward by establishing a detour distance field against obstacles, and two solving modes of GSPCA_2D and GSPCA_3D were developed. To analyze the characteristics and applicability of GSPCA, this algorithm was compared with the heuristic search algorithm based on Euclidean distance (A* algorithm) in the shortest path planning experiment. The results show that compared with A* algorithm, GSPCA optimal algorithm is more comprehensive which can avoid the phenomenon of detours by clinging to the wall, and the shortest path is shortened by 12.39 % (GSPCA_2D) and 16.82 % (GSPCA_3D) on average; more importantly, with the terrain factors taken into consideration, GSPCA could select reasonable solution modes according to the terrain characteristics and practical application requirements.

Key words: emergency evacuation, global shortest path based on cellular automata (GSPCA), A* algorithm, Euclidean distance, detour distance field

CLC Number: