论文标题

网络线性系统中拓扑失败的通用可检测性和隔离性

Generic Detectability and Isolability of Topology Failures in Networked Linear Systems

论文作者

Zhang, Yuan, Xia, Yuanqing, Zhang, Jinhui, Shang, Jun

论文摘要

本文研究了从子系统测量结果中检测和隔离拓扑失败(包括链路失败和节点故障)的可能性,其中子系统具有固定的高阶线性动力学,并且其中的确切相互作用权重未知。我们证明,在具有相同网络拓扑的这样类的网络系统中,给定拓扑失败(SET)的可检测性和隔离性是通用属性,这表明是网络拓扑结构在失败(集合)中可检测或可隔离的属性。我们首先给出代数条件,用于对集团植物的任意参数扰动的可检测性和可分离性,然后得出图形理论的必要条件和足够的条件,以实现网络系统的拓扑失败的通用可检测性和隔离性。根据这些结果,我们考虑了部署最小传感器的问题,以进行通用可检测性和可分离性。我们将相关的传感器放置问题减少到命中设置问题,可以通过保证的近似性能有效地解决这些问题。

This paper studies the possibility of detecting and isolating topology failures (including link failures and node failures) of a networked system from subsystem measurements, in which subsystems are of fixed high-order linear dynamics, and the exact interaction weights among them are unknown. We prove that in such class of networked systems with the same network topologies, the detectability and isolability of a given topology failure (set) are generic properties, indicating that it is the network topology that dominates the property of being detectable or isolable for a failure (set). We first give algebraic conditions for detectability and isolability of arbitrary parameter perturbations for a lumped plant, and then derive graph-theoretical necessary and sufficient conditions for generic detectability and isolability of topology failures for the networked systems. On the basis of these results, we consider the problems of deploying the smallest set of sensors for generic detectability and isolability. We reduce the associated sensor placement problems to the hitting set problems, which can be effectively solved by greedy algorithms with guaranteed approximation performances.

扫码加入交流群

加入微信交流群

微信交流群二维码

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