@article{ref1,
title="An algorithm for fire evacuation path dynamic planning",
journal="Fire science and technology (Beijing)",
year="2022",
author="Cao, Xianghong and Du, Wei and Wei, Xiaoge and Tong, Shuo",
volume="41",
number="9",
pages="1237-1241",
abstract="In case of fire, the existing evacuation route cannot be changed in real time according to the fire situation, which may lead the escape personnel to the fire site, resulting in greater danger. In this paper, a novel improved ant colony algorithm (NIACA) is proposed for fire evacuation path dynamic planning. Firstly, the initial pheromone concentration was improved by A* algorithm, then the equivalent distance improved heuristic function which was affected by fire factors was proposed, then pheromone updating rules were improved to speed up the optimal path search, and finally the path smoothing strategy was used to process the optimal path. The experimental results show that compared with the original ant colony algorithm, the proposed algorithm reduces the blindness in the early stage of the algorithm, has strong dynamic search ability, can help the algorithmavoid falling into local optimization, can quickly and accurately plan the evacuation path in case of fire, and can quickly and safely evacuate the escape personnel to the safe exit away from the fire site.   http://www.xfkj.com.cn/EN/Y2022/V41/I9/1237<p /> <p>Language: en</p>",
language="zh",
issn="1009-0029",
doi="",
url="http://dx.doi.org/"
}