Zero forcing sets and controllability of dynamical systems defined on graphs
arXiv:1403.4868 · doi:10.1109/TAC.2014.2308619
Abstract
In this paper, 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 paper together with the existing results on the zero forcing sets lead to a minimal leader selection scheme in particular cases.
References in corpus (2)
Cited by in corpus (16)
- On Structural Controllability of Symmetric (Brain) Networks
- Strong Structural Controllability of Networks under Time-Invariant and Time-Varying Topological Perturbations
- The Observability Radius of Networks
- Strong Structural Controllability of Signed Networks
- Strongly uncontrollable network topologies
- Leaky Forcing: A New Variation of Zero Forcing
- Perturbation-Tolerant Structural Controllability for Linear Systems
- Zero forcing in iterated line digraphs
- Strong Structural Controllability of Colored Structured Systems
- Scalable controllability analysis of structured networks
- Fault detection and isolation for linear structured systems
- PTSC: a New Definition for Structural Controllability under Numerical Perturbations
- Properties of pattern matrices with applications to structured systems
- Minimum leader selection for Structural Controllability of Undirected Graphs with Leader-follower Framework
- Composition Rules for Strong Structural Controllability and Minimum Input Problem in Diffusively-Coupled Networks
- Structural Controllability of a Consensus Network with Multiple Leaders