A Unifying Approach to Efficient (Near)-Gathering of Disoriented Robots with Limited Visibility

06/15/2022
by   Jannik Castenow, et al.
0

We consider a swarm of n robots in a d-dimensional Euclidean space. The robots are oblivious (no persistent memory), disoriented (no common coordinate system/compass), and have limited visibility (observe other robots up to a constant distance). The basic formation task gathering requires that all robots reach the same, not predefined position. In the related near-gathering task, they must reach distinct positions such that every robot sees the entire swarm. In the considered setting, gathering can be solved in 𝒪(n + Δ^2) synchronous rounds both in two and three dimensions, where Δ denotes the initial maximal distance of two robots. In this work, we formalize a key property of efficient gathering protocols and use it to define λ-contracting protocols. Any such protocol gathers n robots in the d-dimensional space in Θ(Δ^2) synchronous rounds. We prove that, among others, the d-dimensional generalization of the GtC-protocol is λ-contracting. Remarkably, our improved and generalized runtime bound is independent of n and d. The independence of d answers an open research question. We also introduce an approach to make any λ-contracting protocol collisionfree (robots never occupy the same position) to solve near-gathering. The resulting protocols maintain the runtime of Θ (Δ^2) and work even in the semi-synchronous model. This yields the first near-gathering protocols for disoriented robots and the first proven runtime bound. In particular, we obtain the first protocol to solve Uniform Circle Formation (arrange the robots on the vertices of a regular n-gon) for oblivious, disoriented robots with limited visibility.

READ FULL TEXT

page 1

page 3

page 4

page 5

page 11

page 15

page 17

page 33

research
09/24/2021

The Max-Line-Formation Problem

We consider n robots with limited visibility: each robot can observe oth...
research
05/16/2020

Gathering on a Circle with Limited Visibility by Anonymous Oblivious Robots

A swarm of anonymous oblivious mobile robots, operating in deterministic...
research
05/13/2020

Local Gathering of Mobile Robots in Three Dimensions

In this work, we initiate the research about the Gathering problem for r...
research
02/11/2017

Gathering Anonymous, Oblivious Robots on a Grid

We consider a swarm of n autonomous mobile robots, distributed on a 2-di...
research
10/09/2020

Gathering in Linear Time: A Closed Chain of Disoriented Luminous Robots with Limited Visibility

This work focuses on the following question related to the Gathering pro...
research
09/26/2017

TuringMobile: A Turing Machine of Oblivious Mobile Robots with Limited Visibility and its Applications

In this paper we investigate the computational power of a set of mobile ...
research
10/25/2017

Uniform Circle Formation by Transparent Fat Robots

This paper addresses the problem of Uniform Circle Formation by n > 1 tr...

Please sign up or login with your details

Forgot password? Click here to reset