Metraipolis › archive › dc_41e17788713a
Time-Efficient Active Bearing-Only Localization with Reception and Coverage Guarantees — arXiv:2610.07893
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.07893
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T11:49:15.622Z
- SHA-256 of the archived text
1a9930f88307c5e5d4560d2250aadf984ef76f984006e743b024ab1e2552e9c7- Stable URL of this page
https://metraipolis.com/documento/dc_41e17788713a
How to cite
Time-Efficient Active Bearing-Only Localization with Reception and Coverage Guarantees — arXiv:2610.07893 — arXiv (en), https://arxiv.org/abs/2610.07893 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_41e17788713a (Metraipolis archive dc_41e17788713a, sha256 1a9930f88307c5e5d4560d2250aadf984ef76f984006e743b024ab1e2552e9c7)
BibTeX
@misc{dc41e17788713a,
title = {Time-Efficient Active Bearing-Only Localization with Reception and Coverage Guarantees — arXiv:2610.07893},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.07893},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_41e17788713a; sha256 1a9930f88307c5e5d4560d2250aadf984ef76f984006e743b024ab1e2552e9c7},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.07893. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We consider the localization and removal of a stationary omnidirectional radio source using a mobile sensor with bounded bearing errors and an unknown reception radius within known bounds. The objective is to minimize expected remaining action time under a fixed continuation policy while guaranteeing reception and source removal under the sensing model. A three-disk filter ensures reception, and a minimum enclosing circle certifies coverage of all bearing-consistent source positions. Monte Carlo sample-average search ranks a finite candidate set by complete mission time, including travel, readings, terminal service, and a finite fallback scan that ensures completion under the stated assumptions. In the reference case, 5000 independent validation missions average 60.40 s (approximate 95\% confidence interval: [59.96, 60.84] s), saving 19.39\% relative to a prescribed lateral point and 0.79\% relative to a short-travel point. All 25,000 selected-point validation missions across five initial geometries succeed, with lower mean completion times than both prescribed designs. A same-grid objective ablation shows that minimizing travel or reading count alone can increase mean completion time. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2610.07893 — 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-07T11:21:09.845Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).