Regresar

A dijkstra-based algorithm for selecting the shortest-safe evacuation routes in dynamic environments (SSER)

Abstract:

In this work is proposed an approach for addressing the problem to find the shortest-safe routes in buildings with many evacuation doors and where the accessibility of internal areas could be changed by different kind of sensors. We present two advantages over the common use of Dijkstra’s algorithm, related to the problem of obtaining evacuation routes: (1) Fast search of the shortest-safe evacuation route to multiple exits with a backward approach and (2) Support to dynamic environments (graph with variable vertex availability). Four Dijkstra-based algorithms were considered in order to evaluate the performance of the proposed approach, achieving short times in evacuation to multiple exits.