Abstract
An emergency requiring evacuation is a chaotic event, filled with uncertainties both for the people affected and rescuers. The evacuees are often left to themselves for navigation to the escape area. The chaotic situation increases when predefined escape routes are blocked by a hazard, and there is a need to re-think which escape route is safest. This paper addresses automatically finding the safest escape routes in emergency situations in large buildings or ships with imperfect knowledge of the hazards. The proposed solution, based on Ant Colony Optimisation, suggests a near optimal escape plan for every affected person — considering dynamic spread of fires, movability impairments caused by the hazards and faulty unreliable data. Special focus in this paper is on empirical tests for the proposed algorithms. This paper brings together the Ant Colony approach with a realistic fire dynamics simulator, and shows that the proposed solution is not only able to outperform comparable alternatives in static and dynamic environments, but also in environments with realistic spreading of fire and smoke causing fatalities. The aim of the solutions is usage by both individuals, such as from a personal smartphone of one of the evacuees, or for emergency personnel trying to assist large groups from remote locations.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.Notes
SmartRescue: http://ciem.uia.no/project/smartrescue
This is not to be confused with that hazard propagations are ignored. In fact, paper shows that even without the complicated hazard propagations, the learning algorithms learn and predict the hazards.
Note that radiation in this paper refers to thermal radiation emitted by fire, and should not be confused with any other form of radiation such as nuclear radiation.
Many additional experiments have been carried out. For reasons of brevity, only those more relevant are presented in this paper. Some of the additional experiment results are available in [23].
Note that for the static environment the variants of h(v i ,t) used is h 1(v i ,t).
An outline of the Thompson Spirit is available at http://www.iglucruise.com/thomson-spirit/deck-plans?deck=83.
Two other simulations were carried out with similar setup but with fires starting in the corner of the first floor and the middle of the second floor. The results were similar to those shown in this paper — and are therefore left out.
The ants do not have any knowledge of the spread of the fire other than what they observe through the function h(v i ,t), so “best” means most viable seen from the small windows available from the ants. In practice, data from fixed and mobile fire sensors will populate h(v i ,t).
References
Li Q, Rus D (2005) Navigation protocols in sensor networks. ACM Trans Sens Netw (TOSN) 1(1):3–35
Li Q, De Rosa M, Rus D (2003) Distributed algorithms for guiding navigation across a sensor network. In: Proceedings of the 9th annual international conference on Mobile computing and networking. ACM, pp 313–325
Radianti J, Granmo OC, Bouhmala N, Sarshar P, Yazidi A, Gonzalez J (2013) Crowd models for emergency evacuation: a review targeting human-centered sensing. In: Proceedings of the 2013 46th Hawaii International Conference on System Sciences (HICSS). IEEE, pp 156–165
Thompson PA, Marchant EW (1995) A computer model for the evacuation of large building populations. Fire Saf J 24(2):131–148
Thompson PA, Marchant EW (1995) Testing and application of the computer model simulex. Fire Safety Journal 24(2):149–166
Hamacher H, Tjandra S (2002) Mathematical modelling of evacuation problems — a state of the art. Pedestrian and Evacuation Dynamics 2002:227–266. http://www.springer.com/mathematics/applications/book/978-3-540-42690-5
Kim D, Shin S (2006) Local path planning using a new artificial potential function composition and its analytical design guidelines. Adv Robot 20(1):115–135
Braun A, Bodmann B, Musse S (2005) Simulating virtual crowds in emergency situations. ACM, pp 244–252
Li F.Y., Kure Ø. (2005) Optimal physical carrier sensing range in multirate wireless ad hoc networks: analytical versus realistic In: Wireless conference 2005-next generation wireless and mobile communications and services (European Wireless), 11th European, VDE, pp 1–7
Liu S, Yang L, Fang T, Li J (2009) Evacuation from a classroom considering the occupant density around exits. Phys A: Statistical Mechanics and its Applications 388(9):1921–1928
Wang J, Lo S, Sun J, Wang Q, Mu H (2012) Qualitative simulation of the panic spread in large-scale evacuation. Simulation
Helbing D, Farkas I, Vicsek T (2000) Simulating dynamical features of escape panic. Nature 407(6803):487–490
Jin T (2002) Visibility and human behavior in fire smoke. In: DiNenno PJ, Drysdale D, Beyler CL, Walton WD, Custer RLP, Hall JR Jr, Watts JM Jr (eds)The SFPE handbook of fire protection engineering, 3rd edn. Society of Fire Protection Engineers/National Fire Protection Association, Quincy, Massachusetts
Purser D (2008) Assessment of hazards to occupants from smoke, toxic gases, and heat. In: SFPE handbook of fire protection engineering, vol 4, pp 2–96
HSEIndicative human vulnerability to the hazardous agents present offshore for application in risk assessment of major accidents. Online: Accessed 10 Dec 2013
Dorigo M, Birattari M, Stutzle T (2006) Ant colony optimization. IEEE Comput Intell Mag 1(4):28–39
Gutjahr W. (2000) A graph-based ant system and its convergence. Futur Gener Comput Syst 16(8):873–888
Liu B, Abbas H, McKay B (2003) Classification rule discovery with ant colony optimization, vol 2003. IEEE, pp 83–88
Abolhasan M, Wysocki T, Dutkiewicz E (2004) A review of routing protocols for mobile ad hoc networks. Ad Hoc Netw 2(1):1–22
Dorigo M, Stützle T (2010) Ant colony optimization: overview and recent advances.Handbook of metaheuristics, pp 227–263
Ducatelle F, Di Caro G, Gambardella L (2006) An analysis of the different components of the anthocnet routing algorithm.Ant Colony Optimization and swarm intelligence, pp 37–48
Murtala Zungeru A, Ang L (2012) Performance evaluation of ant-based routing protocols for wireless sensor networks
Goodwin M, Granmo OC, Radianti J, Sarshar P, Glimsdal S (2013) Ant colony optimisation for planning safe escape routes. In: Recent trends in applied artificial intelligence. Springer, pp 53–62
Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271
Di Caro G, Dorigo M (2011). Antnet: distributed stigmergetic control for communications networks. arXiv preprint arXiv:1105.5449
Di Caro G, Ducatelle F, Gambardella L (2005) Anthocnet: an adaptive nature-inspired algorithm for routing in mobile ad hoc networks. Eur Trans Telecommun 16(5):443–455
Dressler F, Koch R, Gerla M (2012) Path heuristics using aco for inter-domain routing in mobile ad hoc and sensor networks.Bio-inspired models of network, information, and computing systems, pp 128–142
Selvan G, Pothumani S, Manivannan R, Senthilnayaki R, Balasubramanian K (2012) Weakness recognition in network using aco and mobile agents. In: 2012 International Conference on Advances in Engineering, Science and Management (ICAESM). IEEE, pp 459–462
McGrattan K, Forney GP (2008) Fire dynamics simulator (version 5), user’s guide, vol 1019. NIST special publication, pp 1–186
Chow WK (1995) Use of computational fluid dynamics for simulating enclosure fires. J Fire Sci 13(4):300–334
Author information
Authors and Affiliations
Corresponding author
Additional information
Preliminary versions of some of the results of this paper appeared in the Proceedings for 26th International Conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems, IEA/AIE 2013.
Rights and permissions
About this article
Cite this article
Goodwin, M., Granmo, OC. & Radianti, J. Escape planning in realistic fire scenarios with Ant Colony Optimisation. Appl Intell 42, 24–35 (2015). https://doi.org/10.1007/s10489-014-0538-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10489-014-0538-9