Emergency Escape Routing and Evacuation using Bellman Ford’s Algorithm 
Baby D. Dayana1, Shiv Pratap Singh2, Shraman Das3, Pankaj Gautam4
1Baby D Dayana*, Assistant Professor, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Tamil Nadu, India.
2Shraman Das, Student, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Tamil Nadu, India.
3Shiv Pratap Singh, Student, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Tamil Nadu, India.
4Pankaj Gautam, Student, Department of Computer Science and Engineering, SRM Institute of Science and Technology, Tamil Nadu, India.
Manuscript received on June 08, 2020. | Revised Manuscript received on June 25, 2020. | Manuscript published on June 30, 2020. | PP: 1349-1352 | Volume-9 Issue-5, June 2020. | Retrieval Number: A1775109119/2020©BEIESP | DOI: 10.35940/ijeat.A1775.069520
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Evacuation Technique which addresses routing the populaces within the endangered architecture to the bordering emergency-exit points minimizing the mortality rate and avoiding hazards and obstacles at the same time.The fundamental magnitude would be to minimize the risk of total mortality during an emergency condition.The superlative case scenario would be to relinquish all individuals with smidgeon panic and naught transience tempo.This scrutiny will lessen the evacuation time factor by using the deluxe appropriate algorithm available for the shortest path prediction with all of the constraints.
Keywords: Bellman Ford’s Algorithm, Emergency evacuation,Iot for evacuation,Raspberry Pi,Shortest path planning.