Title: Research on fire escape paths for complex public buildings with multiple starting and end points

Authors: Yi Zhang; Chi Wang; Wenwen Tong; Tianqi Liu

Addresses: Anhui Province Key Laboratory of Intelligent Building and Building Energy Saving, Anhui Jianzhu University, Hefei, China ' School of Electronic and Information Engineering, Anhui Jianzhu University, Hefei, China ' School of Electronic and Information Engineering, Anhui Jianzhu University, Hefei, China ' School of Electronic and Information Engineering, Anhui Jianzhu University, Hefei, China

Abstract: In order to solve the path planning problem in the escape and evacuation of dense crowds in complex buildings, an improved Dijkstra's algorithm is proposed in this paper to carry out a research on the planning of the shortest escape path from the starting point of the crowds to the security exit of the building. In order to test the effect of the algorithm, the simulation of the proposed improved algorithm has been carried out in the paper using real commercial bodies as a model with different numbers of people and different distribution densities. The experimental results verify that the proposed algorithm is fast and efficient and can effectively improve the escape efficiency of the crowds, which has strong application value.

Keywords: improved Dijkstra's algorithm; multiple starting and end points; evacuation; path planning.

DOI: 10.1504/IJSPM.2022.130285

International Journal of Simulation and Process Modelling, 2022 Vol.19 No.1/2, pp.62 - 70

Received: 30 Apr 2021
Accepted: 04 Jan 2022
Published online: 17 Apr 2023 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article