Randomized gathering of asynchronous mobile robots

DOI10.1016/J.TCS.2020.11.048zbMath1477.68318arXiv1909.10004OpenAlexW3110278843MaRDI QIDQ2222092

John E. Augustine, Debasish Pattanayak, Partha Sarathi Mandal

Publication date: 3 February 2021

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1909.10004

zbMATH Keywords

randomizationmobile robotsgatheringasynchronous system

Mathematics Subject Classification ID

Randomized algorithms (68W20) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Autonomous mobile robots with lights
• On asynchronous rendezvous in general graphs
• On time complexity for connectivity-preserving scattering of mobile robots
• Flocking with oblivious robots
• Forming sequences of geometric patterns with oblivious mobile robots
• Impossibility of gathering by a set of autonomous mobile robots
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Wait-Free Gathering Without Chirality
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• The Random Bit Complexity of Mobile Robots Scattering
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• On Cumulative Sums of Random Variables

This page was built for publication: Randomized gathering of asynchronous mobile robots