I have participated in the determenistic part of the IPC-2014 -
International Planning Competition 2014 with two planners,
Mercury for the sequential satisficing track and Metis for the sequential optimal track.
Runner-Up in the sequential satisficing track, and
Innovative Planner Award.
Mercury (with Joerg Hoffmann) has won two awards:
The source code for the planners can be found here (or by request):
I have participated in the determenistic part of the IPC-2011 -
International Planning Competition 2011 with four planners based on Implicit Abstraction Heuristics.
Sequential Satisficing Track
- ForkUniform - Planner iteratively runs Weighted A* with Fork Decomposition based heuristic.
Sequential Optimal Track
- ForkInit - Planner runs A* with Fork Decomposition based heuristic, optimal for initial state action-cost
- IForkInit - Planner runs A* with Inverted Fork Decomposition based heuristic, optimal for initial state action-cost
- LMFork - Planner runs LMA* with heuristic calculated on the landmarks enriched task, Fork Decomposition based
heuristic, optimal for initial state action-cost partitioning.
The code of Implicit Abstraction Heuristics is implemented on the Fast-Downward
platform, FDTech branch.
The code is available upon request.