TY - GEN
T1 - An improved algorithm for motion graph and its application in intelligent obstacle avoidance
AU - Chen, Dongming
AU - Gong, Guanghong
AU - Song, Xiao
AU - Han, Liang
AU - Huang, Xuelin
PY - 2010
Y1 - 2010
N2 - For a deficiency of classic algorithm in constructing motion graph, we propose an improved algorithm and further apply motion graph to the intelligent obstacle avoidance of virtual human. First of all, we introduce an approach for acquiring real human motion data by our active optical motion capture system and solving some related problems we have encountered. Secondly, we present and analyze the classic algorithm in constructing motion graph, and propose an improved algorithm to enhance its low computational efficiency, which accelerates the construction of motion graph. Finally, we apply motion graph to intelligent obstacle avoidance; we propose a novel algorithm to generate a suitable path, avoiding obstacles; then we use the classic motion graph search algorithm to synthesize a matched motion, driving the virtual human to walk along the planned path. Experiments we conducted verify the correctness and feasibility of the proposed algorithms.
AB - For a deficiency of classic algorithm in constructing motion graph, we propose an improved algorithm and further apply motion graph to the intelligent obstacle avoidance of virtual human. First of all, we introduce an approach for acquiring real human motion data by our active optical motion capture system and solving some related problems we have encountered. Secondly, we present and analyze the classic algorithm in constructing motion graph, and propose an improved algorithm to enhance its low computational efficiency, which accelerates the construction of motion graph. Finally, we apply motion graph to intelligent obstacle avoidance; we propose a novel algorithm to generate a suitable path, avoiding obstacles; then we use the classic motion graph search algorithm to synthesize a matched motion, driving the virtual human to walk along the planned path. Experiments we conducted verify the correctness and feasibility of the proposed algorithms.
UR - https://www.scopus.com/pages/publications/78649580455
U2 - 10.1109/ICCASM.2010.5619226
DO - 10.1109/ICCASM.2010.5619226
M3 - 会议稿件
AN - SCOPUS:78649580455
SN - 9781424472369
T3 - ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
SP - V5273-V5278
BT - ICCASM 2010 - 2010 International Conference on Computer Application and System Modeling, Proceedings
T2 - 2010 International Conference on Computer Application and System Modeling, ICCASM 2010
Y2 - 22 October 2010 through 24 October 2010
ER -