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

基于主动激励的网络动力系统拓扑推断

Inferring Topology of Networked Dynamical Systems by Active Excitations

Yushan Li, Jianping He, Cailian Chen, Xinping Guan

摘要:

网络动态系统的拓扑推理是近年来研究的热点。大多数开创性的工作都是从大量的NDS观测中推断拓扑结构,以便渐近地逼近真实的拓扑结构。利用网络结构对各种扰动的反应以及扰动的影响会不断扩散的特点,本文着重于通过少量的有源激励来推断网络结构的拓扑。关键的挑战是区分系统噪声和激励的不同影响,从所表现出的状态偏差,其中的影响将随时间衰减,激励不能任意大。在实践中,我们提出了一种基于单次激励的推理方法来推断节点的$h$跳邻居。精确的一跳邻居推断的激励条件,首先推导出概率保证。然后,我们将结果扩展到$h$ -跳邻居推断和多个激励的情况下,提供的推理精度和激励幅度之间的显式关系。具体地,基于激励的推断方法不仅适用于无法获得大量观测的场景,而且可以作为辅助手段来提高现有方法的精度。仿真结果验证了分析结果。

英文摘要:

Topology inference for networked dynamical systems (NDSs) has received considerable attention in recent years. The majority of pioneering works have dealt with inferring the topology from abundant observations of NDSs, so as to approximate the real one asymptotically. Leveraging the characteristic that NDSs will react to various disturbances and the disturbance's influence will consistently spread, this paper focuses on inferring the topology by a few active excitations. The key challenge is to distinguish different influences of system noises and excitations from the exhibited state deviations, where the influences will decay with time and the exciatation cannot be arbitrarily large. To practice, we propose a one-shot excitation based inference method to infer $h$-hop neighbors of a node. The excitation conditions for accurate one-hop neighbor inference are first derived with probability guarantees. Then, we extend the results to $h$-hop neighbor inference and multiple excitations cases, providing the explicit relationships between the inference accuracy and excitation magnitude. Specifically, the excitation based inference method is not only suitable for scenarios where abundant observations are unavailable, but also can be leveraged as auxiliary means to improve the accuracy of existing methods. Simulations are conducted to verify the analytical results.

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

↑