Fast Path Planning Algorithm for 3D Indoor Scene Roaming Based on Path Table

Automatic roaming of indoor scenes has become a research hotspot in three-dimensional graphics, and its core issue is the rapid generation of roaming paths. This paper proposes an indoor hierarchical roaming path planning algorithm based on path tables to solve the problems of long calculation time and large memory overhead when using the A* algorithm for roaming path planning in large-scale indoor scenes. First, we construct the path table based on the closed characteristics of the indoor room. The path table enables quick discovery of the path from any position in the room to the door. Then, we implement the hierarchical idea and search the roaming path in segments, using the door position as a local target point. We generate and store the path between each door offline to improve the efficiency of path planning. Finally, the Bezier curve is used to smooth the roaming path. Experimental results show that compared with the A* algorithm, our proposed algorithm significantly reduces the number of search nodes, the number of path corners, and path planning time, effectively improving the efficiency of indoor scene roaming path planning.