Leader election and gathering for asynchronous fat robots without common chirality

DOI10.1016/j.jda.2015.04.001zbMath1337.68039OpenAlexW2020342540MaRDI QIDQ491635

Krishnendu Mukhopadhyaya, Sruti Gan Chaudhuri

Publication date: 18 August 2015

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

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

zbMATH Keywords

chiralityasynchronousgatheringleader electionfat robots

Mathematics Subject Classification ID

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

Related Items

Gathering fat mobile robots with slim omnidirectional cameras, The mutual visibility problem for fat robots, Gathering of robots on meeting-points: feasibility and optimal resolution algorithms, Optimum Gathering of Asynchronous Robots, Gathering Asynchronous Robots in the Presence of Obstacles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Gathering of asynchronous robots with limited visibility
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Gathering few fat mobile robots in the plane
• Distributed algorithms for partitioning a swarm of autonomous mobile robots
• The algebraic degree of geometric optimization problems
• Impossibility of gathering by a set of autonomous mobile robots
• Gathering asynchronous oblivious mobile robots in a ring
• Collisionless Gathering of Robots with an Extent
• Distributed Computing by Mobile Robots: Gathering
• Leader Election Problem versus Pattern Formation Problem
• 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
• Distributed Computing – IWDC 2005