Closing ranks in rigid multi-agent formations using edge contraction
This paper proposes a systematic approach to solve the closing rank problem for a rigid multi-agent formation, viz. restoring rigidity after loss of an agent. The approach is based on a particular graph operation, the edge contraction operation. It is proven that when an agent is lost in an arbitrary two-dimensional rigid formation, rigidity can always be restored by transferring all links to which this agent was incident on to one of its neighbors, though not in general any arbitrary one of...[Show more]
|Collections||ANU Research Publications|
|Source:||International Journal of Robust and Nonlinear Control|
|01_Fidan_Closing_ranks_in_rigid_2010.pdf||192.06 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.