Wait-Free Gathering Without Chirality

DOI10.1007/978-3-319-25258-2_22zbMath1471.68028OpenAlexW2296734119MaRDI QIDQ3460724

Sébastien Tixeuil, Quentin Bramas

Publication date: 8 January 2016

Published in: Structural Information and Communication Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-25258-2_22

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40)

Related Items (13)

On asynchronous rendezvous in general graphs ⋮ From wait-free to arbitrary concurrent solo executions in colorless distributed computing ⋮ Mobile Robots with Uncertain Visibility Sensors: Possibility Results and Lower Bounds ⋮ Distributed computing by mobile robots: uniform circle formation ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Optimum Gathering of Asynchronous Robots ⋮ The agreement power of disagreement ⋮ Randomized gathering of asynchronous mobile robots ⋮ The topology of look-compute-move robot wait-free algorithms with hard termination ⋮ Stand up indulgent gathering ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Fault-induced dynamics of oblivious robots on a line ⋮ Linear rendezvous with asymmetric clocks

Cites Work

• Self-stabilizing gathering with strong multiplicity detection
• Impossibility of gathering, a certification
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Distributed Computing by Mobile Robots: Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

This page was built for publication: Wait-Free Gathering Without Chirality