Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments (2002)
| Citations: | 24 - 6 self |
BibTeX
@MISC{Hsiang02algorithmsfor,
author = {Tien-ruey Hsiang and Esther M. Arkin and Michael A. Bender and Sandor P. Fekete and Joseph S. B. Mitchell},
title = {Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We develop and analyze algorithms for dispersing a swarm of primitive robots in an unknown environment, R. The primary objective is to minimize the makespan, that is, the time to fill the entire region. An environment is composed of pixels that form a connected subset of the integer grid. There is at most one robot per pixel and robots move horizontally or vertically at unit speed. Robots enter R by means of k ≥ 1 door pixels. Robots are primitive finite automata, only having local communication, local sensors, and a constant-sized memory. We first give algorithms for the single-door case...
