arXiv (All)
open access
An Asynchronous Maximum Independent Set Algorithm by Myopic Luminous Robots on Grids
We consider the problem of constructing a maximum independent set with mobile myopic luminous robots on a grid network whose size is finite but unknown to the robots. In this setting, the robots enter the grid network one-by-one from a corner of the grid, and they eventually have to be disseminated
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Robots Exclusion Protocol#502674
- Independent Set Discovery on Biclique-Free Graphs Is Fixed-Parameter Tractable#1064381
- Patrolling by Robots Equipped with Visibility#296951
- ROBOTICS: AN APPROACH TO INCREASE EFFICIENCY OF AI IN THE WORKPLACE#20964
- Recolorable Graph Exploration by an Oblivious Agent with Fewer Colors#1131392
Record · ID 1342263
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive