• DocumentCode
    531968
  • Title

    An improved algorithm for motion graph and its application in intelligent obstacle avoidance

  • Author

    Chen, Dongming ; Gong, Guanghong ; Song, Xiao ; Han, Liang ; Huang, Xuelin

  • Author_Institution
    Sch. of Autom. Sci. & Electr. Eng., Beijing Univ. of Aeronaut. & Astronaut., Beijing, China
  • Volume
    5
  • fYear
    2010
  • fDate
    22-24 Oct. 2010
  • Abstract
    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.
  • Keywords
    collision avoidance; computer animation; graph theory; image motion analysis; virtual reality; intelligent obstacle avoidance; motion graph; optical motion capture system; virtual human; Algorithm design and analysis; Animation; Computational efficiency; Computational modeling; Hip; Neck; Intelligent Obstacle Avoidance; Motion Capture; Motion Graphs; Motion Synthesis; Path Planning;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Application and System Modeling (ICCASM), 2010 International Conference on
  • Conference_Location
    Taiyuan
  • Print_ISBN
    978-1-4244-7235-2
  • Electronic_ISBN
    978-1-4244-7237-6
  • Type

    conf

  • DOI
    10.1109/ICCASM.2010.5619226
  • Filename
    5619226