Cooperative Path Following of Multiple Multirotors Over Time-Varying Networks

被引:50
作者
Cichella, Venanzio [1 ]
Kaminer, Isaac [2 ]
Dobrokhodov, Vladimir [2 ]
Xargay, Enric [1 ]
Choe, Ronald [1 ]
Hovakimyan, Naira [1 ]
Aguiar, A. Pedro [3 ]
Pascoal, Antonio M. [4 ]
机构
[1] Univ Illinois, Coordinated Sci Lab, Urbana, IL 61801 USA
[2] Naval Postgrad Sch, Dept Mech & Aerosp Engn, Monterey, CA 93943 USA
[3] Univ Porto FEUP, Dept Elect & Comp Engn, Fac Engn, P-4099002 Oporto, Portugal
[4] Univ Lisbon, ISR, IST, P-1649004 Lisbon, Portugal
关键词
Consensus algorithms; networked systems; time-coordinated path following; VEHICLES; SWARM; COORDINATION; TRACKING;
D O I
10.1109/TASE.2015.2406758
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses the problem of time-coordination of a team of cooperating multirotor unmanned aerial vehicles that exchange information over a supporting time-varying network. A distributed control law is developed to ensure that the vehicles meet the desired temporal assignments of the mission, while flying along predefined collision-free paths, even in the presence of faulty communication networks, temporary link losses, and switching topologies. In this paper, the coordination task is solved by reaching consensus on a suitably defined coordination state. Conditions are derived under which the coordination errors converge to a neighborhood of zero. Simulation and flight test results are presented to validate the theoretical findings. Note to Practitioners-This paper presents an approach which enables a fleet of multirotor UAVs to follow a set of desired trajectories and coordinate along them, thus satisfying specific spatial and temporal assignments. The proposed solution can be employed in applications in which multiple vehicles are tasked to execute cooperative, collision-free maneuvers, and accomplish a common goal in a safely manner. An example is sequential monitoring, in which the UAVs have to visit and monitor a set of points of interest, while maintaining a desired temporal separation between each other. In this paper, we also simulate a scenario in which the vehicles, positioned in a square room, are required to exchange position with each other. It is shown that the proposed control algorithm not only ensures that the UAVs arrive at the final destinations at the same time, but also guarantees safety, i.e., the vehicles avoid collision with each other at all times.
引用
收藏
页码:945 / 957
页数:13
相关论文
共 34 条
[1]   One-to-One Coordination Algorithm for Decentralized Area Partition in Surveillance Missions with a Team of Aerial Robots [J].
Acevedo, Jose J. ;
Arrue, Begona C. ;
Miguel Diaz-Banez, Jose ;
Ventura, Inmaculada ;
Maza, Ivan ;
Ollero, Anibal .
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2014, 74 (1-2) :269-285
[2]   Performance limitations in reference tracking and path following for nonlinear systems [J].
Aguiar, A. Pedro ;
Hespanha, Joao P. ;
Kokotovic, Petar V. .
AUTOMATICA, 2008, 44 (03) :598-610
[3]  
[Anonymous], 1993, Algebraic Graph Theory
[4]   Passivity as a design tool for group coordination [J].
Arcak, Murat .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2007, 52 (08) :1380-1390
[5]   Decentralized multi-robot cooperation with auctioned POMDPs [J].
Capitan, Jesus ;
Spaan, Matthijs T. J. ;
Merino, Luis ;
Ollero, Anibal .
INTERNATIONAL JOURNAL OF ROBOTICS RESEARCH, 2013, 32 (06) :650-671
[6]  
Choe R., 2013, AIAA INF AER C BOST
[7]  
Cichella V., 2013, IFAC WORKSH RED UAS
[8]  
Cichella V, 2012, IEEE DECIS CONTR P, P1776, DOI 10.1109/CDC.2012.6425933
[9]   Formation constrained multi-agent control [J].
Egerstedt, M ;
Hu, XM .
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, 2001, 17 (06) :947-951
[10]   Swarm aggregations using artificial potentials and sliding-mode control [J].
Gazi, V .
IEEE TRANSACTIONS ON ROBOTICS, 2005, 21 (06) :1208-1214