SWARM
A Randomized Gathering Algorithm for Multiple Robots with Limited Sensing Capabilities
Noam Gordon, Israel A. Wagner, Alfred M. Bruckstein⋆
- Year
- 2005
- Citations
- 13
Abstract
Consider a swarm of weak, anonymous and homogeneous robots lacking memory, orientation, and communication capabilities, and having myopic sensors that tell them the directions to nearby robots, but not the distance from them. We present a simple randomized algorithm which, when performed by all members of the swarm, gathers them in a small region. We explore the interesting global phenomena that occur during the process, evident from our analysis and simulations.
Keywords
Swarm roboticsRobotSwarm behaviourComputer scienceOrientation (vector space)HomogeneousRandomized algorithmProcess (computing)Simple (philosophy)Algorithm
Related papers
OTHER
📊 26,957 cites
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
PERCEPTION
📊 22,245 cites
Artificial intelligence: a modern approach
1995
OTHER
📊 18,993 cites
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
SWARM
📊 14,853 cites
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002