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 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.

[1]  Michael Chertkov,et al.  Synchronization in complex oscillator networks and smart grids , 2012, Proceedings of the National Academy of Sciences.

[2]  Daniel J. Brass,et al.  Network Analysis in the Social Sciences , 2009, Science.

[3]  Yong-Zai Lu,et al.  Recovering the Controllability of Complex Networks , 2014 .

[4]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[5]  Soummya Kar,et al.  Minimum cost input/output design for large-scale linear structural systems , 2014, Autom..

[6]  R. Kálmán.  Mathematical description of linear dynamical systems , 1963 .

[7]  Soummya Kar,et al.  A Framework for Structural Input/Output and Control Configuration Selection in Large-Scale Systems , 2013, IEEE Transactions on Automatic Control.

[8]  Kazuo Murota,et al.  Note on a graph-theoretic criterion for structural output controllability , 1990 .

[9]  S. Khanna,et al.  Complexity of the Minimum Input Selection Problem for Structural Controllability , 2015 .

[10]  George J. Pappas,et al.  Analysis and Control of Epidemics: A Survey of Spreading Processes on Complex Networks , 2015, IEEE Control Systems.

[11]  L. Silverman,et al.  Characterization of structural controllability , 1976 .

[12]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[13]  Leslie G. Valiant,et al.  The Complexity of Enumeration and Reliability Problems , 1979, SIAM J. Comput..

[14]  Ching-tai Lin.  Structural controllability , 1974 .

[15]  L. Markus,et al.  On the Existence of Optimal Controls , 1962 .

[16]  Christian Commault,et al.  Generic properties and control of linear structured systems: a survey , 2003, Autom..

[17]  Soummya Kar,et al.  On the complexity of the constrained input selection problem for structural linear systems , 2014, Autom..

[18]  Dragoslav D. Šiljak,et al.  Large-Scale Dynamic Systems: Stability and Structure , 1978 .

[19]  Y. Lai,et al.  Optimizing controllability of complex networks by minimum structural perturbations. , 2012, Physical review. E, Statistical, nonlinear, and soft matter physics.

[20]  Alexander Olshevsky,et al.  Minimum input selection for structural controllability , 2014, 2015 American Control Conference (ACC).

[21]  Albert-László Barabási,et al.  Control Principles of Complex Networks , 2015, ArXiv.

[22]  Albert-László Barabási,et al.  Controllability of complex networks , 2011, Nature.

[23]  J. Pearson,et al.  Structural controllability of multiinput linear systems , 1976 .

[24]  Francesco Bullo,et al.  Controllability Metrics, Limitations and Algorithms for Complex Networks , 2013, IEEE Transactions on Control of Network Systems.

[25]  Christian Commault,et al.  Characterization of generic properties of linear structured systems for efficient computations , 2002, Kybernetika.