Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots

DOI10.1016/J.TCS.2023.114187OpenAlexW4386786275MaRDI QIDQ6073893

Debasish Pattanayak, Sai Vamshi Samala, Partha Sarathi Mandal, Subhajit Pramanick

Publication date: 12 October 2023

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

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

zbMATH Keywords

distributed algorithmsmobile robotsmulti-agent systemsluminous robotsmaximal independent set (MIS)filling problem

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Distance-2-dispersion with termination by a strong team

Cites Work

• Unnamed Item
• Gathering of robots on anonymous grids and trees without multiplicity detection
• Uniform dispersal of asynchronous finite-state mobile robots in presence of holes
• Complete visibility for robots with lights in \(\mathrm{O}(1)\) time
• Asynchronous filling by myopic luminous robots
• Self-stabilizing gathering of mobile robots under crash or Byzantine faults
• Distributed Anonymous Mobile Robots: Formation of Geometric Patterns
• Exploring Unknown Environments
• Uniform Dispersal of Robots with Minimum Visibility Range
• Distributed Computing – IWDC 2005
• Arbitrary pattern formation by asynchronous opaque robots with lights
• Filling arbitrary connected areas by silent robots with minimum visibility range
• Deployment of Asynchronous Robotic Sensors in Unknown Orthogonal Environments
• Fast Uniform Scattering on a Grid for Asynchronous Oblivious Robots

This page was built for publication: Distributed algorithms for filling MIS vertices of an arbitrary graph by myopic luminous robots