Metraipolis › archive › dc_eade49c64e5f
Going in Circles: Collaborative Multi-Robot Treasure Hunting — arXiv:2608.12115
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.12115
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T05:52:51.992Z
- SHA-256 of the archived text
225d275cc7f0ee26e6744c84ee62805d72dcafe10757bcdd004043823ab26d0f- Stable URL of this page
https://metraipolis.com/documento/dc_eade49c64e5f
How to cite
Going in Circles: Collaborative Multi-Robot Treasure Hunting — arXiv:2608.12115 — arXiv (en), https://arxiv.org/abs/2608.12115 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_eade49c64e5f (Metraipolis archive dc_eade49c64e5f, sha256 225d275cc7f0ee26e6744c84ee62805d72dcafe10757bcdd004043823ab26d0f)
BibTeX
@misc{dceade49c64e5f,
title = {Going in Circles: Collaborative Multi-Robot Treasure Hunting — arXiv:2608.12115},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.12115},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_eade49c64e5f; sha256 225d275cc7f0ee26e6744c84ee62805d72dcafe10757bcdd004043823ab26d0f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.12115. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
This paper investigates a multi-robot search-and-visit problem involving $n$ robots starting at the origin and $k$ unknown treasures hidden on the unit circle $\mathcal{C}$. The robots move independently anywhere in the plane with a maximum speed of 1 and instantly share discovery information. The goal is to determine an algorithm that minimizes the total time needed for all robots to individually visit every treasure. To establish the foundational limits of this task, we first solve an auxiliary optimal routing problem for a single robot on $\mathcal{C}$ that possesses complete prior knowledge of the treasure locations. The exact analysis of this auxiliary problem yields explicit upper and lower bounds for the original search problem.
Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-13 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS) ; Computational Geometry (cs.CG); Discrete Mathematics (cs.DM).
Pagina del lavoro: https://arxiv.org/abs/2608.12115 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-19T05:48:37.120Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-13?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).