Two foraging algorithms for robot swarms using only local communication

Nicholas R. Hoff; Amelia Sagoff; Robert J. Wood; Radhika Nagpal

doi:10.1109/ROBIO.2010.5723314

Two foraging algorithms for robot swarms using only local communication

Nicholas R. Hoff
, Amelia Sagoff
, Robert J. Wood
, Radhika Nagpal

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

80 Scopus citations

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.

Original language	English (US)
Title of host publication	2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010
Publisher	IEEE Computer Society
Pages	123-130
Number of pages	8
ISBN (Print)	9781424493173
DOIs	https://doi.org/10.1109/ROBIO.2010.5723314
State	Published - 2010
Externally published	Yes

Publication series

Name	2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010

All Science Journal Classification (ASJC) codes

Artificial Intelligence
Biotechnology
Human-Computer Interaction

Access to Document

10.1109/ROBIO.2010.5723314

Cite this

Hoff, N. R., Sagoff, A., Wood, R. J., & Nagpal, R. (2010). Two foraging algorithms for robot swarms using only local communication. In 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010 (pp. 123-130). Article 5723314 (2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010). IEEE Computer Society. https://doi.org/10.1109/ROBIO.2010.5723314

@inproceedings{cb1debccf0b44564bc6dfd0689f63095,

title = "Two foraging algorithms for robot swarms using only local communication",

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.",

author = "Hoff, \{Nicholas R.\} and Amelia Sagoff and Wood, \{Robert J.\} and Radhika Nagpal",

year = "2010",

doi = "10.1109/ROBIO.2010.5723314",

language = "English (US)",

isbn = "9781424493173",

series = "2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010",

publisher = "IEEE Computer Society",

pages = "123--130",

booktitle = "2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010",

address = "United States",

}

Two foraging algorithms for robot swarms using only local communication. / Hoff, Nicholas R.; Sagoff, Amelia; Wood, Robert J. et al.
2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010. IEEE Computer Society, 2010. p. 123-130 5723314 (2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Two foraging algorithms for robot swarms using only local communication

AU - Hoff, Nicholas R.

AU - Sagoff, Amelia

AU - Wood, Robert J.

AU - Nagpal, Radhika

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/79952963738

UR - https://www.scopus.com/pages/publications/79952963738#tab=citedBy

U2 - 10.1109/ROBIO.2010.5723314

DO - 10.1109/ROBIO.2010.5723314

M3 - Conference contribution

AN - SCOPUS:79952963738

SN - 9781424493173

T3 - 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010

SP - 123

EP - 130

BT - 2010 IEEE International Conference on Robotics and Biomimetics, ROBIO 2010

PB - IEEE Computer Society

ER -

Two foraging algorithms for robot swarms using only local communication

Abstract

Publication series

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this