Metraipolis › archive › dc_e494b540c93a
HALO: Heterogeneous Allocation Via Localized Observations for the Vehicle Routing Problem — arXiv:2609.38760
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.38760
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-07T12:39:38.893Z
- SHA-256 of the archived text
ffe1efb2777a14bc1f52367f92ba456a8d7e4d536d6c4269949f63975d4886c1- Stable URL of this page
https://metraipolis.com/documento/dc_e494b540c93a
How to cite
HALO: Heterogeneous Allocation Via Localized Observations for the Vehicle Routing Problem — arXiv:2609.38760 — arXiv (en), https://arxiv.org/abs/2609.38760 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e494b540c93a (Metraipolis archive dc_e494b540c93a, sha256 ffe1efb2777a14bc1f52367f92ba456a8d7e4d536d6c4269949f63975d4886c1)
BibTeX
@misc{dce494b540c93a,
title = {HALO: Heterogeneous Allocation Via Localized Observations for the Vehicle Routing Problem — arXiv:2609.38760},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.38760},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e494b540c93a; sha256 ffe1efb2777a14bc1f52367f92ba456a8d7e4d536d6c4269949f63975d4886c1},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.38760. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Scalable robotic fleets have become increasingly popular for various applications such as package delivery, warehouse management, and military operations. Prior fleet control algorithms solve centralized routing problems with up to $1{,}000$ tasks in controlled environments, yet they fail to consider realistic constraints such as limited observation and communication ranges typical of decentralized fleets. Thus, deploying existing fleet control algorithms into real-world settings is currently infeasible. To tackle this, we propose Heterogeneous Allocation via Localized Observations (HALO) to solve the Vehicle Routing Problem (VRP). HALO is a hybrid method that splits the VRP into allocation and routing portions to provide onboard, real-time solutions to robots in dynamic environments. During the allocation phase, HALO utilizes a heterogeneous graph neural network framework with unique message passing layers to explicitly separate the learning of spatial distributions and task-to-robot compatibility. Evaluation results on a partially observable, online variant of the VRP show HALO significantly outperforms the heuristic baseline while maintaining similar solution quality to an all-knowing offline variant of HALO. While HALO is explicitly designed for partially observable environments, it imposes no strict upper bound on the observation space allowing us to test HALO on the traditional static, single-depot VRP. Here, HALO outperforms state-of-the-art architectures strictly optimized for the static variant of the VRP by up to $14.06\%$. Throughout all testing, this framework maintains the quickest execution times which emphasizes its potential for large-scale, real-time deployment.
Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-10-01 in cs.MA).
Categorie arXiv: Robotics (cs.RO) ; Multiagent Systems (cs.MA).
Pagina del lavoro: https://arxiv.org/abs/2609.38760 — 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-07T12:12:18.646Z dalla pagina https://arxiv.org/catchup/cs.MA/2026-10-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).