Disturbance decoupling problem for multi-agent systems: a graph topological approach
From MaRDI portal
Recommendations
- Remarks on the decentralized disturbance decoupling problem
- \(H_{\infty }\) control of networked multi-agent systems
- Controllability of multi-agent systems under directed topology
- The disturbance decoupling problem in decentralized linear multi-variable systems by local dynamic feedback
- scientific article; zbMATH DE number 7027898
Cites work
- scientific article; zbMATH DE number 3987117 (Why is no real title available?)
- scientific article; zbMATH DE number 3751028 (Why is no real title available?)
- scientific article; zbMATH DE number 53596 (Why is no real title available?)
- Consensus and Cooperation in Networked Multi-Agent Systems
- Consensus of second-order multi-agent systems with exogenous disturbances
- Control theory for linear systems
- Controllability and Observability of Grid Graphs via Reduction and Symmetries
- Controllability of multi-agent systems from a graph-theoretic perspective
- Controlled and conditioned invariant subspaces in linear system theory
- Decoupling and Pole Assignment in Linear Multivariable Systems: A Geometric Approach
- Graph theoretic methods in multiagent networks
- Interacting with Networks: How Does Structure Relate to Controllability in Single-Leader, Consensus Networks?
- Laplacian eigenvectors and eigenvalues and almost equitable partitions
- Load balancing of dynamical distribution networks with flow constraints and unknown in/outflows
- Noncooperative disturbance decoupling
- On Consensus Algorithms for Double-Integrator Dynamics
- Projection-Based Model Reduction of Multi-Agent Systems Using Graph Partitions
- Reaching a Consensus in a Dynamically Changing Environment: A Graphical Approach
- Robust Synchronization of Uncertain Linear Multi-Agent Systems
- Synchronization in networks of identical linear systems
- Upper and Lower Bounds for Controllable Subspaces of Networks of Diffusively Coupled Agents
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
Cited in
(9)- Strong structural controllability of networks
- On multi-consensus and almost equitable graph partitions
- Consensus and multi-consensus for discrete-time LTI systems
- Disturbance attenuation of complex dynamical systems through interaction topology design
- Cluster partitioning of heterogeneous multi-agent systems
- Topology-induced containment for general linear systems on weakly connected digraphs
- Multi-consensus problems in hybrid multi-agent systems
- Almost equitable partitions and new necessary conditions for network controllability
- Hybrid consensus for multi-agent systems with time-driven jumps
This page was built for publication: Disturbance decoupling problem for multi-agent systems: a graph topological approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018578)
