Stabilizability of a group of single integrators and its application to decentralized formation problem

This paper addresses a fundamental property for a class of multi-agent systems, i.e., stabilizability of a group of single integrators, having external control inputs, under a fixed and weighted directed network topology. A necessary and sufficient condition for the stabilizability of the multi-agent system is presented. In particular, it is shown that the multi-agent system is stabilizable if and only if the external control inputs are applied to certain agents (e.g., root node of the communication network when the network is connected). The framework proposed here puts an emphasis on its ability in decentralized control; that is, each agent uses its own and its neighbors' state information as feedback, to stabilize the multi-agent system. Based on these results, the decentralized set-point control problem with formation is also addressed.

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

[2]  Wei Ren,et al.  Information consensus in multivehicle cooperative control , 2007, IEEE Control Systems.

[3]  Hyungbo Shim,et al.  Consensus of Multi-Agent Systems Under Periodic Time-Varying Network * , 2010 .

[4]  Hyungbo Shim,et al.  Consensus of high-order linear systems using dynamic output feedback compensator: Low gain approach , 2009, Autom..

[5]  Hai Lin,et al.  A graph theory based characterization of controllability for multi-agent systems with fixed topology , 2008, 2008 47th IEEE Conference on Decision and Control.

[6]  Randal W. Beard,et al.  Distributed Consensus in Multi-vehicle Cooperative Control - Theory and Applications , 2007, Communications and Control Engineering.

[7]  Peter Wieland,et al.  From Static to Dynamic Couplings in Consensus and Synchronization among Identical and Non-Identical Systems , 2010 .

[8]  Guangming Xie,et al.  On the controllability of multiple dynamic agents with fixed topology , 2009, 2009 American Control Conference.

[9]  Magnus Egerstedt,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009, SIAM J. Control. Optim..

[10]  Meng Ji,et al.  A Graph-Theoretic Characterization of Controllability for Multi-agent Systems , 2007, 2007 American Control Conference.

[11]  Joerg Raisch,et al.  Controllability of Second Order Leader-Follower Systems , 2010 .

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

[13]  Hyungbo Shim,et al.  Output Consensus of Heterogeneous Uncertain Linear Multi-Agent Systems , 2011, IEEE Transactions on Automatic Control.

[14]  H.G. Tanner,et al.  On the controllability of nearest neighbor interconnections , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[16]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[17]  Felipe Cucker,et al.  Emergent Behavior in Flocks , 2007, IEEE Transactions on Automatic Control.

[18]  Mehran Mesbahi,et al.  On the controlled agreement problem , 2006, 2006 American Control Conference.

[19]  C. Wu.  Algebraic connectivity of directed graphs , 2005 .

[20]  Seung-Yeal Ha,et al.  Emergent Behavior of a Cucker-Smale Type Particle Model With Nonlinear Velocity Couplings , 2010, IEEE Transactions on Automatic Control.

[21]  M. Mesbahi,et al.  Pulling the Strings on Agreement: Anchoring, Controllability, and Graph Automorphisms , 2007, 2007 American Control Conference.

[22]  Hyungbo Shim,et al.  Consensus of output-coupled linear multi-agent systems under frequently connected network , 2010, 49th IEEE Conference on Decision and Control (CDC).