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

Institutions

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
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Evacuation Path Planning Method for Building Fire with ASRRT-MCACO Collaborative Optimization

Lingjun Hao, Jie Dong, Li Le, Haoran Guo et al.
Evacuation and Crowd Dynamics
article

Dynamic Evacuation Path Planning Method for Building Fire with ASRRT-MCACO Collaborative Optimization

Lingjun Hao, Jie Dong, Li Le, Haoran Guo, Fangchencan Liu
article en

Abstract

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.

Shenyang Jianzhu University (CN)
Climate action
Openalex Percentile: Top 78%
Evacuation and Crowd Dynamics
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.