Metraipolis › archive › dc_7dcab488d364
Orienteering Problem with Uncertain Time-Varying Rewards: Framework and Benchmark for Everyday Service Robotics — arXiv:2608.18672
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2608.18672
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-18T13:45:15.106Z
- SHA-256 of the archived text
c6a69287eb2cc36effd202dae765bfe90f306aa96bc9ffaee67904b07253a3c8- Stable URL of this page
https://metraipolis.com/documento/dc_7dcab488d364
How to cite
Orienteering Problem with Uncertain Time-Varying Rewards: Framework and Benchmark for Everyday Service Robotics — arXiv:2608.18672 — arXiv (en), https://arxiv.org/abs/2608.18672 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7dcab488d364 (Metraipolis archive dc_7dcab488d364, sha256 c6a69287eb2cc36effd202dae765bfe90f306aa96bc9ffaee67904b07253a3c8)
BibTeX
@misc{dc7dcab488d364,
title = {Orienteering Problem with Uncertain Time-Varying Rewards: Framework and Benchmark for Everyday Service Robotics — arXiv:2608.18672},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2608.18672},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7dcab488d364; sha256 c6a69287eb2cc36effd202dae765bfe90f306aa96bc9ffaee67904b07253a3c8},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.18672. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We present the orienteering problem with uncertain time-varying rewards (OP-UTVR), a novel variant of the orienteering problem (OP). While most existing OP formulations assume rewards to be known in advance, practical applications involve uncertain and time-varying rewards, as with shifting customer demand for delivery agents. OP-UTVR relaxes this assumption by allowing agents to estimate reward dynamics from observations and forecast future rewards. This enables informed routing decisions despite stochastic reward changes and inevitable prediction errors. We address this problem using three planners that differ in planning horizon and online adaptivity, and derive theoretical bounds on their performance under reward stochasticity. We further introduce a mobile service robot benchmark for OP-UTVR, where a robot navigates among pedestrians in indoor environments. Experiments reveal trade-offs between planning horizon and adaptivity, and demonstrate the effectiveness of long-horizon planning with online adaptation. Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-08-20 in cs.AI). Categorie arXiv: Robotics (cs.RO) ; Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2608.18672 — 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-18T13:41:17.962Z dalla pagina https://arxiv.org/catchup/cs.AI/2026-08-20?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).