Mutual visibility on grid by asynchronous luminous robots

DOI10.1016/j.tcs.2022.04.026OpenAlexW4293072283MaRDI QIDQ2672588

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

Publication date: 13 June 2022

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2022.04.026

zbMATH Keywords

distributed algorithminfinite gridluminous robotsasynchronous scheduleropaque robotsmutual visibility

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Gathering of oblivious robots on infinite grids with minimum traveled distance
• Mutual visibility by luminous robots without collisions
• Gathering over meeting nodes in infinite grid
• Optimum algorithm for the mutual visibility problem
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Gathering few fat mobile robots in the plane
• Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
• Mutual visibility for asynchronous robots
• Gathering anonymous, oblivious robots on a grid
• Mutual visibility by robots with persistent memory
• Constant-Time Complete Visibility for Asynchronous Robots with Lights
• Optimum Algorithm for Mutual Visibility Among Asynchronous Robots with Lights
• A distributed algorithm for gathering many fat mobile robots in the plane
• Distributed Computing – IWDC 2005
• Fault-tolerant complete visibility for asynchronous robots with lights under one-axis agreement
• Arbitrary pattern formation on infinite grid by asynchronous oblivious robots

This page was built for publication: Mutual visibility on grid by asynchronous luminous robots