Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement

DOI10.1016/J.JDA.2015.10.005zbMath1351.68290OpenAlexW12579861MaRDI QIDQ2634716

Subhash Bhagat, Sruti Gan Chaudhuri, Krishnendu Mukhopadhyaya

Publication date: 18 February 2016

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2015.10.005

zbMATH Keywords

asynchronousgatheringswarm robotsobliviouscrash faultobstructed visibility

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Artificial intelligence for robotics (68T40)

Related Items (10)

Gathering over Meeting Nodes in Infinite Grid* ⋮ \(k\)-circle formation by disoriented asynchronous robots ⋮ Optimal Gathering Over Weber Meeting Nodes in Infinite Grid ⋮ Self-stabilizing gathering of mobile robots under crash or Byzantine faults ⋮ Optimum Gathering of Asynchronous Robots ⋮ The agreement power of disagreement ⋮ Gathering Asynchronous Robots in the Presence of Obstacles ⋮ Randomized gathering of asynchronous mobile robots ⋮ Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement ⋮ Gathering anonymous, oblivious robots on a grid

Cites Work

• Unnamed Item
• Unnamed Item
• Self-stabilizing gathering with strong multiplicity detection
• Gathering of asynchronous robots with limited visibility
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Gathering few fat mobile robots in the plane
• Impossibility of gathering by a set of autonomous mobile robots
• Rendezvous of Two Robots with Constant Memory
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• A New Approach for Analyzing Convergence Algorithms for Mobile Robots
• Distributed Computing by Mobile Robots: Gathering
• Gathering Autonomous Mobile Robots with Dynamic Compasses: An Optimal Result
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• A distributed algorithm for gathering many fat mobile robots in the plane
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Dynamic Compass Models and Gathering Algorithms for Autonomous Mobile Robots
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots

This page was built for publication: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement