北京航空航天大学学报 ›› 2008, Vol. 34 ›› Issue (06): 656-660.

• 论文 • 上一篇    下一篇

一种团队自治实体路径规划算法TAEPP

郑延斌, 赵沁平   

  1. 北京航空航天大学 计算机学院, 北京 100191
  • 收稿日期:2008-01-04 出版日期:2008-06-30 发布日期:2010-09-17
  • 作者简介:郑延斌(1964-),男,河南内乡人,博士生,zybcgf@163.com.
  • 基金资助:

    国家863计划资助项目(2006AA01Z333)

Team autonomous entity path planning algorithm TAEPP

Zheng Yanbin, Zhao Qinping   

  1. School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100191, China
  • Received:2008-01-04 Online:2008-06-30 Published:2010-09-17

摘要: 对团队自治实体的路径规划问题进行了分析,提出了一种团队自治实体路径规划算法TAEPP(Team Autonomous Entity Path Planning).该算法是一种集中式的全局规划方法,使用改进的A*算法得到团队中Leader成员的路径,通过对Leader路径的优化得到关键点表和队形转换表,利用关键点表和队形转换表得到团队中非Leader成员的路径.队形转换表可以使行进中的队形变换更合理,减少了队形维护时需要的通信量.通过调整算法中的2个影响因子,可以分别得到侧重于队形和侧重于距离的路径.试验结果验证了TAEPP算法的合理性和有效性.

Abstract: Through analyzing of team autonomous entity path planning problem, a path planning algorithm TAEPP (Team Autonomous Entity Path Planning) was proposed. It is a centralized global planning method. Using mended A* algorithm ,can get path for team leader, and through optimizing,the table of key points and the table of formation changing were achieved, so paths for all non-leader members could be found. Formation changing table made the formation change more reasonable, and decreased the required communication numbers in formation maintaining. Through adjusting the two parameters in the algorithm, different paths emphasized on formation and emphasized on distance would be found. The results of experiment show that TAEPP algorithm can provide more reasonable and more efficacious paths for every member in team, according to the environment and team formations.

中图分类号: 


版权所有 © 《北京航空航天大学学报》编辑部
通讯地址:北京市海淀区学院路37号 北京航空航天大学学报编辑部 邮编:100191 E-mail:jbuaa@buaa.edu.cn
本系统由北京玛格泰克科技发展有限公司设计开发