method · first seen 5 Nov 2026
LaCAM
Search-based complete solver for multi-agent pathfinding using lazy constraint addition over joint configurations.
Mentions per week
PapersCodeDiscussion
Earliest sources
- Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent PathfindingPapers · 5 Nov 2026 · Stephen Chang, Daniel Harabor
Latest sources
- Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent PathfindingPapers · 5 Nov 2026 · Stephen Chang, Daniel Harabor