Two foraging algorithms for robot swarms using only local communication
Nicholas R. Hoff, Amelia Sagoff, Robert J. Wood, Radhika Nagpal
- Year
- 2010
- Citations
- 97
Abstract
Large collections of robots have the potential to perform tasks collectively using distributed control algorithms. These algorithms require communication between robots to allow the robots to coordinate their behavior and act as a collective. In this paper we describe two algorithms which allow coordination between robots, but do not require physical environment marks such as pheromones. Instead, these algorithms rely on simple, local, low bandwidth, direct communication between robots. We describe the algorithms and measure their performance in worlds with and without obstacles.
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002