Optimal gathering by asynchronous oblivious robots in hypercubes

DOI10.1007/978-3-030-14094-6_7zbMath1522.68596OpenAlexW2912263388MaRDI QIDQ6051501

Buddhadeb Sau, Kaustav Bose, Ranendu Adhikary, Manash Kumar Kundu

Publication date: 20 October 2023

Published in: Algorithms for Sensor Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-14094-6_7

zbMATH Keywords

hypercubeautonomous robotsdistributed computingasynchronousgatheringWeber pointlook-compute-move cycle

Mathematics Subject Classification ID

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

Related Items (4)

Memory optimal dispersion by anonymous mobile robots ⋮ Gathering over Meeting Nodes in Infinite Grid* ⋮ Gathering robots in graphs: the central role of synchronicity ⋮ Memory optimal dispersion by anonymous mobile robots

This page was built for publication: Optimal gathering by asynchronous oblivious robots in hypercubes