Memory Optimal Dispersion by Anonymous Mobile Robots release_pjgrpz7qenc4dpdyorc4y2dn7i

by Archak Das, Kaustav Bose, Buddhadeb Sau

Released as a article .

2020  

Abstract

Consider a team of k ≤ n autonomous mobile robots initially placed at a node of an arbitrary graph G with n nodes. The dispersion problem asks for a distributed algorithm that allows the robots to reach a configuration in which each robot is at a distinct node of the graph. If the robots are anonymous, i.e., they do not have any unique identifiers, then the problem is not solvable by any deterministic algorithm. However, the problem can be solved even by anonymous robots if each robot is given access to a fair coin which they can use to generate random bits. In this setting, it is known that the robots require Ω(logΔ) bits of memory to achieve dispersion, where Δ is the maximum degree of G. On the other hand, the best known memory upper bound is min {Δ, max{logΔ, logD}} (D = diameter of G), which can be ω(logΔ), depending on the values of Δ and D. In this paper, we close this gap by presenting an optimal algorithm requiring O(logΔ) bits of memory.
In text/plain format

Archived Files and Locations

application/pdf  562.3 kB
file_3z7pd7h2yvdwzliqnxhgojvs5q
arxiv.org (repository)
web.archive.org (webarchive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2020-12-04
Version   v2
Language   en ?
arXiv  2008.00701v2
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 3c8e1903-311b-458b-a036-a4401e2fb60c
API URL: JSON