New LaCAM Variant Uses Temporary Goals as Search Branches for Dense Multi-Agent Pathfinding
A new arXiv paper introduces Goal-Branching LaCAM, extending the search-based MAPF solver LaCAM by treating temporary goals as search branches within its depth-first search over joint configurations, which uses PIBT to generate successors.
Read the full story at arXiv cs.AI ↗
Timeline · 1 report
- 2026-11-06 05:00 · arXiv cs.AI
Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding