Observability of Dynamical Networks from Graphic and Symbolic Approaches
- 203 Downloads
A dynamical network, a graph whose nodes are dynamical systems, is usually characterized by a large dimensional space which is not always accessible 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 to 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.
KeywordsDynamical network Observability
ISN acknowledges partial support from the Ministerio de Economía y Competitividad of Spain under project FIS2017-84151-P and from the Group of Research Excelence URJC-Banco de Santander.
- 2.Chan, B.Y., Shachter, R.D.: Structural controllability and observability in influence diagrams. In: Proceedings of the Eighth International Conference on Uncertainty in Artificial Intelligence (UAI’92), pp. 25–32. Morgan Kaufmann Publishers, San Francisco (1992)Google Scholar
- 7.Letellier, C., Sendiña-Nadal, I., Aguirre, L.A.: A nonlinear graph-based theory for dynamical network observability. Phys. Rev. E 98, 020303(R) (2018)Google Scholar