Solving the Robots Gathering Problem

Abstract

Consider a set of n > 2 simple autonomous mobile robots (decentralized, asynchronous, no common coordinate system, no identities, no central coordination, no direct communication, no memory of the past, deterministic) moving freely in the plane and able to sense the positions of the other robots. We study the primitive task of gathering them at a point not fixed in advance (Gathering Problem). In the literature, most contributions are simulation-validated heuristics. The existing algorithmic contributions for such robots are limited to solutions for n ≤ 4 or for restricted sets of initial configurations of the robots. In this paper, we present the first algorithm that solves the Gathering Problem for any initial configuration of the robots.

DOI: 10.1007/3-540-45061-0_90

Extracted Key Phrases

5 Figures and Tables

Statistics

01020'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

177 Citations

Semantic Scholar estimates that this publication has 177 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Cieliebak2003SolvingTR, title={Solving the Robots Gathering Problem}, author={Mark Cieliebak and Paola Flocchini and Giuseppe Prencipe and Nicola Santoro}, booktitle={ICALP}, year={2003} }