The controllability Gramian of lattice graphs

DOI10.1016/j.automatica.2020.108833zbMath1441.93030OpenAlexW3004922786MaRDI QIDQ2174028

Isaac Klickstein, Francesco Sorrentino

Publication date: 17 April 2020

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2020.108833

zbMATH Keywords

Lyapunov equationnetworksdiscrete Fourier transformslatticeslinear optimal control

Mathematics Subject Classification ID

Controllability (93B05) Linear optimal control problems (49N05) Networked control (93B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Passivity-based synchronization of a class of complex dynamical networks with time-varying delay
• Some necessary and sufficient conditions for second-order consensus in multi-agent dynamical systems
• On pinning synchronization of complex dynamical networks
• On the controllability and observability of networked dynamic systems
• The robust minimal controllability problem
• Numerical solution of large and sparse continuous time algebraic matrix Riccati and Lyapunov equations: a state of the art survey
• Optimal control of complex networks: Balancing accuracy and energy of the control action
• Generating symmetric graphs
• Structural controllability
• Lattice Green's Function. Introduction
• Augmented Lagrangian Approach to Design of Structured Optimal State Feedback Gains
• Coherence in Large-Scale Networks: Dimension-Dependent Limitations of Local Feedback
• Minimal Controllability Problems
• Consensus and Coherence in Fractal Networks
• Minimal Actuator Placement With Bounds on Control Effort
• On Submodularity and Controllability in Complex Dynamical Networks
• Minimum-cost control of complex networks
• Graph Sparsification by Effective Resistances

This page was built for publication: The controllability Gramian of lattice graphs