Optimal Pedestrian Evacuation in Building with Consecutive Differential Dynamic Programming
Date of Original Version
Fast and efficient evacuation of pedestrians from an enclosed area is a difficult but crucial issue in modern society. In this paper, the optimization of evacuation from a building is studied. A graph is adopted to describe the building layout with nodes representing areas and edges representing connections. The dynamics of the evacuation process in the graph is formulated by a nonlinear discrete-time model at a macroscopic level. To find the optimal evacuation plan, a consecutive differential dynamic programming is developed. It inherits the differential dynamic programming property that solves the value and optimal policy locally. Additionally, it consecutively executes actions for multiple steps in the trajectory, which is beneficial to reduce computational burden and lower optimization difficulty. Simulations on a four-storey building layout demonstrates our method is efficient and suitable for on-site evacuation plan making.
Publication Title, e.g., Journal
Proceedings of the International Joint Conference on Neural Networks
Zhu, Yuanheng, Haibo He, Dongbin Zhao, and Zhongsheng Hou. "Optimal Pedestrian Evacuation in Building with Consecutive Differential Dynamic Programming." Proceedings of the International Joint Conference on Neural Networks 2019-July, (2019). doi: 10.1109/IJCNN.2019.8852228.