Research on Static Global Path-Planning Algorithm of Virtual Animal in the Three-Dimensional Space

The research on motion planning of a virtual agent is very important in computer animation, where path planning is the most representative. In this paper we do an in-depth study about the problem of static and global path planning for three-dimensional virtual animals in the marine environment, constructed the path planning strategy of a fast randomized algorithm. First of all, we carry out a pre-processing on the environment, proposed the new partial random sampling strategy and the sequential connecting strategy, which to generate “roadmap” of three-dimensional free space. And then, we put forward a driven step by step inquiring strategy, analyzed two feature-parameters and time complexity of the inquiring strategy. Finally, the simulation experiments show the effectiveness of algorithm in solving the issue of static and global path planning in three-dimensional.

[1]  Lydia E. Kavraki,et al.  On finding narrow passages with probabilistic roadmap planners , 1998 .

[2]  Lydia E. Kavraki,et al.  Analysis of probabilistic roadmaps for path planning , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[3]  Que Jia A PRM METHOD FOR PATH PLANNING BASED ON HEURISTIC NODE ENHANCING , 2003 .

[4]  Gao Yibo Path Planning Method for Mobile Robot Based on Particle Swarm Algorithm , 2007 .

[5]  Lydia E. Kavraki,et al.  Randomized preprocessing of configuration for fast path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.