A New Perspective to Graphical Characterization of Multiagent Controllability

Recently, graphical characterization of multiagent controllability has been studied extensively. A major effort in the study is to determine controllability directly from topology structures of communication graphs. In this paper, we proposed the concept of controllability destructive nodes, which indicates that the difficulty in graphical characterization turns out to be the identification of topology structures of controllability destructive nodes. It is shown that each kind of double and triple controllability destructive nodes happens to have a uniform topology structure which can be defined similarly. The definition, however, is verified not to be applicable to the topology structures of quadruple controllability destructive (QCD) nodes. Even so, a design method is proposed to uncover topology structures of QCD nodes for graphs with any size, and a complete graphical characterization is presented for the graphs consisting of five vertices. One advantage of the established complete graphical characterization is that the controllability of any graph with any selection of leaders can be determined directly from the identified/defined destructive topology structures. The results generate several necessary and sufficient graphical conditions for controllability. A key step of arriving at these results is the discovery of a relationship between the topology structure of the controllability destructive nodes and a corresponding eigenvector of the Laplacian matrix.

[1]  Tongwen Chen,et al.  Destructive nodes in multi-agent controllability , 2015, ArXiv.

[2]  Hai Lin,et al.  Protocols Design and Uncontrollable Topologies Construction for Multi-Agent Networks , 2015, IEEE Transactions on Automatic Control.

[3]  Youcheng Lou,et al.  Controllability analysis of multi-agent systems with directed and weighted interconnection , 2012, Int. J. Control.

[4]  Giuseppe Notarstefano,et al.  On the Reachability and Observability of Path and Cycle Graphs , 2011, IEEE Transactions on Automatic Control.

[5]  Ziyang Meng,et al.  Leaderless and Leader-Following Consensus With Communication and Input Delays Under a Directed Network Topology , 2011, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[6]  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).

[7]  Bahman Gharesifard,et al.  Graph Controllability Classes for the Laplacian Leader-Follower Dynamics , 2015, IEEE Transactions on Automatic Control.

[8]  Wei Zhu,et al.  Consensus of Multiagent Systems With Switching Jointly Reachable Interconnection and Time Delays , 2012, IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans.

[9]  Shreyas Sundaram,et al.  Structural Controllability and Observability of Linear Systems Over Finite Fields With Applications to Multi-Agent Systems , 2013, IEEE Transactions on Automatic Control.

[10]  M. Kanat Camlibel,et al.  Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents , 2014, IEEE Transactions on Automatic Control.

[11]  Guangming Xie,et al.  Controllability of a Leader–Follower Dynamic Network With Switching Topology , 2008, IEEE Transactions on Automatic Control.

[12]  Rogelio Lozano,et al.  Controllability and observability of leader-based multi-agent systems , 2008, 2008 47th IEEE Conference on Decision and Control.

[13]  Bo Liu,et al.  Controllability of switching networks of multi‐agent systems , 2012 .

[14]  M. Kanat Camlibel,et al.  A Class of Uncontrollable Diffusively Coupled Multiagent Systems with Multichain Topologies , 2013, IEEE Transactions on Automatic Control.

[15]  Hai Lin,et al.  Leaders in multi-agent controllability under consensus algorithm and tree topology , 2012, Syst. Control. Lett..

[16]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[17]  Yisheng Zhong,et al.  Formation controllability of high-order linear time-invariant swarm systems , 2010 .

[18]  Kevin L. Moore,et al.  Studies on Resilient Control Through Multiagent Consensus Networks Subject to Disturbances , 2014, IEEE Transactions on Cybernetics.

[19]  Kazuo Murota,et al.  Matrices and Matroids for Systems Analysis , 2000 .

[20]  Hamid Reza Karimi,et al.  $H_{\infty}$ Consensus and Synchronization of Nonlinear Systems Based on A Novel Fuzzy Model , 2013, IEEE Transactions on Cybernetics.

[21]  Tong Zhou,et al.  On the controllability and observability of networked dynamic systems , 2014, Autom..

[22]  J. M. Hof.  Structural identifiability of linear compartmental systems , 1998, IEEE Trans. Autom. Control..

[23]  Zhen Wang,et al.  Controllability of multi-agent systems with time-delay in state and switching topology , 2010, Int. J. Control.

[24]  Zongli Lin,et al.  Distributed Synchronization Control of Multiagent Systems With Unknown Nonlinearities , 2016, IEEE Transactions on Cybernetics.

[25]  Zhen Wang,et al.  Interconnection topologies for multi-agent coordination under leader-follower framework , 2009, Autom..

[26]  Amir G. Aghdam,et al.  Structural controllability of multi-agent networks: Robustness against simultaneous failures , 2013, Autom..

[27]  J. Pearson,et al.  Structural controllability of multiinput linear systems , 1976 .

[28]  K. Murota.  Systems Analysis by Graphs and Matroids: Structural Solvability and Controllability , 1987 .

[29]  Wen-Xu Wang,et al.  Exact controllability of complex networks , 2013, Nature Communications.

[30]  Giuseppe Notarstefano,et al.  Controllability and Observability of Grid Graphs via Reduction and Symmetries , 2012, IEEE Transactions on Automatic Control.

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

[32]  Junwei Gao,et al.  Eigenvector based design of uncontrollable topologies for networks of multiple agents , 2013, Proceedings of the 32nd Chinese Control Conference.

[33]  J. Leydold,et al.  Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems , 2007 .