Metraipolis › archive › dc_4a36d6d16ced

Belief-Driven Search in Connectivity-Constrained Mobile Sensor Networks with Convergence Guarantees — arXiv:2610.38256

Source
arXiv (en)
Original
https://arxiv.org/abs/2610.38256
License (as archived)
CC0-1.0
Archived
2026-11-01T03:00:39.901Z
SHA-256 of the archived text
100d42ed653a6970f53e28121d3072f395a703ae0045c024cc2ad242a57fbd70
Stable URL of this page
https://metraipolis.com/documento/dc_4a36d6d16ced

How to cite

Belief-Driven Search in Connectivity-Constrained Mobile Sensor Networks with Convergence Guarantees — arXiv:2610.38256 — arXiv (en), https://arxiv.org/abs/2610.38256 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4a36d6d16ced (Metraipolis archive dc_4a36d6d16ced, sha256 100d42ed653a6970f53e28121d3072f395a703ae0045c024cc2ad242a57fbd70)
BibTeX
@misc{dc4a36d6d16ced,
  title = {Belief-Driven Search in Connectivity-Constrained Mobile Sensor Networks with Convergence Guarantees — arXiv:2610.38256},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2610.38256},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4a36d6d16ced; sha256 100d42ed653a6970f53e28121d3072f395a703ae0045c024cc2ad242a57fbd70},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.38256. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Multi-agent search and coverage is critical to autonomous exploration, search-and-rescue, and defense applications. This paper investigates settings where a mobile sensor network is tasked with coordinating to discover the position of a stationary target within a bounded region. We develop a Bayesian update scheme where agents iteratively combine local uncertainties derived from their sensor measurements through inverse variance weighting to get a better global understanding of where the target may be located given some prior belief. Network agents' trajectories are governed by a primal-dual gradient update rule that simultaneously minimizes the expected sensing uncertainty and enforces network connectivity among the agents. We prove that the belief converges to the target under mild, planner-agnostic conditions, with an explicit exponential rate of false-hypothesis rejection and a bound on expected search time. Simulation results show that we can successfully find the target and collapse belief to the ground truth target location while ensuring connectivity of our sensor network. They also empirically confirm our theoretical bounds and revisiting assumption. Finally, we compare against a lawnmower sweep, showing that our method locates the target more quickly when the prior is informative.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2610.38256 — 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-01T02:25:30.731Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).