Computer Science and Information Engineering, World Congress on (2009)
Los Angeles, California USA
Mar. 31, 2009 to Apr. 2, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CSIE.2009.495
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 leader’s path. Through optimizing the leader’s 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 Hao’s method is improved.
CGF Team, Team Formation, Path Plan, A* algorithm
Yanbin Zheng, Zhanshng Mou, Xinyuan Li, Liping Niu, "A Path Planning Algorithm of Maintaining CGF Team Formation", Computer Science and Information Engineering, World Congress on, vol. 04, no. , pp. 683-686, 2009, doi:10.1109/CSIE.2009.495