Necessary and sufficient conditions for containment control of networked multi-agent systems

In this paper, containment control problems for networked multi-agent systems with multiple stationary or dynamic leaders are investigated. The topologies that characterize the interaction among the leaders and the followers are directed graphs. Necessary and sufficient criteria which guarantee the achievement of containment control are established for both continuous-time and sampled-data based protocols. When the leaders are stationary, the convergence for continuous-time protocol (sampled-data based protocol) is completely dependent on the topology structure (both the topology structure and the size of sampling period). When the leaders are dynamic, the convergence for continuous-time protocol (sampled-data based protocol) is completely dependent on the topology structure and the gain parameters (the topology structure, the gain parameters, and the size of sampling period). Moreover, the final states of all the followers are exclusively determined by the initial values of the leaders and the topology structure. In the stationary leaders case, all the followers will move into the convex hull spanned by the leaders, while in the dynamic leaders case, the followers will not only move into the convex hull but also move with the leaders with the same velocity. Finally, all the theoretical results are illustrated by numerical simulations.

[1]  Dimos V. Dimarogonas,et al.  A Leader-based Containment Control Strategy for Multiple Unicycles , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[2]  Giancarlo Ferrari-Trecate,et al.  Containment Control in Mobile Networks , 2008, IEEE Transactions on Automatic Control.

[3]  Xiaoming Hu,et al.  Formation constrained multi-agent control , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[4]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[5]  Charles R. Johnson,et al.  Matrix analysis , 1985, Statistical Inference for Engineers and Data Scientists.

[6]  Katsuhiko Ogata,et al.  Discrete-time control systems (2nd ed.) , 1995 .

[7]  O. Taussky A Recurring Theorem on Determinants , 1949 .

[8]  Magnus Egerstedt,et al.  Solving Coverage Problems with Embedded Graph Grammars , 2007, HSCC.

[9]  Yongcan Cao,et al.  Containment control with multiple stationary or dynamic leaders under a directed interaction graph , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[10]  Magnus Egerstedt,et al.  Rendezvous with multiple, intermittent leaders , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[11]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[12]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

[13]  Manfredi Maggiore,et al.  Necessary and sufficient graphical conditions for formation control of unicycles , 2005, IEEE Transactions on Automatic Control.

[14]  N. Biggs Algebraic Graph Theory: The multiplicative expansion , 1974 .

[15]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[16]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[17]  Ziyang Meng,et al.  Distributed containment control for double-integrator dynamics: Algorithms and experiments , 2010, Proceedings of the 2010 American Control Conference.

[18]  Maurizio Porfiri,et al.  Tracking and formation control of multiple autonomous agents: A two-level consensus approach , 2007, Autom..

[19]  Katsuhiko Ogata,et al.  Discrete-time control systems , 1987 .

[20]  Magnus Egerstedt,et al.  Containment in leader-follower networks with switching communication topologies , 2011, Autom..

[21]  George J. Pappas,et al.  Flocking in Fixed and Switching Networks , 2007, IEEE Transactions on Automatic Control.

[22]  Long Wang,et al.  Consensus behavior of agents in networked systems under general communication topologies , 2006, 2006 IEEE Conference on Computer Aided Control System Design, 2006 IEEE International Conference on Control Applications, 2006 IEEE International Symposium on Intelligent Control.

[23]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[24]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[25]  Dimos V. Dimarogonas,et al.  On the Rendezvous Problem for Multiple Nonholonomic Agents , 2007, IEEE Transactions on Automatic Control.

[26]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.