• •

### 多层建筑空间的分层最优路径算法实现

1. 华南师范大学地理科学学院, 广州 510631
• 收稿日期:2015-06-29 修回日期:2015-08-17 出版日期:2016-02-10 发布日期:2016-02-04
• 通讯作者: 罗文斐 E-mail:603798255@qq.com;luowenfei@m.scnu.edu.cn
• 作者简介:

作者简介：林浩嘉(1993-),男,广东揭阳人,本科生,主要从事地理信息科学研究。E-mail: 603798255@qq.com

• 基金资助:
国家级大学生创新创业训练计划项目（201410574039）

### Hierarchical Optimal Path Algorithm Based on Multi-Storey Building Space

LIN Haojia(), LUO Wenfei*()

1. School of Geography, South China Normal University, Guangzhou 510631, China
• Received:2015-06-29 Revised:2015-08-17 Online:2016-02-10 Published:2016-02-04
• Contact: LUO Wenfei E-mail:603798255@qq.com;luowenfei@m.scnu.edu.cn

Abstract:

Due to the stratified feature according to the floors in the multi-storey building space, the indoor path analysis is different from the outdoor path analysis, and the impact of floors, such as space location information, should be taken into consideration when the indoor optimal path planning is being carried out. However, the traditional optimal path planning method, which is based on network topology model between nodes, does not incorporate the space concept, which cannot be well applied to indoor path analysis. Aiming at solving the problem of indoor optimal path planning, based on the hierarchical characteristics of multi-storey building space, a structured dynamic network analysis model is put forward and the hierarchical optimal path algorithm is realized in this paper. In the algorithm, the network of each floor and the connections between floors are all regarded as independent structure. Firstly, the set of stops is divided into several sub sets according to the floor-distribution. Then, the stop distribution of the first floor is recorded and the first floor is regarded as the starting floor of the hierarchical optimal path analysis, and the path analysis for two consecutive floors is carried out floor by floor through dynamically constructing the structure network model spanning across every two consecutive floors. After that, the optimal path traversing all stops in the multi-storey building space is obtained. Compared to the traditional optimal path algorithm, the experimental results show that the proposed algorithm can obtain a more reasonable result for path planning, and the time efficiency is significantly improved. In addition, the structured dynamic network analysis model is more flexible, which allows to define specific floor conversion rules based on different requirements. The algorithm can be applied to large public buildings in cities, so that the indoor path analysis can be connected with the outdoor path analysis, making a more comprehensive path analysis.