Arbitrary pattern formation by asynchronous opaque robots with lights

DOI10.1016/j.tcs.2020.10.015zbMath1464.68437arXiv1902.04950OpenAlexW3094409800MaRDI QIDQ5919044

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

Publication date: 15 December 2020

Published in: Theoretical Computer Science, Structural Information and Communication Complexity (Search for Journal in Brave)

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

zbMATH Keywords

autonomous robotsdistributed algorithmleader electionluminous robotsarbitrary pattern formationasynchronous schedulerlook-compute-move cycleobstructed visibilityopaque robots

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)

\(k\)-circle formation by disoriented asynchronous robots ⋮ Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots ⋮ Brief announcement: Mutually-visible uniform circle formation by asynchronous mobile robots on grid plane ⋮ 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

Cites Work

• Mutual visibility by luminous robots without collisions
• Arbitrary pattern formation by opaque fat robots with lights
• Arbitrary pattern formation by asynchronous, anonymous, oblivious robots
• Characterizing geometric patterns formable by oblivious anonymous mobile robots
• Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
• Forming sequences of geometric patterns with oblivious mobile robots
• Pattern Formation by Mobile Robots with Limited Visibility
• Leader Election Problem versus Pattern Formation Problem
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
• A distributed algorithm for gathering many fat mobile robots in the plane
• Pattern Formation by Oblivious Asynchronous Mobile Robots
• Distributed Computing – IWDC 2005
• 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
• Uniform circle formation for swarms of opaque robots with lights
• Arbitrary pattern formation with four robots

This page was built for publication: Arbitrary pattern formation by asynchronous opaque robots with lights