Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement

DOI10.1007/978-3-319-15612-5_14zbMath1350.68250OpenAlexW2240199998MaRDI QIDQ5176580

Krishnendu Mukhopadhyaya, Subhash Bhagat, Sruti Gan Chaudhuri

Publication date: 27 February 2015

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-15612-5_14

zbMATH Keywords

asynchronousgatheringswarm robotsobliviouscrash fault

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 (4)

Wait-Free Gathering Without Chirality ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Stand up indulgent gathering ⋮ Stand up indulgent gathering

This page was built for publication: Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement