Arbitrary pattern formation on infinite grid by asynchronous oblivious robots

DOI10.1016/j.tcs.2020.02.016zbMath1433.68596arXiv1811.00834OpenAlexW3006541145MaRDI QIDQ5919533

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

Publication date: 6 April 2020

Published in: Theoretical Computer Science, WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1811.00834

zbMATH Keywords

autonomous robotsdistributed algorithmgridasynchronousautonomous robotarbitrary pattern formationlook-compute-move cycle

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Distributed systems (68M14) Artificial intelligence for robotics (68T40) Distributed algorithms (68W15)

Related Items (6)

Mutual visibility on grid by asynchronous luminous robots ⋮ Grid exploration by a swarm of autonomous robots with minimum repetitions ⋮ Time optimal gathering of myopic robots on an infinite triangular grid ⋮ Arbitrary pattern formation by asynchronous opaque robots with lights ⋮ Arbitrary pattern formation on infinite grid by asynchronous oblivious robots ⋮ Arbitrary pattern formation on infinite regular tessellation graphs

Cites Work

• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Plane formation by synchronous mobile robots in the three dimensional Euclidean space
• Distributed computing by mobile robots: uniform circle formation
• Team assembling problem for asynchronous heterogeneous mobile robots
• Plane formation by semi-synchronous robots in the three dimensional Euclidean space
• Forming sequences of geometric patterns with oblivious mobile robots
• Pattern Formation by Mobile Robots with Limited Visibility
• The Gathering Problem for Two Oblivious Robots with Unreliable Compasses
• Distributed Computing by Mobile Robots: Gathering
• Plane formation by synchronous mobile robots without chirality
• Wait-Free Gathering Without Chirality
• Leader Election Problem versus Pattern Formation Problem
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Pattern Formation by Oblivious Asynchronous Mobile Robots
• Convergence Properties of the Gravitational Algorithm in Asynchronous Robot Systems
• Arbitrary pattern formation by asynchronous opaque robots with lights
• Arbitrary pattern formation on infinite grid by asynchronous oblivious robots
• On fast pattern formation by autonomous robots

This page was built for publication: Arbitrary pattern formation on infinite grid by asynchronous oblivious robots