Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
From MaRDI portal
Publication:1737769
DOI10.1016/j.automatica.2018.12.038zbMath1415.93057OpenAlexW2908665690WikidataQ128584219 ScholiaQ128584219MaRDI QIDQ1737769
Fabio Pasqualetti, Shi-Yu Zhao
Publication date: 24 April 2019
Published in: Automatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.automatica.2018.12.038
Controllability (93B05) Design techniques (robust design, computer-aided design, etc.) (93B51) Large-scale systems (93A15)
Related Items (2)
Controllability-Gramian submatrices for a network consensus model ⋮ A two-layer transformation for zeros analysis of networked dynamical systems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On two classes of matrices with positive diagonal solutions to the Lyapunov equation
- Fast projection methods for minimal design problems in linear system theory
- Recent directions in matrix stability
- Linear systems theory. A structural decomposition approach.
- The robust minimal controllability problem
- Vulnerability of Network Synchronization Processes: A Minimum Energy Perspective
- Graph Controllability Classes for the Laplacian Leader-Follower Dynamics
- Protocols Design and Uncontrollable Topologies Construction for Multi-Agent Networks
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- On the determination of a diagonal solution of the Lyapunov equation
- Multivariable Control
- Gramian-Based Reachability Metrics for Bilinear Networks
- On the Role of Network Centrality in the Controllability of Complex Networks
- Structural controllability
- Controllability analysis of multi-agent systems with directed and weighted interconnection
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Graph-Theoretic Analysis and Synthesis of Relative Sensing Networks
- On the Reachability and Observability of Path and Cycle Graphs
- Semi-Autonomous Consensus: Network Measures and Adaptive Trees
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Minimal Controllability Problems
- Minimal Actuator Placement With Bounds on Control Effort
- On Submodularity and Controllability in Complex Dynamical Networks
This page was built for publication: Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
