The topology of look-compute-move robot wait-free algorithms with hard termination

DOI10.1007/s00446-018-0345-3zbMath1451.68033OpenAlexW2904103455WikidataQ128745084 ScholiaQ128745084MaRDI QIDQ2002056

Sergio Rajsbaum, Manuel Alcántara, David Flores-Peñaloza, Armando Castañeda

Publication date: 11 July 2019

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-018-0345-3

zbMATH Keywords

fault tolerancerendezvousterminationmobile robotsgatheringwait-free computingdecentralized algorithms for robots

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (3)

Wait-free approximate agreement on graphs ⋮ A topological perspective on distributed network algorithms ⋮ Wait-free approximate agreement on graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Synchronous robots vs asynchronous lights-enhanced robots on graphs
• Autonomous mobile robots with lights
• More \(choices\) allow more \(faults\): Set consensus problems in totally asynchronous systems
• Rendezvous of two robots with visible bits
• A classification of wait-free loop agreement tasks
• Gathering on rings under the look-compute-move model
• Byzantine gathering in networks
• Asynchronous deterministic rendezvous in graphs
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Deterministic rendezvous in graphs
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Gathering Asynchronous and Oblivious Robots on Basic Graph Topologies Under the Look-Compute-Move Model
• Distributed Computing by Mobile Robots: Gathering
• The topological structure of asynchronous computability
• Wait-Free Gathering Without Chirality
• Impossibility of distributed consensus with one faulty process
• Three-Processor Tasks Are Undecidable
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Gathering Despite Mischief
• The BG distributed simulation algorithm
• Fault-Tolerant Rendezvous in Networks
• A distributed algorithm for gathering many fat mobile robots in the plane
• Generalized FLP impossibility result for t-resilient asynchronous computations
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Distributed Models and Algorithms for Mobile Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• LATIN 2004: Theoretical Informatics
• Rendezvous with constant memory

This page was built for publication: The topology of look-compute-move robot wait-free algorithms with hard termination