用图形和符号方法研究动态网络的可观测性
Observability of dynamical networks from graphic and symbolic approaches
摘要:
一个动态网络,一个图的节点是动态系统,通常是由一个大的维空间,这是不总是可访问的,由于不可能测量所有的变量跨越状态空间的特点。因此,确定一组减少的变量,提供所有所需的信息,以明确区分其不同的状态是至关重要的。继承自控制理论,一种可能的方法是基于使用可观测性矩阵,该可观测性矩阵被定义为原始状态空间和从测量变量重构的空间之间的坐标变化的雅可比矩阵。通过符号化地计算系统可观测性矩阵行列式的复杂度,并用符号可观测性系数来量化系统的可观测性。在这项工作中,我们扩展了符号可观性,以前开发的动力系统,网络耦合$d$维节点动力学($d>1$)。从节点动力学的可观测性、节点间的耦合函数和邻接矩阵出发,确实可以构造具有任意拓扑结构的大型网络的可观测性。
英文摘要:
A dynamical network, a graph whose nodes are dynamical systems, is usually characterized by a large dimensional space which is not always accesible due to the impossibility of measuring all the variables spanning the state space. Therefore, it is of the utmost importance to determine a reduced set of variables providing all the required information for non-ambiguously distinguish its different states. Inherited from control theory, one possible approach is based on the use of the observability matrix defined as the Jacobian matrix of the change of coordinates between the original state space and the space reconstructed from the measured variables. The observability of a given system can be accurately assessed by symbolically computing the complexity of the determinant of the observability matrix and quantified by symbolic observability coefficients. In this work, we extend the symbolic observability, previously developed for dynamical systems, to networks made of coupled $d$-dimensional node dynamics ($d>1$). From the observability of the node dynamics, the coupling function between the nodes, and the adjacency matrix, it is indeed possible to construct the observability of a large network with an arbitrary topology.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。