Controllability and Observability of Grid Graphs via Reduction and Symmetries
From MaRDI portal
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
(51)- Minimum structural controllability problems of complex networks
- Controllability of multi-agent systems with directed and weighted signed networks
- Constructing a controllable graph under edge constraints
- Regularity/controllability/observability of an NDS with descriptor form subsystems and generalized LFTs
- Second-order controllability of two-time-scale multi-agent systems
- Disturbance decoupling problem for multi-agent systems: a graph topological approach
- Nonlinear integral coupling for synchronization in networks of nonlinear systems
- A new perspective to algebraic characterization on controllability of multiagent systems
- Laplacian controllability classes for threshold graphs
- Controllability of Kronecker product networks
- On the controllability and observability of networked dynamic systems
- Almost equitable partitions and new necessary conditions for network controllability
- The robust minimal controllability problem
- Controllability of discrete-time multi-agent systems with directed topology and input delay
- Controllability of heterogeneous multi-agent systems under directed and weighted topology
- A necessary and sufficient condition for the controllability of single-leader multi-chain systems
- Controllability improvement for multi-agent systems: leader selection and weight adjustment
- Group controllability of discrete-time multi-agent systems
- Controllability of the multi-agent system modeled by the threshold graph with one repeated degree
- Controllability of multi-agent systems with periodically switching topologies and switching leaders
- Particle filtering of dynamical networks: highlighting observability issues
- Controllability of system dynamics on networks, quantum walks and random walks
- Controllability and observability of multi-agent systems with heterogeneous and switching topologies
- Controllability of NEPSes of graphs
- Controllability and observability of multi-agent systems with general linear dynamics under switching topologies
- Controllability and observability of switched multi-agent systems
- Controllability of heterogeneous multiagent systems with two-time-scale feature
- The robust minimal controllability and observability problem
- Observability and control of parabolic equations on networks with loops
- Controllability of networked multiagent systems based on linearized Turing's model
- Design of controllable leader-follower networks via memetic algorithms
- Minimal control placement of networked reaction-diffusion systems based on Turing model
- Sampling controllability of multi-agent systems based on structural decomposition
- Observability of leader-based discrete-time multi-agent systems with switching topology
- Observability and control of parabolic equations on networks
- Spectrum computation and optimization for controllability Gramian of networked Laplacian systems with limited control placement
- Integration admissibility for structural controllability in linear networked systems
- Minimum leader selection for controllability of undirected graphs with leader-follower framework
- Controllability of second-order multi-agent systems with impulse-effected switching topologies
- Controllability of discrete-time signed multiagent networks
- Laplacian controllable graphs based on connecting two antiregular graphs
- Pattern formation using an intrinsic optimal control approach
- Cluster assignment in multi-agent systems: sparsity bounds and fault tolerance
- Data-sampling based controllability analysis and optimal control of linear multi-agent systems
- The controllability and structural controllability of Laplacian dynamics
- Generalising Laplacian controllability of paths
- Controllability and observability of networked singular systems
- Second-order controllability of two-time-scale discrete-time multi-agent systems
- Group controllability of continuous-time multi-agent systems
- Sensor–non-sensor observability of directed and weighted signed networks under heterogeneous dynamics in n -dimensional space
- Group controllability of discrete-time time-delayed multiagent systems with multiple leaders
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)
