Path planning algorithm based on grid method for virtual human
Yamin Sun · Jisuanji gongcheng yu sheji · 2008
Using Dijkstra's algorithm to search an optimal path in a gird has many disadvantages.For example,it requires a large number of canculate and must to consider too many neighboring nodes during a node expansion step.The structure of a grid implicitly decides that,the minimum angle between any two connected lines within an optimal path on a grid is 90 degrees.A simple technique is presented to speed up optimal path planning on grid,and to generate global motion paths for a human model in virtual environments.The feasibility and effectiveness of the algorithm is demonstrated by experiments.