Metraipolis › archive › dc_869b3fa38864
ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search — arXiv:2609.14208
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.14208
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T02:14:31.415Z
- SHA-256 of the archived text
458e829d8739c1d6a2d07b53bd0152fa6f22f5a8be9b18322bd6e9cf256d1e6c- Stable URL of this page
https://metraipolis.com/documento/dc_869b3fa38864
How to cite
ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search — arXiv:2609.14208 — arXiv (en), https://arxiv.org/abs/2609.14208 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_869b3fa38864 (Metraipolis archive dc_869b3fa38864, sha256 458e829d8739c1d6a2d07b53bd0152fa6f22f5a8be9b18322bd6e9cf256d1e6c)
BibTeX
@misc{dc869b3fa38864,
title = {ITA-LaCAM: A Complete and Scalable TAPF Solver via Assignment-Aware Configuration-Space Search — arXiv:2609.14208},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.14208},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_869b3fa38864; sha256 458e829d8739c1d6a2d07b53bd0152fa6f22f5a8be9b18322bd6e9cf256d1e6c},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.14208. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Combined Target Assignment and Path Finding (TAPF) requires assigning targets for agents while simultaneously planning collision-free paths. We present ITA-LaCAM, a complete and scalable TAPF solver inspired by LaCAM and ITA-CBS. In ITA-LaCAM, each joint-configuration node carries an agent-to-target matching. When a successor is generated, ITA-LaCAM incrementally repairs the matching for the agents that moved and uses the targets to guide PIBT successor generation. This design enables adaptive reassignment without explicitly enumerating the combinatorial assignment space, while preserving LaCAM's completeness and scalability. Across 9,760 benchmark instances on eight maps with 5--200 agents, ITA-LaCAM solved 100% of the instances, compared with 95.6% for IR-TAPF configured with DBS-Hungarian. ITA-LaCAM found an initial solution faster in 84.0% of the comparisons and achieved a lower sum of costs in 65.0% of the instances solved by both methods. Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-15 in cs.RO). Categorie arXiv: Robotics (cs.RO). Pagina del lavoro: https://arxiv.org/abs/2609.14208 — 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-16T01:52:32.319Z dalla pagina https://arxiv.org/catchup/cs.RO/2026-09-15?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).