Optimal gathering by asynchronous oblivious robots in hypercubes

DOI10.1007/978-3-030-14094-6_7MaRDI QIDQ6051501zbMATH OpenOpenAlexFDO

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

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

asynchronousautonomous robotsdistributed computinggatheringhypercubelook-compute-move cycleWeber point

Mathematics Subject Classification ID

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

Recommendations

• Optimal gathering of oblivious robots in anonymous graphs
• Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings
• Distributed computing by mobile robots: gathering
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering Asynchronous Oblivious Mobile Robots in a Ring

Cited in

(10)

• Gathering robots in graphs: the central role of synchronicity
• scientific article; zbMATH DE number 1688369 (Why is no real title available?)
• Optimum Gathering of Asynchronous Robots
• Gathering over Meeting Nodes in Infinite Grid*
• Memory optimal dispersion by anonymous mobile robots
• On gathering of semi-synchronous robots in graphs
• Time optimal gathering of myopic robots on an infinite triangular grid
• Optimal gathering of robots in anonymous butterfly networks via leader election
• Oblivious robots under round robin: gathering on rings
• Memory optimal dispersion by anonymous mobile robots

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051501)