Effective Planning with More Expressive Languages
Authors: Guillem Francès, Hector Geffner
IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Experiments illustrating the computational value of planning with more expressive languages are also reported. 5 Experimental Results We test the FS planner on some FSTRIPS domains using the hc FF heuristic and compare it to standard planners on equivalent PDDL models. |
| Researcher Affiliation | Academia | Guillem Franc es Universitat Pompeu Fabra Barcelona, Spain guillem.frances@upf.edu Hector Geffner ICREA & Universitat Pompeu Fabra Barcelona, Spain hector.geffner@upf.edu |
| Pseudocode | No | No pseudocode or algorithm blocks were found. |
| Open Source Code | Yes | FS s source code and all problem encodings are available on gfrances.github.io/pubs. |
| Open Datasets | No | The paper describes problem 'domains' (e.g., COUNTERS, GROUPING) and mentions testing instances, but does not provide concrete access information (link, DOI, repository, or formal citation with author/year) for publicly available datasets used in the experiments. |
| Dataset Splits | No | The paper does not provide specific details on training, validation, and test dataset splits (e.g., exact percentages or sample counts) for reproducibility. |
| Hardware Specification | Yes | All planners run a maximum of 30 min. on a cluster with AMD Opteron 6300@2.4Ghz nodes, and are allowed up to 8GB of memory. |
| Software Dependencies | No | The paper mentions 'the standard Gecode CP solver [Gecode Team, 2006]' but does not provide a specific version number for it or other software dependencies. |
| Experiment Setup | Yes | FS can use any of the four lifted RPG heuristics, hmax, and hc FF, to drive a plain greedy best first search. We run FF [Hoffmann and Nebel, 2001] and Metric-FF [Hoffmann, 2003], the latter on encodings with numeric fluents if suitable, using the same greedy best-first search strategy (i.e. f(n) = h(n) and EHC disabled). We also run the state-of-the-art Fast-Downward planner (LAMA-2011 configuration)... |