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

郑延斌; 赵沁平

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

北京航空航天大学计算机学院, 北京 100191

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

详细信息

作者简介:
郑延斌(1964－),男,河南内乡人,博士生,zybcgf@163.com.

中图分类号: TP 391
计量
- 文章访问数: 3015
- HTML全文浏览量: 115
- PDF下载量: 959
- 被引次数: 0
出版历程
- 收稿日期: 2008-01-04
- 网络出版日期: 2008-06-30

Team autonomous entity path planning algorithm TAEPP

School of Computer Science and Technology, Beijing University of Aeronautics and Astronautics, Beijing 100191, China

摘要

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

HTML全文

参考文献(1)

[1] 梁晓辉. 计算机生成角色行为建模研究 . 北京:北京航空航天大学,计算机学院,2002 Liang Xiaohui. The research on human behavior representation of computer generated actor .Beijing:School of Computer, Beijing University of Aeronautics and Astronautics, 2002(in Chinese) [2] Cao Y U, Fukunage A S,Kahng A B. Cooperative mobile robotics:antecedents and directions Published in Autonomous Robots,1997,4(1):7-27 [3] Bennewitz M, Burgad W, Thrun S. Optimizing schedules for prioritized path planning of multi-robot systems[J]. Proc Int Conf on Robotics and Automation ,2001,1:271-276 [4] Hogg R W, Rankin A L, Romelitis S I. et al. Algorithms and sensors for small robot path following Proc 2002 IEEE Int Conf on Robotics and Automation. Washington D C:2002:3850-3857 [5] Reynolds C W. Flocks birds and schools:a distributed behavioral model[J]. Computer Graphics, 1987, 21(4):25-34 [6] Anthony Lewis M, Tan K H. High precision formation control of mobile robots using virtual structures autonomous [J]. Autonomous Robots, 1997,4:387-403 [7] Kamphuis A, Overmars M H. Finding paths for coherent groups using clearance In Eurogaphics /ACM SIGGRAPH Symposium on Computer Animation,2004:19-28 [8] Tabuada P,Pappas G J,Lima P. Motion feasibility of multi-agent formations [J]. IEEE Transactions on Robotics, 2005, 21(3):387-391 [9] Hao Yongxing, Agrawal S K. Planning and control of UGV formations in a dynamic environment:a practical framework with experiments[J]. Robotics and Autonomous Systems, 2005,51:101-110 [10] 王凤林. 坦克兵营连战术教程[M]. 北京:国防工业出版社, 1991 Wang Fenglin. The course for tank camp tactics[M]. Beijing:National Defence Industry Press,1991(in Chinese) [11] 赵沁平. DVENET分布式虚拟现实应用系统运行平台与开发工具[M].北京:科学出版社,2005 Zhao Qinping. DVENET distributed virtual environment applacation system runtime platform and development tools[M]. Beijing:Science Press,2005(in Chinese)

施引文献

资源附件(0)

访问统计