Goal-Branching LaCAM uses temporary goals as search branches in dense multi-agent pathfinding
Read the original at arxiv.org→arXiv:2611.07528v1 Announce Type: new Abstract: 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...
Original headline: "Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding"
Coverage timeline
- Nov 6, 05:00 UTC arXiv cs.AI lead source Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding