Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

DOI10.1109/TAC.2014.2308619MaRDI QIDQ2983053zbMATH OpenOpenAlexFDO

Authors Nima Monshizadeh, Shuo Zhang, M. K. Camlibel

Publication date 16 May 2017

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1403.4868

Mathematics Subject Classification ID

Applications of graph theory (05C90) Controllability (93B05) Control/observation systems governed by functional relations other than differential equations (such as hybrid and switching systems) (93C30)

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.

Cited in

(31)

• Invariant graphs for forced systems
• Leader selection for strong structural controllability of single-integrator multi-agent systems
• Constructing a controllable graph under edge constraints
• Zero forcing in iterated line digraphs
• Optimal regulation of flow networks with transient constraints
• Approximating the minimum rank of a graph via alternating projection
• Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms
• Disturbance decoupling problem for multi-agent systems: a graph topological approach
• Realization theory for poset-causal systems: controllability, observability and duality
• Strong structural controllability of networks: comparison of bounds using distances and zero forcing
• On extremal graphs for zero forcing number
• Partial strong structural controllability
• Group controllability of two-time-scale discrete-time multi-agent systems
• Strong structural controllability of colored structured systems
• Almost equitable partitions and new necessary conditions for network controllability
• Strong structural controllability of networks
• Group controllability of discrete-time multi-agent systems
• Topological and graph-coloring conditions on the parameter-independent stability of second-order networked systems
• Zero forcing number, constrained matchings and strong structural controllability
• Strong structural controllability and leader selection for multi-agent systems with unidirectional topology
• Unified understanding and new results of controllability model of multi‐agent systems
• Leaky forcing: a new variation of zero forcing
• Bounding the total forcing number of graphs
• Strong structural controllability based on leader-follower framework
• An approximation algorithm for zero forcing
• Minimum leader selection for controllability of undirected graphs with leader-follower framework
• Strong structural controllability of multi-agent systems with uncertain connection topologies
• Merging rules for strong structural controllability and minimum input problem in undirected networks
• The controllability and structural controllability of Laplacian dynamics
• Semitotal forcing in claw-free cubic graphs
• Controllability backbone in multiagent networks

This page was built for publication: Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2983053)