arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.04195math.OC
收藏

可控性测试的网络设计

Network Design for Controllability Metrics

Cassiano O. Becker, Sérgio Pequito, George J. Pappas, Victor M. Preciado

摘要:

在本文中,我们考虑的问题,调整的线性时不变动力学描述的网络系统的边缘权重。我们假设底层网络的拓扑结构是固定的,并且可行边权重的集合是给定的多面体。在这种情况下,我们首先考虑一个可行性问题,包括调整边缘权重,使某些可控性得到满足。所考虑的特定可控性属性是(i)可控性Gramian的最小特征值上的下界,其与控制系统所需的最坏情况能量有关,以及(ii)Gramian逆的迹上的上界,其与平均控制能量有关。在这两种情况下,边缘调整问题可以说是一个可行性问题,涉及双线性矩阵等式,我们接近使用一系列的凸松弛。此外,我们还解决了一个设计问题,包括寻找边缘权重能够满足上述可控性约束,同时寻求最小化的费用函数的边缘权重,我们假设是凸的。特别是,我们考虑了稀疏促进费用函数,旨在惩罚的边的数量,其权重被修改。最后,我们验证了我们的结果与数值模拟在许多随机网络实现,以及与IEEE 14节点电力系统拓扑结构。

英文摘要:

In this paper, 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 (i) a lower bound on the smallest eigenvalue of the controllability Gramian, which is related to the worst-case energy needed to control the system, and (ii) an upper bound on the trace of the Gramian inverse, which is related to the average control energy. 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. In particular, we consider a sparsity-promoting cost function aiming to penalize the number of edges whose weights are modified. Finally, we verify our results with numerical simulations over many random network realizations as well as with an IEEE 14-bus power system topology.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑