An Optimal Path Planning Method for Multistory Buildings

Abstract

The present invention discloses a method for planning an optimal path in a multistory building. The method comprises: using a path network of each story and a story connection as an independent structure; classifying stopping points on a path by story; according to an ascending order of stories, searching for the first story on which a stopping point is distributed, building a single-story structured network, and performing optimal path analysis on the story to obtain an optimal path of the story; acquiring an end point of a former structured optimal path, using the end point as a starting point of analysis of a next structured path; and dynamically building a cross-story structured network story by story, and performing path analysis on other stories on which stopping points are distributed, to obtain a multistory optimal path traversing all the stopping points. According to the method of the present invention, conversion costs between stories, the number of times of elevator taking, and the distance of travel by elevator can be minimized, thereby reducing time costs; the algorithm efficiency is independent of the total number of stories, so that the method is more suitable for large-scale network analysis, and can increase efficiency of cross-story path analysis in a multistory building; and different story conversion rules may be defined according to needs, so that the method is more flexible.

Description

technical field [0001] The invention discloses an optimal route planning method for a multi-storey building, in particular to the indoor cross-floor route analysis of a multi-storey building and a large public building, and belongs to the technical field of route analysis. Background technique [0002] Indoor routing analysis differs from outdoor routing analysis in the three-dimensional space of the interior. The traditional optimal path planning is based on the network connection topology model between nodes, which can also be used in three-dimensional space. For example, Jiyeong Lee abstracts indoor three-dimensional entities (rooms, doors, corridors, etc.) into nodes, and the nodes are connected through horizontal Establish a three-dimensional network connection topology model in the form of a graph with the vertical connection relationship to achieve simple path analysis. Mark Stevens et al. conduct path analysis by establishing a three-dimensional topological relation...

AI Technical Summary

Problems solved by technology

[0003] However, since the network connectivity topology model between nodes expresses the connectivity and connectivity costs between nodes with connectivity weights, there is no space concept, and the path obtained by applying it to three-dimensional space will ignore the spatial position information. The impact of the spatial position information of the floor on the optimal path planning is not considered, resulting in the possibility of "low floor-high floor-middle floor" or "low floor-middle floor-high floor-middle floor" situation, such as figure 1 As shown, the floor sequence is 1-4-2

To avoid this situation, a reasonable weight definition for floor connections (exaggerating the connection cost of floor connections), but based on the global network, will increase the scale of the problem and affect the efficiency of path analysis, especially for high-rise buildings. Obviously not a reasonable approach

Images