Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?

As networked dynamical systems appear around us at an increasing rate, questions concerning how to manage and control such systems are becoming more important. Examples include multiagent robotics, distributed sensor networks, interconnected manufacturing chains, and data networks. In response to this growth, a significant body of work has emerged focusing on how to organize such networks to facilitate their control and make them amenable to human interactions. In this article, we summarize these activities by connecting the network topology, that is, the layout of the interconnections in the network, to the classic notion of controllability.

[1]  D. Corneil,et al.  An Efficient Algorithm for Graph Isomorphism , 1970, JACM.

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

[3]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[4]  EgerstedtMagnus,et al.  Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective , 2009 .

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

[6]  Chris Godsil,et al.  Compact graphs and equitable partitions , 1997 .

[7]  Richard M. Murray,et al.  Consensus Protocols for Undirected Networks of Dynamic Agents with Communication Time-Delays , 2003 .

[8]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.

[10]  Antonio Bicchi,et al.  Controllability decompositions of networked systems through quotient graphs , 2008, 2008 47th IEEE Conference on Decision and Control.

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

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

[13]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

[14]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[15]  J. A. Fax,et al.  Graph Laplacians and Stabilization of Vehicle Formations , 2002 .

[16]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

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

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

[19]  M. Kanat Camlibel,et al.  Controllability of diffusively-coupled multi-agent systems with general and distance regular coupling topologies , 2011, IEEE Conference on Decision and Control and European Control Conference.