Minimal Controllability Problems
TLDR
It is shown that even approximating the minimum number of variables that need to be affected within a multiplicative factor of clog n is NP-hard for some positive c, and that it is possible to find sets of variables matching this in approximability barrier in polynomial time.Abstract:
Given a linear system, we consider the problem of finding a small set of variables to affect with an input so that the resulting system is controllable. We show that this problem is NP-hard; indeed, we show that even approximating the minimum number of variables that need to be affected within a multiplicative factor of clog n is NP-hard for some positive c. On the positive side, we show it is possible to find sets of variables matching this in approximability barrier in polynomial time. This can be done with a simple greedy heuristic which sequentially picks variables to maximize the rank increase of the controllability matrix. Experiments on Erdos-Renyi random graphs that demonstrate this heuristic almost always succeed at finding the minimum number of variables.read more
Citations
More filters
Journal ArticleDOI
Control Principles of Complex Networks
TL;DR: Recent advances on the controllability and the control of complex networks are reviewed, exploring the intricate interplay between a system's structure, captured by its network topology, and the dynamical laws that govern the interactions between the components.
Journal ArticleDOI
On Submodularity and Controllability in Complex Dynamical Networks
TL;DR: In this article, the authors show that several important classes of metrics based on the controllability and observability Gramians have a strong structural property that allows for either efficient global optimization or an approximation guarantee by using a simple greedy heuristic for their maximization.
Journal ArticleDOI
A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems
TL;DR: This paper addresses problems on the structural design of large-scale control systems by proposing an efficient and unified framework to select the minimum number of manipulated/measured variables to achieve structural controllability/observability of the system.
Journal ArticleDOI
Minimal Actuator Placement With Bounds on Control Effort
TL;DR: An efficient algorithm is provided which approximates up to a multiplicative factor of O(log n), with n being the network size, any optimal actuator set that meets the same energy criteria; this is the best approximation factor one can achieve in polynomial time in the worst case.
Journal ArticleDOI
Sensor selection for Kalman filtering of linear dynamical systems: Complexity, limitations and greedy algorithms
TL;DR: It is shown that the a priori and a posteriori error covariance-based sensor selection problems are both NP-hard, even under the additional assumption that the system is stable, and via simulations that greedy algorithms perform well in practice.
References
More filters
Journal ArticleDOI
Consensus and Cooperation in Networked Multi-Agent Systems
TL;DR: A theoretical framework for analysis of consensus algorithms for multi-agent networked systems with an emphasis on the role of directed information flow, robustness to changes in network topology due to link/node failures, time-delays, and performance guarantees is provided.
Journal ArticleDOI
Network Motifs: Simple Building Blocks of Complex Networks
TL;DR: Network motifs, patterns of interconnections occurring in complex networks at numbers that are significantly higher than those in randomized networks, are defined and may define universal classes of networks.
Journal ArticleDOI
Controllability of complex networks
Yang Liu,Jean-Jacques E. Slotine,Albert-László Barabási,Albert-László Barabási,Albert-László Barabási +4 more
TL;DR: In this article, the authors developed analytical tools to study the controllability of an arbitrary complex directed network, identifying the set of driver nodes with time-dependent control that can guide the system's entire dynamics.
Journal ArticleDOI
Mathematical description of linear dynamical systems
TL;DR: In this paper, it is shown that the input/output relations determine only one part of a system, that which is completely observable and completely controllable, and methods are given for calculating irreducible realization of a given impulse-response matrix.
Journal ArticleDOI
Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
TL;DR: This work shows how the symmetry structure of the network, characterized in terms of its automorphism group, directly relates to the controllability of the corresponding multi-agent system.