In this work is proposed an approach for addressing the problem to find the shortest-safe routes in buildings with many evacuation doors.
Dijkstra's algorithm calculates the shortest routes considering a single vertex as source, in the context of this work it is equivalent to a single evacuation ...
Jun 4, 2017 · In this work is proposed an approach for addressing the problem to find the shortest-safe routes in buildings with many evacuation doors and ...
People also ask
What is Dijkstra's algorithm to find the shortest route?
On which technique is Dijkstra's shortest path algorithm based?
What is Dijkstra single source shortest path?
What is Dijkstra's shortest path algorithm using global positioning system?
The model was rigorously benchmarked against a Dijkstra's algorithm-based model, revealing a 3.5% improvement in the number of evacuees evacuated after the ...
Feb 12, 2024 · First, SSER employs a backward approach starting from multiple exits, allowing for fast search of the shortest-safe evacuation route. Second, it ...
A Dijkstra-based algorithm for selecting the Shortest-Safe Evacuation Routes in dynamic environments (SSER). In The 30th. International Conference on ...
Apr 4, 2024 · The model was rigorously benchmarked against a Dijkstra's algorithm-based model, revealing a 3.5% improvement in the number of evacuees ...
Jul 8, 2014 · A sensor network and algorithm that could exclude unsafe paths and calculate the shortest safe path from multiple starting points to ...
Oyola et al. [2] proposed an approach called Safe and Short Evacuation Routes (SSER) by using. Dijkstra-based algorithm to address the issue of finding the ...
The Dijkstra algorithm is used in this study. It consists of exploring the shortest path, which starts from an origin node to all related nodes, growing ...