Coordinated target assignment and intercept for unmanned air vehicles

被引:497
作者
Beard, RW [1 ]
McLain, TW
Goodrich, MA
Anderson, EP
机构
[1] Brigham Young Univ, Dept Elect & Comp Engn, Provo, UT 84602 USA
[2] Brigham Young Univ, Dept Mech Engn, Provo, UT 84602 USA
[3] Brigham Young Univ, Dept Comp Sci, Provo, UT 84602 USA
来源
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION | 2002年 / 18卷 / 06期
关键词
cooperation; multiagent coordination; path planning; trajectory generation; unmanned air vehicles;
D O I
10.1109/TRA.2002.805653
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper presents an end-to-end solution to the cooperative control problem represented by the scenario where M unmanned air vehicles (UAVs) are assigned to transition through N known target locations in the presence of dynamic threats. The problem is decomposed into the subproblems of: 1) cooperative target assignment; 2) coordinated UAV intercept; 3) path planning; 4) feasible trajectory generation; and 5) asymptotic trajectory following. The design technique is based on a hierarchical approach to coordinated control. Simulation results are presented to demonstrate the effectiveness of the approach.
引用
收藏
页码:911 / 922
页数:12
相关论文
共 30 条
  • [1] ANDERSON EP, 2002, THESIS BRIGHAM YOUNG
  • [2] [Anonymous], 2000, Geometry, Spinors and Applications
  • [3] Behavior-based formation control for multirobot teams
    Balch, T
    Arkin, RC
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 1998, 14 (06): : 926 - 939
  • [4] BEARD R, 1998, P AIAA GUID NAV CONT, P677
  • [5] BORNDORFER R, 1997, P INT S MATH PROGR L
  • [6] BRANDT F, 2000, P COOP INF AG CIA 20, P95
  • [7] BURKARD RE, 1999, SELECTED TOPICS ASSI
  • [8] Chandler P., 2000, AIAA GUID NAV CONTR
  • [9] Near-time-optimal trajectory planning for wheeled mobile robots with translational and rotational sections
    Choi, JS
    Kim, BK
    [J]. IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (01): : 85 - 90
  • [10] Finding the k shortest paths
    Eppstein, D
    [J]. SIAM JOURNAL ON COMPUTING, 1998, 28 (02) : 652 - 673