Application of Dijkstras Algorithm in the Smart Exit Sign

Application of Dijkstra’s Algorithm in the Smart Exit Sign Jehyun Cho, Ghang Lee, Jongsung Won, Eunseo Ryu Pages 224-229 (2014 Proceedings of the 31st ISARC, Sydney, Australia, ISBN 978-0-646-59711-9, ISSN 2413-5844) Abstract: Previous studies on automated fire-egress guidance systems have focused on providing the shortest path information from a specific person at a certain point to the closest exit mostly using a mobile device. This study aims to develop a Smart Exit Sign system that can detect dangerous areas in real time and direct evacuees to the shortest safe evacuation path by dynamically changing the direction signs to the safe egress. The challenge was to provide the shortest safe egress to any evacuees at any point. We have developed a sensor network and algorithm that could exclude unsafe paths and calculate the shortest safe path from multiple starting points to multiple exit points based on Dijkstra’s algorithm—the most commonly used algorithm for finding the shortest path. The validity of the proposed system was tested through simulations of test cases. Keywords: Shortest path algorithm, Evacuation system, Exit sign DOI: https://doi.org/10.22260/ISARC2014/0030 Download fulltext Download BibTex Download Endnote (RIS) TeX Import to Mendeley