Metraipolis › archive › dc_e318093e69cb
Travel Cost Calibration for Multi-Agent Target Assignment and Pathfinding — arXiv:2611.09396
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.09396
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-09T22:34:05.608Z
- SHA-256 of the archived text
69da2cb652dd86c2b8aa8bf2181fa2cae83c656ab566318abfa7dc9bc482e1cd- Stable URL of this page
https://metraipolis.com/documento/dc_e318093e69cb
How to cite
Travel Cost Calibration for Multi-Agent Target Assignment and Pathfinding — arXiv:2611.09396 — arXiv (en), https://arxiv.org/abs/2611.09396 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_e318093e69cb (Metraipolis archive dc_e318093e69cb, sha256 69da2cb652dd86c2b8aa8bf2181fa2cae83c656ab566318abfa7dc9bc482e1cd)
BibTeX
@misc{dce318093e69cb,
title = {Travel Cost Calibration for Multi-Agent Target Assignment and Pathfinding — arXiv:2611.09396},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.09396},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_e318093e69cb; sha256 69da2cb652dd86c2b8aa8bf2181fa2cae83c656ab566318abfa7dc9bc482e1cd},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.09396. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Target assignment and pathfinding (TAPF) is an appealing extension of classical multi-agent pathfinding (MAPF): each agent has a set of targets, and the planner must both assign a target to each agent and plan collision-free paths for them. A trivial approach is to compute an assignment that minimizes the total single-agent shortest-path distance over agent--target pairs, and then solve the resulting MAPF instance. However, this approach falls short because the shortest-path distance remains a proxy that ignores interference among agents. Assigning targets based on the costs agents actually pay, which depend on how every other agent is assigned and routed, would yield a better final outcome. To this end, we propose an iterative TAPF method that improves target assignments by calibrating travel cost estimates from fast, suboptimal MAPF feedback. Experiments show that our method produces solutions close to optimal on small instances and outperforms existing planners in solution quality on larger ones. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.AI, nuovi lavori del giorno). Categorie arXiv: Artificial Intelligence (cs.AI). Pagina del lavoro: https://arxiv.org/abs/2611.09396 — 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-09T22:30:47.279Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).