Optimal escape route acquisition method based on Dijkstra algorithm

An escape path and acquisition method technology, which is applied in the field of optimal escape path acquisition based on Dijkstra algorithm, can solve the problems of low efficiency, complexity, and inconsistency of the algorithm, and achieve the effect of accurate calculation

Inactive Publication Date: 2015-02-04
SHANGHAI MUNICIPAL ELECTRIC POWER CO +2
View PDF7 Cites 15 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

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 s

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Optimal escape route acquisition method based on Dijkstra algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0027] A method for obtaining an optimal escape route based on the Dijkstra algorithm, which is used for fire escape in non-residential buildings, comprising the following steps:

[0028] 1) Obtain fire-prone locations and escape exit locations of non-residential buildings;

[0029] 2) Obtain the node set on the possible escape path according to the location prone to fire and the location of the escape exit;

[0030] 3) According to the node set on the possible escape route, the optimized escape route of each exit is obtained through the Dijkstra algorithm, which specifically includes the following steps:

[0031] 31) Use the fire-prone position and the escape exit position as the starting point O and the end point E of the Dijkstra algorithm;

[0032] 32) Measure the actual distance between the starting point O, the end point E and each node, and draw the node-distance network diagram;

[0033] 33) According to the node-distance network diagram, the optimized escape route c...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

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...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06Q10/04G06Q50/26
CPCG06Q10/047G06Q50/265
Inventor 陈道彪王固萍季彤天刘莉任耀张磊王晓锋王垚顾万里季蓉平
Owner SHANGHAI MUNICIPAL ELECTRIC POWER CO
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap