Further results on the stability of distance-based multi-robot formations
- 1 January 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 07431619,p. 2972-2977
Abstract
An important class of multi-robot formations is specified by desired distances between adjacent robots. In previous work, we showed that distance-based formations can be globally stabilized by negative gradient, potential field based, control laws, if and only if the formation graph is a tree. In this paper, we further examine the relation between the cycle space of the formation graph and the resulting equilibria of cyclic formations. In addition, the results are extended to the case of distance based formation control for nonholonomic agents. The results are supported through computer simulations.Keywords
This publication has 15 references indexed in Scilit:
- Stabilisation of infinitesimally rigid formations of multi-robot networksInternational Journal of Control, 2009
- Distributed Coordination Control of Multiagent Systems While Preserving ConnectednessIEEE Transactions on Robotics, 2007
- Flocking in Fixed and Switching NetworksIEEE Transactions on Automatic Control, 2007
- Agreement via the edge laplacian2007
- Rigidity and Persistence of Directed Graphs2006
- Flocking for Multi-Agent Dynamic Systems: Algorithms and TheoryIEEE Transactions on Automatic Control, 2006
- Necessary and sufficient graphical conditions for formation control of unicyclesIEEE Transactions on Automatic Control, 2005
- Graph rigidity and distributed formation stabilization of multi-vehicle systems2003
- Graph Embeddings and Laplacian EigenvaluesSIAM Journal on Matrix Analysis and Applications, 2000
- Kronecker products and matrix calculus in system theoryIEEE Transactions on Circuits and Systems, 1978