On strong structural controllability of networked systems: A constrained matching approach

This paper examines strong structural controllability of linear-time-invariant networked systems. We provide necessary and sufficient conditions for strong structural controllability involving constrained matchings over the bipartite graph representation of the network. An O(n2) algorithm to validate if a set of inputs leads to a strongly structurally controllable network and to find such an input set is proposed. The problem of finding such a set with minimal cardinality is shown to be NP-complete. Minimal cardinality results for strong and weak structural controllability are compared.

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

[2]  H. Mayeda,et al.  Strong Structural Controllability , 1979 .

[3]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[4]  K. Reinschke,et al.  On strong structural controllability of linear systems , 1992, [1992] Proceedings of the 31st IEEE Conference on Decision and Control.

[5]  Daniel Hershkowitz,et al.  Ranks of zero patterns and sign patterns , 1993 .

[6]  D. Olesky,et al.  Qualitative controllability and uncontrollability by a single entry , 1993 .

[7]  Béla Bollobás,et al.  Random Graphs: Notation , 2001 .

[8]  Moshe Lewenstein,et al.  Uniquely Restricted Matchings , 2001, Algorithmica.

[9]  A. ADoefaa,et al.  ? ? ? ? f ? ? ? ? ? , 2003 .

[10]  Ljupco Kocarev,et al.  Complex Dynamics in Communication Networks , 2005 .

[11]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[12]  V. Latora,et al.  Complex networks: Structure and dynamics , 2006 .

[13]  Niloy Ganguly,et al.  Dynamics On and Of Complex Networks: Applications to Biology, Computer Science, and the Social Sciences , 2009 .

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

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

[16]  Sounaka Mishra On the Maximum Uniquely Restricted Matching for Bipartite Graphs , 2011, Electron. Notes Discret. Math..

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

[18]  Ferdinand Svaricek,et al.  Strong structural controllability of linear systems revisited , 2011, IEEE Conference on Decision and Control and European Control Conference.

[19]  Shilpa Chakravartula,et al.  Complex Networks: Structure and Dynamics , 2014 .