Metraipolis › archive › dc_33f3388e604c

SPARROW: Survival-POMCP for Adaptive Robot Routing, Observation, and Waiting — arXiv:2609.21008

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.21008
License (as archived)
CC0-1.0
Archived
2026-10-10T02:29:54.366Z
SHA-256 of the archived text
2b4e3b712f7c91dee826551da4085ecc5797384c2a4e118833341c2ed7b1ae96
Stable URL of this page
https://metraipolis.com/documento/dc_33f3388e604c

How to cite

SPARROW: Survival-POMCP for Adaptive Robot Routing, Observation, and Waiting — arXiv:2609.21008 — arXiv (en), https://arxiv.org/abs/2609.21008 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_33f3388e604c (Metraipolis archive dc_33f3388e604c, sha256 2b4e3b712f7c91dee826551da4085ecc5797384c2a4e118833341c2ed7b1ae96)
BibTeX
@misc{dc33f3388e604c,
  title = {SPARROW: Survival-POMCP for Adaptive Robot Routing, Observation, and Waiting — arXiv:2609.21008},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.21008},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_33f3388e604c; sha256 2b4e3b712f7c91dee826551da4085ecc5797384c2a4e118833341c2ed7b1ae96},
  year = {2026}
}

Archived text

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

Temporary obstacles that may block a robot's planned route create a sequential navigation problem: a robot must decide whether to wait for a blockage to clear, reroute, or acquire more information about the obstacle before acting. We formulate graph navigation among temporary obstacles as a partially observable semi-Markov decision process and introduce SPARROW, a belief-space planner built on Partially Observable Monte Carlo Planning (POMCP). SPARROW searches over traversal, observation, and finite-duration waiting actions while maintaining a particle belief over latent obstacle classes and clearance times. Class-conditioned survival models are learned online from both clearance observations and right-censored encounters where the robot reroutes before clearance is observed. A generative model simulates obstacle arrivals and clearances as each action unfolds, so the planner can account for blockages that may occur along alternative routes. We further introduce a value-of-learning criterion that trades the immediate cost of collecting labelled survival data against its expected reduction in future navigation regret. Across two simulation graphs and multiple obstacle-class settings, SPARROW reduces mean time-to-goal by 12-26% relative to OSCAR, a recent survival-based method for the same problem. On a physical mobile robot, SPARROW reduces mean time-to-goal by 20.5% relative to OSCAR while selectively observing, waiting, and rerouting as environment conditions change.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-21 in cs.RO).
Categorie arXiv: Robotics (cs.RO).
Pagina del lavoro: https://arxiv.org/abs/2609.21008 — 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-10T02:09:55.282Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-21?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).