Stand up indulgent gathering

DOI10.1016/j.tcs.2022.10.015OpenAlexW4307210994MaRDI QIDQ5918567

Anissa Lamani, Quentin Bramas, Sébastien Tixeuil

Publication date: 17 November 2022

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

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

zbMATH Keywords

fault tolerancemobile robotsgathering

Mathematics Subject Classification ID

Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (1)

The agreement power of disagreement

Cites Work

• Unnamed Item
• Impossibility of gathering, a certification
• Autonomous mobile robots with lights
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Impossibility of gathering by a set of autonomous mobile robots
• Wait-Free Gathering Without Chirality
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Stand up indulgent gathering
• Synchronous gathering without multiplicity detection: a certified algorithm

This page was built for publication: Stand up indulgent gathering