Formation Control of Quadrotor Helicopters with Guaranteed Collision Avoidance via Safe Path

In this article we propose a hierarchical control structure for multi-agent systems. The main objective is to perform formation change manoeuvres, with guaranteed safe distance between each two vehicles throughout the whole mission. The key components that ensure safety are a robust control algorithm that is capable of stabilising the group of vehicles in a desired formation and a higher level path generation method that provides safe paths for all the vehicles, based on graph theoretic considerations. The method can efficiently handle a large group of any type of vehicles. In the article we focus on the control of quadrotor UAVs, thus the results are illustrated in 4D on a group of such vehicles.

[1]  P. Massioni Decomposition methods for distributed control and identification , 2010 .

[2]  Herbert Werner,et al.  A robust control approach to formation control , 2009, 2009 European Control Conference (ECC).

[3]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[4]  Pablo San Segundo,et al.  An improved bit parallel exact maximum clique algorithm , 2013, Optim. Lett..

[5]  Béla Lantos,et al.  Backstepping based control design with state estimation and path tracking to an indoor quadrotor helicopter , 2009 .

[6]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[7]  Richard M. Murray,et al.  Information flow and cooperative control of vehicle formations , 2004, IEEE Transactions on Automatic Control.

[8]  Nagiza F. Samatova,et al.  A scalable, parallel algorithm for maximal clique enumeration , 2009, J. Parallel Distributed Comput..

[9]  Francesco Borrelli,et al.  Decentralized receding horizon control for large scale dynamically decoupled systems , 2009, Autom..

[10]  Virginia Vassilevska Efficient algorithms for clique problems , 2009 .

[11]  Etsuji Tomita,et al.  An Efficient Branch-and-Bound Algorithm for Finding a Maximum Clique , 2003, DMTCS.

[12]  Shinya Takahashi,et al.  A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique , 2010, WALCOM.

[13]  A. Richards,et al.  Decentralized model predictive control of cooperating UAVs , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[14]  J.K. Hedrick,et al.  String Stability Analysis for Heterogeneous Vehicle Strings , 2007, 2007 American Control Conference.

[15]  Eric Feron,et al.  Decentralized Cooperative Trajectory Planning of Multiple Aircraft with Hard Safety Guarantees , 2004 .

[16]  Janez Konc,et al.  An improved branch and bound algorithm for the maximum clique problem , 2007 .

[17]  Michel Verhaegen,et al.  A Decomposition-Based Approach to Linear Time-Periodic Distributed Control of Satellite Formations , 2011, IEEE Transactions on Control Systems Technology.

[18]  Arthur G. Richards,et al.  Robust constrained model predictive control , 2005 .

[19]  Pablo San Segundo,et al.  An exact bit-parallel algorithm for the maximum clique problem , 2011, Comput. Oper. Res..

[20]  Michel Verhaegen,et al.  Distributed computations and control in multi-agent systems , 2000, 2009 4th International Conference on Autonomous Robots and Agents.