Controllability-Gramian submatrices for a network consensus model
From MaRDI portal
Publication:2303949
Abstract: Principal submatrices of the controllability Gramian and their inverses are examined, for a network-consensus model with inputs at a subset of network nodes. Specifically, several properties of the Gramian submatrices and their inverses -- including dominant eigenvalues and eigenvectors, diagonal entries, and sign patterns -- are characterized by exploiting the special doubly-nonnegative structure of the matrices. In addition, majorizations for these properties are obtained in terms of cutsets in the network's graph, based on the diffusive form of the model. The asymptotic (long time horizon) structure of the controllability Gramian is also analyzed. The results on the Gramian are used to study metrics for target control of the network-consensus model.
Recommendations
- Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
- Model Reduction Based Approximation of the Output Controllability Gramian in Large-Scale Networks
- Controllability and Stabilizability of Networks of Linear Systems
- Approximate controllability of network systems
- On Submodularity and Controllability in Complex Dynamical Networks
- Lyapunov Convergence for Lagrangian Models of Network Control
- Consensus control for a class of networks of dynamic agents
- Analysis and stability of consensus in networked control systems
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Controllability of networked systems with heterogeneous dynamics
Cites work
- A Distance-Based Approach to Strong Target Control of Dynamical Networks
- A Survey of Model Reduction by Balanced Truncation and Some New Results
- Controllability Metrics, Limitations and Algorithms for Complex Networks
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controllability of networked MIMO systems
- Distributed average consensus with least-mean-square deviation
- Distributed decision-making algorithms with multiple manipulative actors
- scientific article; zbMATH DE number 1001723 (Why is no real title available?)
- scientific article; zbMATH DE number 5150821 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 3408799 (Why is no real title available?)
- Local open- and closed-loop manipulation of multiagent networks
- Modeling of physical network systems
- Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
- Old and new about positive definite matrices
- Old and new results on algebraic connectivity of graphs
- On Submodularity and Controllability in Complex Dynamical Networks
- Optimal control of complex networks: balancing accuracy and energy of the control action
- Protocols Design and Uncontrollable Topologies Construction for Multi-Agent Networks
- Reaching a Consensus
- Security concepts for the dynamics of autonomous vehicle networks
- Target control and source estimation metrics for dynamical networks
- Target controllability of multiagent systems under fixed and switching topologies
- The critical exponent for continuous conventional powers of doubly nonnegative matrices
- The inverse M-matrix problem
- Vulnerability of Network Synchronization Processes: A Minimum Energy Perspective
Cited in
(3)- Networks with diagonal controllability Gramian: analysis, graphical conditions, and design algorithms
- Model Reduction Based Approximation of the Output Controllability Gramian in Large-Scale Networks
- Optimal cooperative multiple-attackers scheduling against remote state estimation of cyber-physical systems
This page was built for publication: Controllability-Gramian submatrices for a network consensus model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2303949)
