An Efficient and Practical Three-Dimensional Path Finding Algorithm in 3D Games

• Main Authors: Hsieh, Ping-Han, 謝秉翰
• Other Authors: K. Robert Lai
• Format: Others
• Language: en_US
• Published: 2005
• Online Access: http://ndltd.ncl.edu.tw/handle/20749935405287194561

碩士 === 元智大學 === 資訊工程學系 === 93 === 3D game is a virtual environment that is constructed with various objects. 3D navigation is one kind of virtual environment technology that can be used as an aid to designers of complex spatial arrangements. Path finding in 3D navigation is to locate an object or route and travel to it. A* algorithm has long been used for searching or path finding purpose. However, the number of graph nodes need to be searched in a three-dimensional environment is much greater than in a two-dimensional environment so that A* will be extremely slow. This makes applying A* search into three-dimensional spaces become not practical. In this thesis we develop a multi-layer map structure to construct the three-dimensional virtual environment with less storage resources and cooperate with our stair-search algorithm which is based on A* search. Furthermore, we also employ Breadth-First-Search-scope(BFS-scope) and path smoothing technique to make the found path more reasonable. According to the simulation results, we demonstrate that our multi-layer map structure can describe the virtual environment precisely as in 3D axes but using less storage spaces. When reducing the storage resources, we still maintain great performance without sacrificing the computing time. Our algorithm improves the utility rate substantially so that it can increase the performance to the navigation process.