Optimum Gathering of Asynchronous Robots

DOI10.1007/978-3-319-53007-9_4zbMath1485.68260OpenAlexW2583906478MaRDI QIDQ2971632

Subhash Bhagat, Krishnendu Mukhopadhyaya

Publication date: 7 April 2017

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-53007-9_4

zbMATH Keywords

gatheringrobots with lightsswarm robotsasynchronous robots

Mathematics Subject Classification ID

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

Related Items

Self-stabilizing gathering of mobile robots under crash or Byzantine faults

Cites Work

• Unnamed Item
• Leader election and gathering for asynchronous fat robots without common chirality
• Gathering of asynchronous robots with limited visibility
• Gathering few fat mobile robots in the plane
• Rendezvous of two robots with visible bits
• Impossibility of gathering by a set of autonomous mobile robots
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Rendezvous of Two Robots with Constant Memory
• MinMax-Distance Gathering on Given Meeting Points
• Distributed Computing by Mobile Robots: Gathering
• Wait-Free Gathering Without Chirality
• Fault-Tolerant and Self-stabilizing Mobile Robots Gathering
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• A distributed algorithm for gathering many fat mobile robots in the plane
• Distributed Computing – IWDC 2005