Metraipolis › archive › dc_e74915508ddf

Model-Based Reinforcement Learning for Heterogeneous Multi-Robot Task Assignment Under Distribution Shifts — arXiv:2608.21554

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.21554
License (as archived)
CC0-1.0
Archived
2026-10-18T09:01:44.964Z
SHA-256 of the archived text
9d2616362a1d6d1a3751e06312c4446d420cc42209634b1022d2b32fcdde40d8
Stable URL of this page
https://metraipolis.com/documento/dc_e74915508ddf

How to cite

Model-Based Reinforcement Learning for Heterogeneous Multi-Robot Task Assignment Under Distribution Shifts — arXiv:2608.21554 — arXiv (en), https://arxiv.org/abs/2608.21554 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e74915508ddf (Metraipolis archive dc_e74915508ddf, sha256 9d2616362a1d6d1a3751e06312c4446d420cc42209634b1022d2b32fcdde40d8)
BibTeX
@misc{dce74915508ddf,
  title = {Model-Based Reinforcement Learning for Heterogeneous Multi-Robot Task Assignment Under Distribution Shifts — arXiv:2608.21554},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.21554},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e74915508ddf; sha256 9d2616362a1d6d1a3751e06312c4446d420cc42209634b1022d2b32fcdde40d8},
  year = {2026}
}

Archived text

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

Heterogeneous multi-robot service systems must assign requests to compatible robots, construct feasible schedules, and adapt as new tasks arrive online. Historical data can help anticipate future demand, but relying too heavily on inaccurate predictions can degrade performance under distribution shifts. We develop a prediction-aware adaptive rollout framework for heterogeneous multi-robot task assignment with scheduled and real-time requests. The problem is formulated as a finite-horizon stochastic dynamic program incorporating robot-task compatibility, ordered service requirements, routing constraints, service windows, and end-of-horizon return requirements. The proposed policy evaluates current assignments using sampled future request scenarios while restricting immediate commitments to requests already observed. To enable online use, the framework combines pruned candidate controls, wait actions, and an interaction-aware base policy for efficient future-cost estimation. Robustness to forecast error is provided by adaptively reweighting predicted requests based on recent prediction mismatch and selectively re-optimizing assigned but unstarted requests. We also introduce a historical-data-driven procedure for selecting the heterogeneous fleet composition before deployment. In a case study using real nursing-task requests from hospital inpatient floors, the proposed approach achieves near-complete service and reduces serviced-request wait times relative to reactive, token-passing, prediction-positioning, and myopic greedy baselines, with the largest improvements in tail-delay metrics.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-08-25 in cs.RO).
Categorie arXiv: Robotics (cs.RO) ; Machine Learning (cs.LG); Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2608.21554 — 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-18T08:57:47.833Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-08-25?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).