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

局部激励和测量下的局部网络可辨识性

Local Network Identifiability with Partial Excitation and Measurement

Antoine Legat, Julien M. Hendrickx

摘要:

研究了具有部分激励和测量的动态网络的可辨识性:一组节点根据已知的拓扑结构通过未知的传递函数互连,一些节点受到外部激励,一些节点被测量。其目标是确定哪些传递函数在网络中可以恢复的基础上,从激励和测量节点收集的输入输出数据。我们提出了一个本地版本的网络可识别性,代表的能力,以恢复传递函数这是近似已知的,或恢复到一个离散的模糊性。我们表明,本地可识别性是一个通用的属性,建立一个充要条件在矩阵通用秩,并利用这个条件来开发一个算法确定,概率为1,其中传递函数是本地可识别的。我们的实现以图形方式呈现结果,并且是公开的。

英文摘要:

This work focuses on the identifiability of dynamical networks with partial excitation and measurement: a set of nodes are interconnected by unknown transfer functions according to a known topology, some nodes are subject to external excitation, and some nodes are measured. The goal is to determine which transfer functions in the network can be recovered based on the input-output data collected from the excited and measured nodes. We propose a local version of network identifiability, representing the ability to recover transfer functions which are approximately known, or to recover them up to a discrete ambiguity. We show that local identifiability is a generic property, establish a necessary and sufficient condition in terms of matrix generic ranks, and exploit this condition to develop an algorithm determining, with probability 1, which transfer functions are locally identifiable. Our implementation presents the results graphically, and is publicly available.

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

↑