Gathering few fat mobile robots in the plane |
| |
Authors: | Jurek Czyzowicz Leszek Ga̧sieniec Andrzej Pelc |
| |
Affiliation: | 1. Département d’informatique, Université du Québec en Outaouais, Gatineau, Québec J8X 3X7, Canada;2. Department of Computer Science, The University of Liverpool, Liverpool, L69 7ZF, UK |
| |
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. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|