期刊
IEEE TRANSACTIONS ON CONTROL OF NETWORK SYSTEMS
卷 7, 期 3, 页码 1465-1475出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCNS.2020.2979884
关键词
Consensus networks; network of networks (NoNs); stochastic system
资金
- NSF [CNS-1553340, CNS-1527287, CNS-1816307]
We study the problem of optimal network design in a network of networks, a graph composed of a set of disjoint subgraphs, and a set of designed edges between them. Nodes obey noisy consensus dynamics, and our system model allows for both positive and negative edge weights. We quantify system performance by its coherence, an H-2 norm that captures the steady-state variance of the deviation from consensus. We pose the problem of how to connect the subgraphs, by selecting a single connecting node in each subgraph, so that the resulting network of networks has optimal coherence. We then show that this problem can be solved by identifying the connecting node in each subgraph independently of the other nodes and subgraphs. Thus, the problem can be solved in polynomial time in the order of the largest subgraph. We prove that when the connecting topology is a tree, this solution is optimal even under a more general model that allows for multiple connecting nodes per subgraph. We also derive bounds on the best and worst coherence for a general network of networks with all-positive edge weights. Finally, we provide analytical and numerical examples that further explore coherence in a network of networks.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据