Adaptive cooperative path planning for multiple platforms

被引:0
作者
Chen, G. [1 ]
Kwan, C. [1 ]
Shen, D. [2 ]
Cruz, J. B., Jr. [2 ]
Vannevel, A. [3 ]
机构
[1] Intelligent Automat Inc, Rockville, MD 20855 USA
[2] Ohio State Univ, Columbus, OH 43210 USA
[3] US Navy, Washington, DC USA
来源
2005 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND BIOMIMETICS | 2006年
关键词
path planning; foraging; Pareto; Voronoi diagram;
D O I
暂无
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
In this paper, we first propose a general architecture for path planning and mission planning for multiple unmanned platforms that may include aircraft and robots. Second, a novel path planning method based on Pareto Foraging has been implemented and evaluated. Our Pareto solution serves as a reference trajectory for the Foraging algorithm, which further refines the reference path. Third, extensive experiments and comparative studies have been carried out. In particular, we compared our algorithm with the Voronoi diagram and Dijkstra's algorithm.
引用
收藏
页码:168 / +
页数:2
相关论文
共 10 条
  • [1] [Anonymous], NETWORK FLOWS THEORY
  • [2] BARSAR T, 1995, DYNAMIC NONCOOPERATI
  • [3] *BOEING, 2003, US GUID OP EXP PLATF
  • [4] BOROUJERDI AC, JOINT ROUTING NETWOR
  • [5] BORTOFF SA, 1999, PATH PLANNING UNMANN
  • [6] MCLAIN TW, 2000, AIAA20004369
  • [7] Passino K. M., 2004, BIOMIMICRY OPTIMIZAT
  • [8] RICHARD A, 2002, AIAA GUID NAV CONTR
  • [9] SHEN D, 2005, UNPUB GAME THEORETIC
  • [10] FAST COMPUTATION OF OPTIMAL PATHS USING A PARALLEL DIJKSTRA ALGORITHM WITH EMBEDDED CONSTRAINTS
    SOLKA, JL
    PERRY, JC
    POELLINGER, BR
    ROGERS, GW
    [J]. NEUROCOMPUTING, 1995, 8 (02) : 195 - 212