ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2008.00701
112
16
v1v2 (latest)

Memory Optimal Dispersion by Anonymous Mobile Robots

3 August 2020
Archak Das
K. Bose
B. Sau
ArXiv (abs)PDFHTML
Abstract

Consider a team of k≤nk \leq nk≤n autonomous mobile robots initially placed at a node of an arbitrary graph GGG with nnn 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⁡Δ)\Omega(\log{\Delta})Ω(logΔ) bits of memory to achieve dispersion, where Δ\DeltaΔ is the maximum degree of GGG. On the other hand, the best known memory upper bound is min{Δ,max{log⁡Δ,log⁡D}}min \{\Delta, max\{\log{\Delta}, \log{D}\}\}min{Δ,max{logΔ,logD}} (DDD = diameter of GGG), which can be ω(log⁡Δ)\omega(\log{\Delta})ω(logΔ), depending on the values of Δ\DeltaΔ and DDD. In this paper, we close this gap by presenting an optimal algorithm requiring O(log⁡Δ)O(\log{\Delta})O(logΔ) bits of memory.

View on arXiv
Comments on this paper