Systems Engineering and Electronics ›› 2026, Vol. 48 ›› Issue (2): 535-544.doi: 10.12305/j.issn.1001-506X.2026.02.15

• Systems Engineering • Previous Articles    

Research on three-dimensional A* path planning algorithm for multi-floor complex structures

Weiye TIAN1(), Yutao CHEN2,*, Yong XIE1, Congwei HE1   

  1. 1. School of Artificial Intelligence and Automation,Huazhong University of Science and Technology,Wuhan 430074,China
    2. School of Power Engineering,Naval University of Engineering,Wuhan 430030,China
  • Received:2024-11-13 Revised:2025-03-31 Online:2025-06-11 Published:2025-06-11
  • Contact: Yutao CHEN E-mail:15338601299@163.com

Abstract:

In order to solve the path planning problem in the case of complex multi-floor structures and local disconnection, a three-dimensional A* path planning algorithm for multi- floor complex structures is proposed. Firstly, the multi-floor complex structures are transformed into undirected weighted graph, and the mathematical model of path planning for multi-floor complex structures are established for minimizing the total weight of the path. Secondly, considering the connection between different levels and local disconnectedness within levels, a multi-floor unidirectional navigation heuristic strategy and a cross-level bidirectional routing heuristic strategy are designed, respectively. Based on the two heuristic strategies, a novel three-dimensional A* path planning algorithm is proposed. Finally, the proposed algorithm is compared with traditional A* algorithm, bidirectional A* algorithm and Dijkstra algorithm. The experimental results show that the proposed algorithm can effectively handle the path planning of complex multi-floor structures and local disconnection problems, and has superior performance in terms of convergence speed and solution quality compared to the comparison algorithms.

Key words: path planning, multi-floor structures, local disconnection, A* algorithm

CLC Number: 

[an error occurred while processing this directive]