Graph-theoretic characterisations of the steady states for containment control
From MaRDI portal
Publication:4897722
Recommendations
- Necessary and sufficient conditions for containment control of networked multi-agent systems
- Distributed containment control with multiple stationary or dynamic leaders in fixed and switching directed networks
- Containment control of heterogeneous multi-agent systems
- Controllable containment control of multi-agent systems with strongly connected sub-graph
- Containment control of multi-agent systems by exploiting the control inputs of neighbors
Cites work
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- Containment Control in Mobile Networks
- Containment in leader-follower networks with switching communication topologies
- Controllability of multi-agent systems from a graph-theoretic perspective
- Distributed finite-time attitude containment control for multiple rigid bodies
- Distributed observers design for leader-following control of multi-agent networks
- Information Flow and Cooperative Control of Vehicle Formations
- Leader-follower cooperative attitude control of multiple rigid bodies
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
Cited in
(3)- Robust containment control for nonlinear multi‐agent systems with intermittent communication
- The geometric convexity on SE(3) and its application to the formation tracking in multi-vehicle systems
- Robust \(H_\infty\) containment control for uncertain multi-agent systems with inherent nonlinear dynamics
This page was built for publication: Graph-theoretic characterisations of the steady states for containment control
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4897722)