Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents

This technical note studies the controllability of diffusively coupled networks where some agents, called leaders, are under the influence of external control inputs. First, we consider networks where agents have general linear dynamics. Then, we turn our attention to infer network controllability from its underlying graph topology. To do this, we consider networks with agents having single-integrator dynamics. For such networks, we provide lower and upper bounds for the controllable subspaces in terms of the distance partitions and the maximal almost equitable partitions, respectively. We also provide an algorithm for computing the maximal almost equitable partition for a given graph and a set of leaders.

[1]  Ming Cao,et al.  Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks? , 2012, IEEE Control Systems.

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

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

[4]  Stanley Burris,et al.  A course in universal algebra , 1981, Graduate texts in mathematics.

[5]  Ming Cao,et al.  Clustering in diffusively coupled networks , 2011, Autom..

[6]  Wei Wu,et al.  Cluster Synchronization of Linearly Coupled Complex Networks Under Pinning Control , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

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

[8]  F. Garofalo,et al.  Controllability of complex networks via pinning. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

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

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

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

[12]  P. Van Dooren,et al.  Matrix Mathematics: Theory, Facts, and Formulas with Application to Linear Systems Theory [Book Review] , 2006, IEEE Control Systems.

[13]  Magnus Egerstedt,et al.  A tight lower bound on the controllability of networks with multiple leaders , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[14]  F. Knorn.  Topics in Cooperative Control , 2011 .

[15]  M. Cao,et al.  Comments on 'Controllability analysis of multi-agent systems using relaxed equitable partitions' , 2012 .

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

[17]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[18]  Tianping Chen,et al.  Cluster synchronization in networks of coupled nonidentical dynamical systems. , 2009, Chaos.

[19]  M. Egerstedt,et al.  Controllability analysis of multi-agent systems using relaxed equitable partitions , 2010 .

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

[21]  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.

[22]  Jurgen Kurths,et al.  Synchronization in complex networks , 2008, 0805.2976.

[23]  Charles Delorme,et al.  Laplacian eigenvectors and eigenvalues and almost equitable partitions , 2007, Eur. J. Comb..