Observability Through a Matrix-Weighted Graph

Download

index.pdf

Date

2018-07-01

Author

Tuna, Sezai Emre

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

178
views

76
downloads

Observability of an array of identical linear time-invariant 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. Moreover, to better understand the relative behavior of distant units, pairwise observability that 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 admittancematrix is the Laplacian of the array's interconnection graph.

Subject Keywords

Control and Systems Engineering, Electrical and Electronic Engineering, Computer Science Applications

URI

https://hdl.handle.net/11511/39629

Journal

IEEE TRANSACTIONS ON AUTOMATIC CONTROL

DOI

https://doi.org/10.1109/tac.2017.2758172

Collections

Department of Electrical and Electronics Engineering, Article

Suggestions

OpenMETU
Core

Language-Guided Controller Synthesis for Linear Systems Aydın Göl, Ebru; Belta, Calin (Institute of Electrical and Electronics Engineers (IEEE), 2014-05-01) This paper considers the problem of controlling discrete-time linear systems from specifications given as formulas of syntactically co-safe linear temporal logic over linear predicates in the state variables. A systematic procedure is developed for the automatic computation of sets of initial states and feedback controllers such that all the resulting trajectories of the closed-loop system satisfy the given specifications. The procedure is based on the iterative construction and refinement of an automaton t...
Synchronization under matrix-weighted Laplacian Tuna, Sezai Emre (Elsevier BV, 2016-11-01) Synchronization in a group of linear time-invariant systems is studied where the coupling between each pair of systems is characterized by a different output matrix. Simple methods are proposed to generate a (separate) linear coupling gain for each pair of systems, which ensures that all the solutions converge to a common trajectory.
Random Set Methods Estimation of Multiple Extended Objects Granstrom, Karl; Lundquist, Christian; Gustafsson, Fredrik; Orguner, Umut (Institute of Electrical and Electronics Engineers (IEEE), 2014-06-01) Random set-based methods have provided a rigorous Bayesian framework and have been used extensively in the last decade for point object estimation. In this article, we emphasize that the same methodology offers an equally powerful approach to estimation of so-called extended objects, i.e., objects that result in multiple detections on the sensor side. Building upon the analogy between Bayesian state estimation of a single object and random finite set (RFS) estimation for multiple objects, we give a tutorial...
Synchronization of linear systems via relative actuation Tuna, Sezai Emre (Elsevier BV, 2019-12-01) Synchronization in networks of discrete-time linear time-invariant systems is considered under relative actuation. Neither input nor output matrices are assumed to be commensurable. A distributed algorithm that ensures synchronization via dynamic relative output feedback is presented.
Synchronization of linear oscillators coupled through a dynamic network with interior nodes Tuna, Sezai Emre (Elsevier BV, 2020-07-01) Synchronization is studied in an array of identical linear oscillators of arbitrary order, coupled through a dynamic network comprising dissipative connectors (e.g., dampers) and restorative connectors (e.g., springs). The coupling network is allowed to contain interior nodes, i.e., those that are not directly connected to an oscillator. It is shown that the oscillators asymptotically synchronize if and only if the Schur complement (with respect to the boundary nodes) of the complex-valued Laplacian matrix ...

Citation Formats

S. E. Tuna, “Observability Through a Matrix-Weighted Graph,” IEEE TRANSACTIONS ON AUTOMATIC CONTROL, pp. 2061–2074, 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/39629.