
MultiAgent Pathfinding: Definitions, Variants, and Benchmarks
The MAPF problem is the fundamental problem of planning paths for multip...
read it

MultiAgent Path Finding with Deadlines
We formalize MultiAgent Path Finding with Deadlines (MAPFDL). The obje...
read it

MultiAgent Path Finding with Deadlines: Preliminary Results
We formalize the problem of multiagent path finding with deadlines (MAP...
read it

Modifying Optimal SATbased Approach to Multiagent Pathfinding Problem to Suboptimal Variants
In multiagent path finding (MAPF) the task is to find nonconflicting p...
read it

Rational Deployment of Multiple Heuristics in IDA*
Recent advances in metareasoning for search has shown its usefulness in ...
read it

Theta*: AnyAngle Path Planning on Grids
Grids with blocked and unblocked cells are often used to represent terra...
read it

Predicting the Performance of IDA* using Conditional Distributions
Korf, Reid, and Edelkamp introduced a formula to predict the number of n...
read it

BnBADOPT: An Asynchronous BranchandBound DCOP Algorithm
Distributed constraint optimization (DCOP) problems are a popular way of...
read it

Towards Rational Deployment of Multiple Heuristics in A*
The obvious way to use several admissible heuristics in A* is to take th...
read it

A General Theory of Additive State Space Abstractions
Informally, a set of abstractions of a state space S is additive if the ...
read it
Ariel Felner
is this you? claim profile