论文标题

基于任何输出节点,(强)连接的加权图可均匀检测到

A (Strongly) Connected Weighted Graph is Uniformly Detectable based on any Output Node

论文作者

Inyang-Udoh, Uduak, Shanks, Michael, Jain, Neera

论文摘要

许多动态系统,包括热,流体和多机构系统,都可以表示为加权图。在本文中,我们考虑是否可以从有限的离散时间测量中观察到此类系统的不稳定状态,也就是说,是否可以检测到系统的离散配方。我们确定,如果关联的图完全连接,则可以通过测量任何状态来检测线性时间不变系统。此外,我们表明,如果维持基础图结构,则可以合理地近似其状态过渡矩阵,而与参数变化或随时间变化的系统保持均匀检测。

Many dynamical systems, including thermal, fluid, and multi-agent systems, can be represented as weighted graphs. In this paper we consider whether the unstable states of such systems can be observed from limited discrete-time measurement, that is, whether the discrete formulation of system is detectable. We establish that if the associated graph is fully connected, then a linear time invariant system is detectable by measuring any state. Further, we show that a parameter-varying or time-varying system remains uniformly detectable for a reasonable approximation of its state transition matrix, if the underlying graph structure is maintained.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源