Time optimal gathering of myopic robots on an infinite triangular grid

DOI10.1016/J.TCS.2024.114930MaRDI QIDQ6652437zbMATH OpenFDO

Authors Pritam Goswami, Avisek Sharma, Satakshi Ghosh, Buddhadeb Sau

Publication date 12 December 2024

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

gatheringtriangular gridlimited visibilityswarm robot

Mathematics Subject Classification ID

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

Recommendations

• Time optimal gathering of myopic robots on an infinite triangular grid
• Gathering Anonymous, Oblivious Robots on a Grid
• Universally optimal gathering under limited visibility
• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Gathering anonymous, oblivious robots on a grid

Cites work

• scientific article; zbMATH DE number 3968590 (Why is no real title available?)
• Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
• Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement
• Gathering asynchronous oblivious mobile robots in a ring
• Gathering of asynchronous robots with limited visibility
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
• Gathering on a circle with limited visibility by anonymous oblivious robots
• Gathering six oblivious robots on anonymous symmetric rings
• Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
• Optimal gathering by asynchronous oblivious robots in hypercubes
• Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring

This page was built for publication: Time optimal gathering of myopic robots on an infinite triangular grid

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