摘要
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.
| 源语言 | 英语 |
|---|---|
| 页(从-至) | 656-660 |
| 页数 | 5 |
| 期刊 | Beijing Hangkong Hangtian Daxue Xuebao/Journal of Beijing University of Aeronautics and Astronautics |
| 卷 | 34 |
| 期 | 6 |
| 出版状态 | 已出版 - 6月 2008 |
指纹
探究 'Team autonomous entity path planning algorithm TAEPP' 的科研主题。它们共同构成独一无二的指纹。引用此
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver