返回
Network Design for Controllability Metrics
DOI:10.1109/TCNS.2020.2978118.png)
摘要
En 中文
In this article, we consider the problem of tuning the edge weights of a networked system described by linear time-invariant dynamics. We assume that the topology of the underlying network is fixed, and that the set of feasible edge weights is a given polytope. In this setting, we first consider a feasibility problem consisting of tuning the edge weights such that certain controllability properties are satisfied. The particular controllability properties under consideration are 1) a lower bound on the smallest eigenvalue of the controllability Gramian and 2) an upper bound on the trace of the Gramian inverse. In both cases, the edge-tuning problem can be stated as a feasibility problem involving bilinear matrix equalities, which we approach using a sequence of convex relaxations. Furthermore, we also address a design problem consisting of finding edge weights able to satisfy the aforementioned controllability constraints while seeking to minimize a cost function of the edge weights, which we assume to be convex. Finally, we verify our results with numerical simulations over a number of random network realizations, as well as with an IEEE 14-bus power system topology.
Keyword:
Bilinear matrix equality
controllability Gramian
convex optimization
network design
networked dynamics
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
5
论文数:
1.7K
被引数:
5.8K
机构
引用论文
Weighted Network Design With Cardinality Constraints via Alternating Direction Method of Multipliers
Generic properties and control of linear structured systems: a survey线性结构系统的一般性质和控制: 综述
AUTOMATICA
IF5.9

