Manipulability of leader-follower networks with the rigid-link approximation

DOI10.1016/j.automatica.2013.11.041zbMath1298.93024OpenAlexW2074145141MaRDI QIDQ462329

Hiroaki Kawashima, Magnus B. Egerstedt

Publication date: 20 October 2014

Published in: Automatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.automatica.2013.11.041

zbMATH Keywords

multi-agent systemsrigidity theorynetworked mobile robots

Mathematics Subject Classification ID

Automated systems (robots, etc.) in control theory (93C85) Decentralized systems (93A14) Agent technology and artificial intelligence (68T42)

Related Items (4)

Foraging motion of swarms with leaders as Nash equilibria ⋮ Fault-tolerant consensus control with control allocation in a leader-following multi-agent system ⋮ Relative tempo of distributed averaging on networks ⋮ A differential game approach to intrinsic formation control

Cites Work

• Unnamed Item
• Unnamed Item
• Coordinated patterns of unit speed particles on a closed curve
• Solving Coverage Problems with Embedded Graph Grammars
• Rigid and Flexible Frameworks
• Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
• Coordination of groups of mobile autonomous agents using nearest neighbor rules
• Stability of multiagent systems with time-dependent communication links
• Hybrid Systems: Computation and Control

This page was built for publication: Manipulability of leader-follower networks with the rigid-link approximation