Gathering on a circle with limited visibility by anonymous oblivious robots

Giuseppe A. Di Luna, Ryuhei Uehara, Giovanni Viglietta, Yukiko Yamauchi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

A swarm of anonymous oblivious mobile robots, operating in deterministic Look-Compute-Move cycles, is confined within a circular track. All robots agree on the clockwise direction (chirality), they are activated by an adversarial semi-synchronous scheduler (SSYNCH), and an active robot always reaches the destination point it computes (rigidity). Robots have limited visibility: each robot can see only the points on the circle that have an angular distance strictly smaller than a constant ϑ from the robot's current location, where 0 < ϑ ≤ π (angles are expressed in radians). We study the Gathering problem for such a swarm of robots: that is, all robots are initially in distinct locations on the circle, and their task is to reach the same point on the circle in a finite number of turns, regardless of the way they are activated by the scheduler. Note that, due to the anonymity of the robots, this task is impossible if the initial configuration is rotationally symmetric; hence, we have to make the assumption that the initial configuration be rotationally asymmetric. We prove that, if ϑ = π (i.e., each robot can see the entire circle except its antipodal point), there is a distributed algorithm that solves the Gathering problem for swarms of any size. By contrast, we also prove that, if ϑ ≤ π/2, no distributed algorithm solves the Gathering problem, regardless of the size of the swarm, even under the assumption that the initial configuration is rotationally asymmetric and the visibility graph of the robots is connected. The latter impossibility result relies on a probabilistic technique based on random perturbations, which is novel in the context of anonymous mobile robots. Such a technique is of independent interest, and immediately applies to other Pattern-Formation problems.

本文言語英語
ホスト出版物のタイトル34th International Symposium on Distributed Computing, DISC 2020
編集者Hagit Attiya
出版社Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN(電子版)9783959771689
DOI
出版ステータス出版済み - 10 1 2020
イベント34th International Symposium on Distributed Computing, DISC 2020 - Virtual, Online
継続期間: 10 12 202010 16 2020

出版物シリーズ

名前Leibniz International Proceedings in Informatics, LIPIcs
179
ISSN(印刷版)1868-8969

会議

会議34th International Symposium on Distributed Computing, DISC 2020
CityVirtual, Online
Period10/12/2010/16/20

All Science Journal Classification (ASJC) codes

  • ソフトウェア

フィンガープリント

「Gathering on a circle with limited visibility by anonymous oblivious robots」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル