research
∙
09/07/2022
The (Un)Scalability of Heuristic Approximators for NP-Hard Search Problems
The A* algorithm is commonly used to solve NP-hard combinatorial optimiz...
share
research
∙
10/03/2020
EECBS: A Bounded-Suboptimal Search for Multi-Agent Path Finding
Multi-Agent Path Finding (MAPF), i.e., finding collision-free paths for ...
research
∙
05/15/2020
Lifelong Multi-Agent Path Finding in Large-Scale Warehouses
Multi-Agent Path Finding (MAPF) is the problem of moving a team of agent...
research
∙
09/10/2018
PRIMAL: Pathfinding via Reinforcement and Imitation Multi-Agent Learning
Multi-agent path finding (MAPF) is an essential component of many large-...
research
∙
01/16/2014
