Time optimal gathering of myopic robots on an infinite triangular grid
From MaRDI portal
Publication:6652437
DOI10.1016/J.TCS.2024.114930MaRDI QIDQ6652437FDOQ6652437
Satakshi Ghosh, Buddhadeb Sau, Pritam Goswami, Avisek Sharma
Publication date: 12 December 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Artificial intelligence for robotics (68T40) Distributed algorithms (68W15) Distributed systems (68M14)
Cites Work
- Gathering asynchronous oblivious mobile robots in a ring
- Fault-Tolerant Gathering Algorithms for Autonomous Mobile Robots
- Gathering of asynchronous robots with limited visibility
- Taking advantage of symmetries: Gathering of many asynchronous oblivious robots on a ring
- Title not available (Why is that?)
- Gathering six oblivious robots on anonymous symmetric rings
- Gathering of robots on anonymous grids and trees without multiplicity detection
- Optimal gathering by asynchronous oblivious robots in hypercubes
- Gathering of robots on meeting-points: feasibility and optimal resolution algorithms
- Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
- Arbitrary pattern formation by asynchronous opaque robots with lights
- Gathering on a circle with limited visibility by anonymous oblivious robots
- Gathering synchronous robots in graphs: from general properties to dense and symmetric topologies
- Fault-Tolerant Gathering of Asynchronous Oblivious Mobile Robots under One-Axis Agreement
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)
