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

控制最小顶点的结构可观测图的多项式时间算法

Polynomial-Time Algorithms for Structurally Observable Graphs by Controlling Minimal Vertices

Shiyong Zhu, Jianquan Lu, Daniel W. C. Ho, Jinde Cao

摘要:

本文的目的是刻画一类重要的标记有向图,称为结构可观察图(SOG),并解决两个最小实现问题。首先,通过探讨大规模布尔网络(LSBNs)的结构可观性,基于最近的合取布尔网络的可观性准则,提供了一种基本类型的SOG。此外,SOG也被证明对一般离散时间系统的结构可观性具有重要的适用性。此外,两个最小实现策略被认为是从一个任意给定的有向图的最小顶点的标记和控制,分别诱导SOG。指出通过增加最小传感器或修改最小顶点的邻接关系,可以诱导出一个可观测系统。最后,给出了有限域网络的结构可观性和布尔网络的最小钉扎结点定理的应用和仿真。最突出的优点是,所设计的算法是多项式时间和避免穷举暴力搜索。这意味着我们的结果可以应用于处理大系统(特别是LSBNs)的可观测性,其可观测性分析和最小控制节点定理被称为棘手的问题。

英文摘要:

The aim of this paper is to characterize an important class of marked digraphs, called structurally observable graphs (SOGs), and to solve two minimum realization problems. To begin with, by exploring structural observability of large-scale Boolean networks (LSBNs), an underlying type of SOGs is provided based on a recent observability criterion of conjunctive BNs. Besides, SOGs are also proved to have important applicability to structural observability of general discrete-time systems. Further, two minimum realization strategies are considered to induce an SOG from an arbitrarily given digraph by marking and controlling the minimal vertices, respectively. It indicates that one can induce an observable system by means of adding the minimal sensors or modifying the adjacency relation of minimal vertices. Finally, the structural observability of finite-field networks, and the minimum pinned node theorem for Boolean networks are displayed as application and simulation. The most salient superiority is that the designed algorithms are polynomial time and avoid exhaustive brute-force searches. It means that our results can be applied to deal with the observability of large-scale systems (particularly, LSBNs), whose observability analysis and the minimum controlled node theorem are known as intractable problems.

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

↑