Minimal Edge Addition for Network Controllability

We address the problem of optimally modifying the topology of a directed dynamical network to ensure structural controllability. More precisely, given the structure of a directed dynamical network (i.e., an existing networked infrastructure), we propose a framework to find the minimum number of dire...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on control of network systems 2019-03, Vol.6 (1), p.312-323
Main Authors: Chen, Ximing, Pequito, Sergio, Pappas, George J., Preciado, Victor M.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Bipartite graph
Computer simulation
Controllability
Heuristic algorithms
Network topologies
Network topology
Optimization
Polynomials
Topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We address the problem of optimally modifying the topology of a directed dynamical network to ensure structural controllability. More precisely, given the structure of a directed dynamical network (i.e., an existing networked infrastructure), we propose a framework to find the minimum number of directed edges that need to be added to the network topology in order to render a structurally controllable system. Our main contribution is twofold: first, we provide a full characterization of all optimal network modifications, and second, we propose an algorithm able to find an optimal solution in polynomial time. We illustrate the validity of our algorithm via numerical simulations in random networked systems.
ISSN:2325-5870
2325-5870
2372-2533
DOI:10.1109/TCNS.2018.2814841