Dynamic Evacuation Path Planning Method for Building Fire with ASRRT-MCACO Collaborative Optimization
In response to the issues of slow efficiency, unreasonable path planning, and poor real-time performance in dynamic evacuation route planning for building fires during their early stages, a collaborative optimization method is proposed that integrates the Adaptive Step Size RRT* (ASRRT) algorithm with the Multi-Objective Collaborative Ant Colony Algorithm (MCACO). First, the ant colony algorithm is used to dynamically prioritize multiple exits. Then, an improved RRT* algorithm is employed to plan the shortest and safest path from the current position to the selected exit. Safety constraints are also introduced during the path planning process. Finally, the smoothness of the optimized path is enhanced, and simulation experiments are conducted in self-built scenarios. The experimental results show that the proposed method has an average path length 27.5m and a path planning time of 7.4 seconds, demonstrating high precision and robustness across various scenarios.
Authors
- Lingjun Hao (ORCID: https://orcid.org/0000-0002-1036-9085)
- Jie Dong (ORCID: https://orcid.org/0000-0003-1983-0197)
- Li Le (ORCID: https://orcid.org/0000-0002-4461-5758)
- Haoran Guo (ORCID: https://orcid.org/0000-0001-8244-5545)
- Fangchencan Liu
Institutions
- Shenyang Jianzhu University (CN)
Publication Details
- Published
- 2025-05-23
- DOI
- https://doi.org/10.1109/icetci64844.2025.11084039
- Primary Topic
- Evacuation and Crowd Dynamics
- Type
- article
- Field-Weighted Citation Impact
- 0.00