arXiv (All)
open access
Completely mobile robots in graphs with a resolving property
This work extends the study of mobile resolvability in connected graphs by introducing completely mobile resolving sets. As with mobile resolving sets, we consider stationing a collection of robots at the vertices in a resolving set of a graph. Robots may move one at a time to any adjacent vertex as
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
- Qwen-RobotManip Technical Report: Alignment Unlocks Scale for Robotic Manipulation Foundation Models#327587
- Qwen-RobotManip Technical Report: Alignment Unlocks Scale for Robotic Manipulation Foundation Models#282815
- The rise of the robots and the crisis of moral patiency#717041
- Phase Regulation of Decentralized Cyclic Robotic Systems#648111
- Non-Prehensile Multi-Object Placement with Mobile Robots via Diffusion-Based Trajectory Planning#1296691
Record · ID 1297691
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