On the stability of distance-based formation control with minimally globally rigid graphs
From MaRDI portal
Publication:6540819
DOI10.1016/j.sysconle.2024.105726zbMATH Open1537.93543MaRDI QIDQ6540819
Marcio S. De Queiroz, Farid Sahebsara
Publication date: 17 May 2024
Published in: Systems \& Control Letters (Search for Journal in Brave)
Applications of graph theory (05C90) Lyapunov and other classical stabilities (Lagrange, Poisson, (L^p, l^p), etc.) in control theory (93D05) Multi-agent systems (93A16)
Cites Work
- Minimally globally rigid graphs
- A survey of multi-agent formation control
- An orthogonal basis approach to formation shape control
- Formation Control of Multi‐Agent Systems
- Distance-Based Control of $\mathcal {K}_{n}$ Formations in General Space With Almost Global Convergence
- Geometric Analysis of the Formation Problem for Autonomous Robots
- Further results on the distance and area control of planar formations
- Stabilisation of infinitesimally rigid formations of multi-robot networks
- Certifying and constructing minimally rigid graphs in the plane
- Rigid graph control architectures for autonomous formations
This page was built for publication: On the stability of distance-based formation control with minimally globally rigid graphs
