arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1909.11054math.OC
收藏

异构网络拓扑识别:可识别性与重构

Topology Identification of Heterogeneous Networks: Identifiability and Reconstruction

Henk J. van Waarde, Pietro Tesi, M. Kanat Camlibel

摘要:

本文讨论的问题,识别图结构的动态网络使用测量的输入/输出数据。这个问题被称为拓扑识别,并在最近的文献中得到了相当大的关注。现有的大多数文献集中在网络的拓扑结构识别与节点动态建模的单积分器或单输入单输出(SISO)系统。目前的文件的目标是确定一个更一般的类的异构网络的拓扑结构,其中的节点的动态一般(可能不同的)线性系建模。我们的两个主要贡献如下。首先,我们建立拓扑可识别性的条件,即,网络拓扑可以从测量数据唯一地重建的条件。我们也将我们的结果专门用于SISO系统的同构网络,我们将看到这样的网络具有相当特殊的可识别性。其次,我们开发了一种拓扑识别方法,从输入/输出数据重构网络拓扑。广义Sylvester方程的解将在我们的识别方案中发挥重要作用。

英文摘要:

This paper addresses the problem of identifying the graph structure of a dynamical network using measured input/output data. This problem is known as topology identification and has received considerable attention in recent literature. Most existing literature focuses on topology identification for networks with node dynamics modeled by single integrators or single-input single-output (SISO) systems. The goal of the current paper is to identify the topology of a more general class of heterogeneous networks, in which the dynamics of the nodes are modeled by general (possibly distinct) linear systems. Our two main contributions are the following. First, we establish conditions for topological identifiability, i.e., conditions under which the network topology can be uniquely reconstructed from measured data. We also specialize our results to homogeneous networks of SISO systems and we will see that such networks have quite particular identifiability properties. Secondly, we develop a topology identification method that reconstructs the network topology from input/output data. The solution of a generalized Sylvester equation will play an important role in our identification scheme.

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

↑