Gathering few fat mobile robots in the plane

Jurek Czyzowicz, Leszek Ga̧sieniec, Andrzej Pelc

Research output: Contribution to journalArticle

82 Scopus citations

Abstract

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)
Pages (from-to)481-499
Number of pages19
JournalTheoretical Computer Science
Volume410
Issue number6-7
DOIs
StatePublished - Feb 28 2009
Externally publishedYes

Keywords

  • Algorithm
  • Asynchronous
  • Gathering
  • Robot

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

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

  • Cite this