A Study on Escape Path Planning of Multi-Source/Multi-Sink for Public Buildings

Abstract

With the development of urbanization and the rise of commercial center, the complex internal structure of public commercial buildings and the high density of people make the evacuation of people more aimless, and accurate path planning plays an important role in escape and evacuation. Dijkstra algorithm can only satisfy the single point to single point shortest path planning situation and cannot actually solve the shortest path planning problem with many source points and sink points. Thus, this paper studies the shortest path of escape with multi-source/multi-sink, and proposes an improved Dijkstra algorithm, which can solve the shortest path planning task of escape from multi-source point to multi-sink point and has fast and efficient characteristics of the original Dijkstra algorithm, thus improving the escape efficiency of personnel. In the end, this paper simulates the improved algorithm using the data of different distribution density of different people. The experimental results show that the proposed algorithm is more practical for the shortest path planning from multi-source to multi-sink under the condition of relatively dispersed personnel.