Symbolic Top-k Planning
Authors: David Speck, Robert Mattmüller, Bernhard Nebel9967-9974
AAAI 2020 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Our empirical analysis shows that SYM-K exceeds the current state of the art for both small and large k. and Figure 3 shows the k-coverage of SYM-K compared to K and FORBID-K. and Table 1 shows a domainwise comparison of SYM-K with bidirectional search and FORBID-K with naive plan construction. |
| Researcher Affiliation | Academia | David Speck, Robert Mattm uller, Bernhard Nebel University of Freiburg, Germany {speckd, mattmuel, nebel}@informatik.uni-freiburg.de |
| Pseudocode | No | The paper describes the SYM-K algorithm and its functionality in detail, but it does not include a formal pseudocode block or a figure labeled 'Algorithm' or 'Pseudocode'. |
| Open Source Code | Yes | Available online: https://github.com/speckdavid/symk |
| Open Datasets | Yes | The benchmark set we use consists of 73 planning domains from the optimal tracks of the International Planning Competitions 1998-2018. |
| Dataset Splits | No | The paper uses a benchmark set for evaluation and discusses k-coverage, but it does not specify any explicit training, validation, or test dataset splits, nor does it describe cross-validation or any other formal splitting methodology. |
| Hardware Specification | No | The paper states, 'For the experiment we use a time limit of 30 minutes and a 4 GB memory limit for translation, preprocessing, search and plan reports.' However, it does not specify any details about the hardware used, such as CPU or GPU models. |
| Software Dependencies | No | The paper mentions that 'SYM-K is implemented in the SYMBA (Torralba et al. 2014) planner, which is built on top of the FAST DOWNWARD planning system (Helmert 2006).' However, it does not provide specific version numbers for SYMBA or FAST DOWNWARD, which are necessary for full reproducibility. |
| Experiment Setup | Yes | For the experiment we use a time limit of 30 minutes and a 4 GB memory limit for translation, preprocessing, search and plan reports. |