Distributed combinatorial rigidity control in multi-agent networks
Authors:
- 1 December 2013
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 01912216,p. 6061-6066
Abstract
In this paper, we propose a distributed control law to maintain the combinatorial rigidity of a multi-agent system in the plane, when interaction is proximity-limited. Motivated by the generic properties of rigidity as a function of the underlying network graph, local link addition and deletion rules are proposed that preserve combinatorial rigidity through agent mobility. Specifically, redundancy of network links over local sub-graphs allows the determination of topological transitions that preserve rigidity. It is shown that local redundancy of a network link is sufficient for global redundancy, and thus applying minimal communication, and computation that scales like O(n 2 ), the generic topological rigidity of a network can be preserved.Keywords
This publication has 14 references indexed in Scilit:
- Constrained Interaction and Coordination in Proximity-Limited Multiagent SystemsIEEE Transactions on Robotics, 2013
- Topology-constrained flocking in locally interacting mobile networks2013
- Decentralized centroid estimation for multi-agent systems in absence of a common reference frame: A convergence analysis2012
- Analysis of Noisy Bearing-Only Network LocalizationIEEE Transactions on Automatic Control, 2012
- Distributed Connectivity Control of Mobile NetworksIEEE Transactions on Robotics, 2008
- Rigid graph control architectures for autonomous formationsIEEE Control Systems, 2008
- Distributed Coordination Control of Multiagent Systems While Preserving ConnectednessIEEE Transactions on Robotics, 2007
- Graph rigidity and distributed formation stabilization of multi-vehicle systems2003
- Almost all simply connected closed surfaces are rigid1975
- On graphs and rigidity of plane skeletal structuresJournal of Engineering Mathematics, 1970