Metraipolis › archive › dc_4f1faa558336

Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding — arXiv:2611.07528

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07528
License (as archived)
CC0-1.0
Archived
2026-11-06T14:41:38.170Z
SHA-256 of the archived text
2d49c382be9544f1d7c420a378f97b79956f21dca1805edf2d5e6029ad997e8d
Stable URL of this page
https://metraipolis.com/documento/dc_4f1faa558336

How to cite

Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding — arXiv:2611.07528 — arXiv (en), https://arxiv.org/abs/2611.07528 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_4f1faa558336 (Metraipolis archive dc_4f1faa558336, sha256 2d49c382be9544f1d7c420a378f97b79956f21dca1805edf2d5e6029ad997e8d)
BibTeX
@misc{dc4f1faa558336,
  title = {Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding — arXiv:2611.07528},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07528},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_4f1faa558336; sha256 2d49c382be9544f1d7c420a378f97b79956f21dca1805edf2d5e6029ad997e8d},
  year = {2026}
}

Archived text

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

LaCAM is a search-based solver for multi-agent pathfinding (MAPF) that runs a depth-first search over joint configurations, using PIBT to generate successors and lazily adding single-agent constraints to explore alternatives. Although LaCAM is complete, it can struggle on dense, corridor-heavy instances because extracting blocking agents from deadlocks requires coordinated moves of several agents, often away from their goals, which PIBT's greedy one-step successors rarely propose and which LaCAM can only reach by enumerating constraints one agent at a time. This paper proposes Goal-Branching, where blocking agents are given temporary goals, each tried as an additional branch of LaCAM's search. We examine random and corridor-aware rules for choosing these temporary goals and show that completeness is preserved for any such rule. On dense instances (60-90% of free cells occupied) of three maze and room maps, Goal-Branching solves 89% of instances against 44% for LaCAM*, and, on instances both solve, it finds a first solution 10-14x faster on maze-32-32-2 and room-32-32-4, and nearly 200x faster in median time at 75% density on room-32-32-4. Solution cost increases by 15-22% on instances both solve, while on open maps and the full MovingAI benchmark its solutions cost no more than those of LaCAM* and it is at most 3% slower.

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.07528 — 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-06T14:18:42.640Z dalla pagina https://arxiv.org/list/cs.AI/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).