research
∙
08/15/2023
Tightest Admissible Shortest Path
The shortest path problem in graphs is fundamental to AI. Nearly all var...
share
research
∙
06/19/2019
Multi-Agent Pathfinding: Definitions, Variants, and Benchmarks
The MAPF problem is the fundamental problem of planning paths for multip...
research
∙
06/11/2018
Multi-Agent Path Finding with Deadlines
We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The obje...
research
∙
05/13/2018
Multi-Agent Path Finding with Deadlines: Preliminary Results
We formalize the problem of multi-agent path finding with deadlines (MAP...
research
∙
07/02/2017
Modifying Optimal SAT-based Approach to Multi-agent Path-finding Problem to Suboptimal Variants
In multi-agent path finding (MAPF) the task is to find non-conflicting p...
research
∙
11/24/2014
Rational Deployment of Multiple Heuristics in IDA*
Recent advances in metareasoning for search has shown its usefulness in ...
research
∙
01/16/2014
Theta*: Any-Angle Path Planning on Grids
Grids with blocked and unblocked cells are often used to represent terra...
research
∙
01/15/2014
Predicting the Performance of IDA* using Conditional Distributions
Korf, Reid, and Edelkamp introduced a formula to predict the number of n...
research
∙
01/15/2014
BnB-ADOPT: An Asynchronous Branch-and-Bound DCOP Algorithm
Distributed constraint optimization (DCOP) problems are a popular way of...
research
∙
05/22/2013
Towards Rational Deployment of Multiple Heuristics in A*
The obvious way to use several admissible heuristics in A* is to take th...
research
∙
10/31/2011
