By Topic

Pattern reconfiguration in swarms-convergence of a distributed asynchronous and bounded iterative algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Beni, G. ; Coll. of Eng., California Univ., Riverside, CA, USA ; Ping Liang

Swarms are physical realizations of self-organizing distributed robotic systems (DRS). This paper provides a rigorous analysis of swarm behavior and introduces a new methodology for using swarms to solve DRS pattern reconfiguration problems. The authors introduce the linear swarm model and show that it is an iterative method for asynchronously solving linear systems of equations under physically relevant constraints. The main result of the paper is a proof of a sufficient condition for the asynchronous convergence of a linear swarm to a synchronously achievable configuration. This is important since a large class of DRS self-organizing tasks can be mapped into reconfigurations of patterns in swarms

Published in:

Robotics and Automation, IEEE Transactions on  (Volume:12 ,  Issue: 3 )