Path Planning for Virtual Human Motion Using Improved A Star Algorithm

Calculating and generating optimal motion path automatically is one of the key issues in virtual human motion path planning. To solve the point, the improved A* algorithm has been analyzed and realized in this paper, we modified the traditional A* algorithm by weighted processing of evaluation funct...

Full description

Saved in:
Bibliographic Details
Published in2010 Seventh International Conference on Information Technology: New Generations pp. 1154 - 1158
Main Authors Junfeng Yao, Chao Lin, Xiaobiao Xie, Wang, Andy Juan, Chih-Cheng Hung
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.04.2010
Subjects
Algorithm design and analysis
Chaos
Cost function
Evaluation Function
Humans
Improved A Algorithm
Information technology
Manual Searching Marker
Navigation
Path Optimization
Path planning
Software algorithms
Software engineering
Virtual reality
Online AccessGet full text
ISBN9781424462704
1424462703
DOI10.1109/ITNG.2010.53

Cover

More Information
Summary:Calculating and generating optimal motion path automatically is one of the key issues in virtual human motion path planning. To solve the point, the improved A* algorithm has been analyzed and realized in this paper, we modified the traditional A* algorithm by weighted processing of evaluation function, which made the searching steps reduced from 200 to 80 and searching time reduced from 4.359s to 2.823s in the feasible path planning. The artificial searching marker, which can escape from the barrier trap effectively and quickly, is also introduced to avoid searching the invalid region repeatedly, making the algorithm more effective and accurate in finding the feasible path in unknown environments. We solve the issue of virtual human's obstacle avoidance and navigation through optimizing the feasible path to get the shortest path.
ISBN:9781424462704
1424462703
DOI:10.1109/ITNG.2010.53