The shortest path problem in graphs is fundamental to AI. Nearly all var...
The MAPF problem is the fundamental problem of planning paths for multip...
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The obje...
We formalize the problem of multi-agent path finding with deadlines
(MAP...
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
Recent advances in metareasoning for search has shown its usefulness in
...
Grids with blocked and unblocked cells are often used to represent terra...
Korf, Reid, and Edelkamp introduced a formula to predict the number of n...
Distributed constraint optimization (DCOP) problems are a popular way of...
The obvious way to use several admissible heuristics in A* is to take th...
Informally, a set of abstractions of a state space S is additive if the
...