Minimal Edge Addition for Network Controllability

Minimal Edge Addition for Network Controllability
复制标题

DOI:
10.1109/tcns.2018.2814841
复制
发表时间:
2019-03
影响因子:
4.2
通讯作者:
Ximing Chen;S. Pequito;George Pappas;V. Preciado
Ximing Chen;S. Pequito;George Pappas;V. Preciado
中科院分区:
计算机科学3区
文献类型:
--
作者:
Ximing Chen;S. Pequito;George Pappas;V. Preciado

文献摘要

被引文献

相似文献

我们解决的问题,最优修改拓扑的有向动态网络,以确保结构的可控性。更准确地说,给定有向动态网络(即现有的网络基础设施)的结构,我们提出了一个框架,以找到需要添加到网络拓扑中的有向边的最小数量,以呈现结构可控的系统。我们的主要贡献有两个方面:首先,我们提供了所有最优网络修改的完整特征,其次,我们提出了一种能够在多项式时间内找到最优解的算法。通过随机网络系统的数值模拟,验证了算法的有效性。
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.