摘要： 提出了虚拟人在3D障碍环境中进行漫游的路径规划算法，该算法以虚拟环境的表示为基础。首先，把虚拟环境离散化为3D单元格，用八叉树表示由此形成的环境图；然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。算法的可行性和有效性经过了实验验证。

关键词: 虚拟人, 漫游, 路径规划

Abstract: This paper presents a path planning algorithm about virtual human walkthrough in 3D obstacles environments, which is based on the representation of virtual environments. First, the environment is discretized into 3D grid of uniform cells and the generated environment map is represented by an octree. Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments. The feasibility and effectiveness of the algorithm is demonstrated by experiments.

中图分类号: 

• TP391.9