Modification Of Dijkstra's Algorithm For Safest And Shortest Path During Emergency Evacuation.

Khyrina Airin Fariza, Abu Samah and Burairah, Hussin and Abd Samad, Hasan Basari (2015) Modification Of Dijkstra's Algorithm For Safest And Shortest Path During Emergency Evacuation. Applied Mathematical Sciences, 9 (31). 1531 - 1541. ISSN 1312-885X

[img] Text
Modification of Dijkstras Algorithm for Safest.pdf - Published Version
Restricted to Registered users only

Download (505kB)

Abstract

Intelligent autonomous evacuation navigation (AEN) system manages to solve wayfinding problems during emergency evacuation, especially for those who are not familiar with the building. AEN system is expected to provide independent evacuation navigation through the dynamic signage, which helps occupants navigate to the safest and shortest path towards the nearest exit. It uses modified Dijkstra's algorithm in order to incorporate both aspects and considering the hazardous location. Therefore, this paper presents the methodology used for the modification of Dijkstra's algorithm to find the safest and shortest path. The first modification involved the restriction of floor plan node's direction; and the second modification was blocking the nodes that affected by fire. The example is presented to compare the result obtained using the modified algorithm. Thus, it reveals the effectiveness of the modification in determining the best path for the evacuation process.

Item Type: Article
Subjects: T Technology > T Technology (General)
Divisions: Faculty of Information and Communication Technology > Department of Industrial Computing
Depositing User: Mohd Hannif Jamaludin
Date Deposited: 08 Aug 2016 07:49
Last Modified: 08 Aug 2016 07:49
URI: http://eprints.utem.edu.my/id/eprint/16741
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item