Code for the SoCS 2012 paper "Efficient Implementation of Pattern Database Heuristics for Classical Planning"

This bundle contains code, including experiment scripts, and benchmarks for reproducing all experiments reported in the paper.

The directory fast-downward contains the implementation based on Fast Downward. Note that the implementation is part of current Fast Downward and maintained there, see fast-downward.org and github.com/aibasel/downward. The directory also contains the experiment scripts used to conduct the experiments, in the subdirectory new-scripts (ss-*). It further contains the PDDL benchmarks from the optimal sequential track IPC 2011 (and more), in the subdirectory benchmarks.

For convenience, we also include a copy of the HSP planner obtained from its authors for usage in the paper. Please refer to http://users.cecs.anu.edu.au/~patrik/un-hsps.html for current versions of this planner.

Note on license: we chose GPL v3.0 or later because we consider our implementation based on Fast Downward the main contribution of this package, and current Fast Downward comes with GPL v3.0. This license does not apply to HSP which we do not maintain.