Metraipolis › archive › dc_2cdc59c4cde3
Searching the Plane in the Segment Visibility Model — arXiv:2611.03161
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.03161
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T18:26:52.767Z
- SHA-256 of the archived text
b757337ed5476411febc22284087cad31bb3d5f97ff1ca522630063558b2b3f6- Stable URL of this page
https://metraipolis.com/documento/dc_2cdc59c4cde3
How to cite
Searching the Plane in the Segment Visibility Model — arXiv:2611.03161 — arXiv (en), https://arxiv.org/abs/2611.03161 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2cdc59c4cde3 (Metraipolis archive dc_2cdc59c4cde3, sha256 b757337ed5476411febc22284087cad31bb3d5f97ff1ca522630063558b2b3f6)
BibTeX
@misc{dc2cdc59c4cde3,
title = {Searching the Plane in the Segment Visibility Model — arXiv:2611.03161},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.03161},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2cdc59c4cde3; sha256 b757337ed5476411febc22284087cad31bb3d5f97ff1ca522630063558b2b3f6},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.03161. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study deterministic search by $n \geq 2$ unit-speed robots starting at the origin of the Euclidean plane. We introduce the concept of \emph{segment visibility} whereby a stationary target $x$ at distance $d=\|x\|>0$ is discovered at the first instant $t$ when $x$ belongs to the segment joining a pair of robots at time $t$. Discovery time is compared with the omniscient optimum $d$. We distinguish two knowledge models according to whether the robots know $d$ in advance. For $n=2$ robots, in the \emph{known-$d$} model, we give a symmetric four-phase algorithm and prove that its competitive ratio is optimal: $1+\sqrt3+\pi/6$; the matching lower bound follows from the known-distance two-robot shoreline-search theorem through an explicit reduction to segment detection. For $n=2$ robots, in the \emph{unknown-$d$} model, a three-circle construction and a quantitative initial-path estimate yield the stronger lower bound $\sqrt3+\pi/6+\sqrt{17}/4 \approx3.286425990$, giving an explicit positive cost for not knowing the radius; we also analyze a feasible antipodal-diameter logarithmic-spiral algorithm with optimized ratio $8.928516954\ldots$, thus proving that the competitive ratio when $d$ is unknown is at least $ \sqrt3+\pi/6+\sqrt{17}/4 $ and at most $8.928516954\ldots.$ For $n \geq 3$ robots, the competitive ratio of finding the target is exactly $\sec (\pi/n)$ regardless of whether or not $d$ is known to the robots.
Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno).
Categorie arXiv: Discrete Mathematics (cs.DM) ; Distributed, Parallel, and Cluster Computing (cs.DC).
Pagina del lavoro: https://arxiv.org/abs/2611.03161 — 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-11-03T18:10:22.863Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).