Graph Distances and Controllability of Networks

DOI10.1109/TAC.2016.2546180zbMATH Open1359.93060arXiv1608.04309OpenAlexW3099817679MaRDI QIDQ2979368FDOQ2979368

Authors: A. Yasin Yazıcıoğlu, Waseem Abbas, Magnus Egerstedt 

Publication date: 3 May 2017

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

Abstract: In this technical note, we study the controllability of diffusively coupled networks from a graph theoretic perspective. We consider leader-follower networks, where the external control inputs are injected to only some of the agents, namely the leaders. Our main result relates the controllability of such systems to the graph distances between the agents. More specifically, we present a graph topological lower bound on the rank of the controllability matrix. This lower bound is tight, and it is applicable to systems with arbitrary network topologies, coupling weights, and number of leaders. An algorithm for computing the lower bound is also provided. Furthermore, as a prominent application, we present how the proposed bound can be utilized to select a minimal set of leaders for achieving controllability, even when the coupling weights are unknown.

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Distance in graphs (05C12)

Cited In (12)

• Edge controllability of signed networks
• Control of Some Graph Invariants in Dynamic Routing
• Strong structural controllability of networks: comparison of bounds using distances and zero forcing
• Characterizing controllable subspace and herdability of signed weighted networks via graph partition
• On topological conditions for enabling transient control in leader-follower networks
• Fixed node determination and analysis in directed acyclic graphs of structured networks
• Controllability of networked systems with heterogeneous dynamics
• Almost equitable partitions and controllability of leader-follower multi-agent systems
• Controllability of networked multiagent systems based on linearized Turing's model
• On the herdability of linear time-invariant systems with special topological structures
• Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey
• A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds

This page was built for publication: Graph Distances and Controllability of Networks

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