Controllability and Observability of Grid Graphs via Reduction and Symmetries

DOI10.1109/TAC.2013.2241493MaRDI QIDQ5353264zbMATH OpenOpenAlexFDO

Authors Gianfranco Parlangeli, Giuseppe Notarstefano

Publication date 8 September 2017

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

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

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Observability (93B07)

Abstract: In this paper we investigate the controllability and observability properties of a family of linear dynamical systems, whose structure is induced by the Laplacian of a grid graph. This analysis is motivated by several applications in network control and estimation, quantum computation and discretization of partial differential equations. Specifically, we characterize the structure of the grid eigenvectors by means of suitable decompositions of the graph. For each eigenvalue, based on its multiplicity and on suitable symmetries of the corresponding eigenvectors, we provide necessary and sufficient conditions to characterize all and only the nodes from which the induced dynamical system is controllable (observable). We discuss the proposed criteria and show, through suitable examples, how such criteria reduce the complexity of the controllability (respectively observability) analysis of the grid.

Cited in

(37)

• A necessary and sufficient condition for the controllability of single-leader multi-chain systems
• Second-order controllability of two-time-scale multi-agent systems
• Controllability of Kronecker product networks
• Minimal control placement of networked reaction-diffusion systems based on Turing model
• Controllability and observability of multi-agent systems with heterogeneous and switching topologies
• Regularity/controllability/observability of an NDS with descriptor form subsystems and generalized LFTs
• The robust minimal controllability and observability problem
• Minimum structural controllability problems of complex networks
• Controllability of discrete-time multi-agent systems with directed topology and input delay
• Controllability of heterogeneous multi-agent systems under directed and weighted topology
• Disturbance decoupling problem for multi-agent systems: a graph topological approach
• Controllability of NEPSes of graphs
• Nonlinear integral coupling for synchronization in networks of nonlinear systems
• Controllability improvement for multi-agent systems: leader selection and weight adjustment
• Particle filtering of dynamical networks: highlighting observability issues
• Sampling controllability of multi-agent systems based on structural decomposition
• Observability and control of parabolic equations on networks with loops
• Controllability of multi-agent systems with directed and weighted signed networks
• Observability of leader-based discrete-time multi-agent systems with switching topology
• Group controllability of discrete-time multi-agent systems
• A new perspective to algebraic characterization on controllability of multiagent systems
• Group controllability of discrete-time time-delayed multiagent systems with multiple leaders
• The robust minimal controllability problem
• Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
• Almost equitable partitions and new necessary conditions for network controllability
• On the controllability and observability of networked dynamic systems
• Constructing a controllable graph under edge constraints
• Controllability and observability of switched multi-agent systems
• Controllability of networked multiagent systems based on linearized Turing's model
• Observability and control of parabolic equations on networks
• Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
• Controllability of system dynamics on networks, quantum walks and random walks
• Design of controllable leader-follower networks via memetic algorithms
• Controllability of multi-agent systems with periodically switching topologies and switching leaders
• Controllability of heterogeneous multiagent systems with two-time-scale feature
• Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
• Laplacian controllability classes for threshold graphs

This page was built for publication: Controllability and Observability of Grid Graphs via Reduction and Symmetries

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