Citation

He M, Fu Y, Chen C, He H, Lin Y, Chen Q. China Saf. Sci. J. 2019; 29(4): 51-57.

Copyright

(Copyright © 2019, China Occupational Safety and Health Association, Publisher Gai Xue bao)

DOI

10.16265/j.cnki.issn1003-3033.2019.04.009

PMID

unavailable

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. © 2019 China Safety Science Journal

Language: zh