Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

In this technical note, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present technical note together with the existing results on the zero forcing sets lead to a minimal leader selection scheme in particular cases.

[1]  W. Marsden.  I and J , 2012 .

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

[3]  R. Stephenson.  A and V , 1962, The British journal of ophthalmology.

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

[5]  Anirban Banerjee,et al.  On the spectrum of the normalized graph Laplacian , 2007, 0705.3772.

[6]  Shaun M. Fallat,et al.  Zero forcing parameters and minimum rank problems , 2010, 1003.2028.

[7]  L. Hogben.  Minimum Rank Problems , 2010 .

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

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

[10]  Mehran Mesbahi,et al.  On the Controllability Properties of Circulant Networks , 2013, IEEE Transactions on Automatic Control.

[11]  Ching-tai Lin.  Structural controllability , 1974 .

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

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

[14]  C. Godsil,et al.  Control by quantum dynamics on graphs , 2009, 0910.5397.

[15]  Vittorio Giovannetti,et al.  Full control by locally induced relaxation. , 2007, Physical review letters.

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

[17]  Vittorio Giovannetti,et al.  Local controllability of quantum networks , 2009 .

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

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

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

[21]  Jean-Charles Delvenne,et al.  Zero forcing sets, constrained matchings and minimum rank , 2013 .

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

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

[24]  Simone Severini,et al.  Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks , 2011, IEEE Transactions on Automatic Control.

[25]  Airlie Chapman.  Strong Structural Controllability of Networked Dynamics , 2015 .