Gathering few fat mobile robots in the plane

Jurek Czyzowicz, Leszek Gasieniec, Andrzej Pelc

Research output: Chapter in Book/Report/Conference proceedingConference contribution

13 Scopus citations


Autonomous identical robots represented by unit discs move deterministically in the plane. They do not have any common coordinate system, do not communicate, do not have memory of the past and are totally asynchronous. Gathering such robots means forming a configuration for which the union of all discs representing them is connected. We solve the gathering problem for at most four robots. This is the first algorithmic result on gathering robots represented by two-dimensional figures rather than points in the plain: we call such robots fat.

Original languageEnglish (US)
Title of host publicationPrinciples of Distributed Systems - 10th International Conference, OPODIS 2006, Proceedings
PublisherSpringer Verlag
Number of pages15
ISBN (Print)9783540499909
StatePublished - 2006
Externally publishedYes
Event10th International Conference on Principles of Distributed Systems, OPODIS 2006 - Bordeaux, France
Duration: Dec 12 2006Dec 15 2006

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4305 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference10th International Conference on Principles of Distributed Systems, OPODIS 2006

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Gathering few fat mobile robots in the plane'. Together they form a unique fingerprint.

Cite this