Optimal escape route acquisition method based on Dijkstra algorithm

Abstract

The invention relates to an optimal escape route acquisition method based on a Dijkstra algorithm. The optimal escape route acquisition method is used for fire escape in a non-resident building and includes the steps: 1) acquiring positions easily generating fire and escape exit positions of the non-resident building; 2) acquiring node sets on possible escape routes according to the positions easily generating fire and the escape exit positions; 3) acquiring optimal escape routes of exits through the Dijkstra algorithm according to the node sets on the possible escape routes; 4) selecting the optimal escape route in the optimal escape routes of the exits according to data information acquired by sensors in the non-resident building. Compared with the prior art, the optimal escape route acquisition method has the advantages of comprehensiveness in consideration, accuracy in calculation and the like.

Description

technical field [0001] The invention relates to a method for obtaining an escape route, in particular to a method for obtaining an optimal escape route based on a Dijkstra algorithm. Background technique [0002] Dijkstra's algorithm is a typical single-source shortest path algorithm, which is used to calculate the shortest path from one node to all other nodes. The main feature is that the starting point is the center and expands outward layer by layer until it reaches the end point. [0003] At present, there are many common algorithms for escape routes, such as SPFA algorithm, Floyd-Warshall algorithm, etc., but some of these algorithms are relatively inefficient and some are very complicated, and cannot be flexibly applied to these actual projects. The shortest distance from a single source, and our non-residential buildings generally have multiple safety exits, which is not realistic and does not take into account the reality on the path. If the shortest path is blindl...

AI Technical Summary

Problems solved by technology

[0003] At present, there are many common algorithms for escape routes, such as SPFA algorithm, Floyd-Warshall algorithm, etc., but some of these algorithms are relatively inefficient and some are very complicated, and cannot be flexibly applied to these actual projects. The shortest distance from a single source, and our non-residential buildings generally have multiple safety exits, which is not realistic and does not take into account the reality on the path. If the shortest path is blindly selected and the real-time information on the path is ignored, then it is very could cause serious damage

Images