Two foraging algorithms for robot swarms using only local communication

By Nicholas Hoff, Amelia Sagoff, Robert J. Wood, Radhika Nagpal. 2010

109 citations recorded by the source corpus.

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.

Subfields: Computer Networks and Communications, Genetics, Mechanical Engineering

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Networks and Communications

  1. Gerhard Neumann
  2. Maximilian Hüttenrauch
  3. Adrian Šošić
  4. Michael Rubenstein
  5. Christian Ahler
  6. Radhika Nagpal
  7. Levent Bayindir

In Genetics

  1. Michael Rubenstein
  2. Christian Ahler
  3. Radhika Nagpal
  4. Levent Bayindir
  5. Gerhard Neumann

In Mechanical Engineering

  1. Gerhard Neumann
  2. Maximilian Hüttenrauch
  3. Adrian Šošić
  4. Michael Rubenstein
  5. Christian Ahler
  6. Radhika Nagpal
  7. Levent Bayindir

Citations in the corpus