Graph-theoretic characterisations of the steady states for containment control
From MaRDI portal
Publication:4897722
DOI10.1080/00207179.2012.694080zbMath1253.93007OpenAlexW2083649719MaRDI QIDQ4897722
Jian Chen, Feng Wang, Xianren Kong, Shijie Zhang, Anhui Zhang
Publication date: 27 December 2012
Published in: International Journal of Control (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207179.2012.694080
graph theorysteady statecontainment controldistributed cooperative controlmultiple leaderscell partitions
Decentralized systems (93A14) Applications of graph theory to circuits and networks (94C15) Agent technology and artificial intelligence (68T42)
Related Items (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 ⋮ RobustH∞containment control for uncertain multi-agent systems with inherent nonlinear dynamics
Cites Work
- Containment in leader-follower networks with switching communication topologies
- Distributed finite-time attitude containment control for multiple rigid bodies
- Leader-follower cooperative attitude control of multiple rigid bodies
- Distributed observers design for leader-following control of multi-agent networks
- Asynchronous Consensus in Continuous-Time Multi-Agent Systems With Switching Topology and Time-Varying Delays
- Containment Control in Mobile Networks
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Information Flow and Cooperative Control of Vehicle Formations
- Consensus Problems in Networks of Agents With Switching Topology and Time-Delays
- On Maximizing the Second Smallest Eigenvalue of a State-Dependent Graph Laplacian
This page was built for publication: Graph-theoretic characterisations of the steady states for containment control
