• DocumentCode
    495560
  • Title

    A Path Planning Algorithm of Maintaining CGF Team Formation

  • Author

    Zheng, Yanbin ; Niu, Liping ; Mou, Zhanshng ; Li, Xinyuan

  • Author_Institution
    Coll. of Comput. & Inf. Technol., Henan Normal Univ., Xinxiang, China
  • Volume
    4
  • fYear
    2009
  • fDate
    March 31 2009-April 2 2009
  • Firstpage
    683
  • Lastpage
    686
  • Abstract
    CGF (Computer Generated Forces) team is able to complete complex tasks in a dynamic environment. Path planning is one of the key problems in CGF team research. A path planning algorithm of maintaining CGF team formation, ATPP, is proposed by analyzing CGF team path planning problems. It is a centralized global planning method using improved A* algorithm to get a leaderpsilas path. Through optimizing the leaderpsilas path, the key point table and the formation change table are achieved, by which all non-leader members of team can be obtained. Formation change table can not only make the marching formation change more reasonable, but also decrease the communication throughput required for formation maintenance. Through adjusting the two impact factors in the algorithm, both paths emphasizing on formation and distance are achieved respectively, so that Haopsilas method is improved.
  • Keywords
    mobile robots; path planning; CGF team formation; computer generated forces; path planning algorithm; Algorithm design and analysis; Computer science; Educational institutions; Information technology; Interference; Maintenance engineering; Path planning; Resists; Robustness; Throughput; A* algorithm; CGF Team; Path Plan; Team Formation;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Science and Information Engineering, 2009 WRI World Congress on
  • Conference_Location
    Los Angeles, CA
  • Print_ISBN
    978-0-7695-3507-4
  • Type

    conf

  • DOI
    10.1109/CSIE.2009.495
  • Filename
    5171083