Gathering few fat mobile robots in the plane

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.

DOI: 10.1016/j.tcs.2008.10.005

Extracted Key Phrases

12 Figures and Tables

Showing 1-10 of 53 extracted citations

Statistics

0102020072008200920102011201220132014201520162017
Citations per Year

94 Citations

Semantic Scholar estimates that this publication has received between 60 and 151 citations based on the available data.

See our FAQ for additional information.