Observability Through a Matrix-Weighted Graph

DOI10.1109/TAC.2017.2758172MaRDI QIDQ4682250zbMATH OpenOpenAlexFDO

Authors Sezai E. Tuna

Publication date 18 September 2018

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1603.07637

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Observability (93B07) Algebraic methods (93B25) Linear systems in control theory (93C05)

Abstract: Observability of an array of identical LTI systems with incommensurable output matrices is studied, where an array is called observable when identically zero relative outputs imply synchronized solutions for the individual systems. It is shown that the observability of an array is equivalent to the connectivity of its interconnection graph, whose edges are assigned matrix weights. The interconnection graph is studied by means of a collection of simpler graphs, each of which is associated to an eigenvalue of the system matrix of individual dynamics. It is reported that the interconnection graph is connected if and only if no member of this collection is disconnected. Moreover, to better understand the relative behavior of distant units, pairwise observability which concerns with the synchronization of a certain pair of individual systems in the array is studied. This milder version of observability is shown to be closely related to certain connectivity properties of the interconnection graph as well. Pairwise observability is also analyzed using the circuit theoretic tool effective conductance. The observability of a certain pair of units is proved to be equivalent to the nonsingularity of the (matrix-valued) effective conductance between the associated pair of nodes of a resistive network (with matrix-valued parameters) whose node admittance matrix is the Laplacian of the array's interconnection graph.

Cited in

(10)

• A graph approach to observability in physical sparse linear systems
• Characterizing bipartite consensus on signed matrix-weighted networks via balancing set
• Synchronization analysis of linear time-varying matrix-weighted coupled systems and its applications
• Cluster consensus on matrix-weighted switching networks
• Controllability for multi-agent systems with matrix-weight-based signed network
• Synchronization of linear systems via relative actuation
• Synchronization of small oscillations
• Second-order observability of matrix-weight-based networks
• Pairwise synchronization of second-order matrix-weighted networks
• Expansion in matrix-weighted graphs

This page was built for publication: Observability Through a Matrix-Weighted Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4682250)