Goal-Branching LaCAM: Temporary Goals as Search Branches in Dense Multi-Agent Pathfinding
Goal-Branching is proposed, where blocking agents are given temporary goals, each tried as an additional branch of LaCAM's search, and random and corridor-aware rules for choosing these temporary goals are examined and it is shown that completeness is preserved for any such rule.
Stephen S. H. Chang, Daniel Damir Harabor
· 0 citations