Published March 18, 2024 | Version v1
Software Open

Appendix, Code, and Experimental Data of the ICAPS 2024 paper "Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning"

  • 1. ROR icon Linköping University

Description

This archive contains the appendix, code, and experimental data for the ICAPS 2024 paper titled "Decoupled Search for the Masses: A Novel Task Transformation for Classical Planning."

Appendix

The file appendix-speck-gnad-icaps2024.pdf contains the full proofs of our paper, which were omitted in the paper due to space constraints.

Code

The file code-sg.tar.gz contains our code for searching on a task transformation that embodies decoupled search. Please refer to the included readme file for instructions on how to build and run the code. You can also find the latest version of the code on GitHub: https://github.com/speckdavid/decoupling-transformer.

The files code-gh.tar.gz and code-ts.tar.gz contain the code for native decoupled search and the search on a merge-and-shrink task reformulation used for comparison.

Benchmarks

The file benchmarks.tar.gz contains the PDDL benchmarks from the International Planning Competitions 1998-2023. We have used all 2106 STRIPS instances from the satisficing sequential tracks of the International Planning Competitions 1998-2023.

Experiment Data

The remaining files (log-X.tar.gz and properties-X.tar.gz) contain the raw and parsed experiment data for the experiments described in the paper. All experiment scripts can be found in the experiments folders within the corresponding code archives.

Notes (English)

This work was partially supported by TAILOR, a project funded by the EU Horizon 2020 research and innovation programme under grant agreement no. 952215, and by the Wallenberg AI, Autonomous Systems and Software Program (WASP) funded by the Knut and Alice Wallenberg Foundation. The computations were enabled by resources provided by the National Academic Infrastructure for Supercomputing in Sweden (NAISS) at the National Supercomputer Centre at Linköping University partially funded by the Swedish Research Council through grant agreement no. 2022-06725. David Speck was funded by the Swiss National Science Foundation (SNSF) as part of the project "Unifying the Theory and Algorithms of Factored State-Space Search" (UTA).

Files

appendix-speck-gnad-icaps2024.pdf

Files (68.0 MB)

Name Size Download all
md5:c5df06bac5b1937c1ec04cac0f528a5a
163.0 kB Preview Download
md5:67402fedac84ac5c729891d3a399419c
20.8 MB Download
md5:38dcf9dbf81da07ba875d09f964a8c5e
1.1 MB Download
md5:9b6a6114d45db9586595eac4d74ba9d7
591.8 kB Download
md5:1a6bc6d90f718ab63aae50b5e17c2215
661.6 kB Download
md5:73a0db40b2e3f3e315f180cfd3f480d8
7.9 MB Download
md5:78a9663804d05226dbe7dce0f93f6441
27.8 MB Download
md5:4d3b022569c40b698244f7ba511001c1
6.2 MB Download
md5:82a06172e65d18781a86128e73a4c56d
2.3 MB Download
md5:138fb4d4028ad1a83304c16adec66949
226.4 kB Download
md5:d5ebd69b0ce05b6485c23932336d9186
277.0 kB Download

Additional details

Funding

European Commission
TAILOR – Foundations of Trustworthy AI - Integrating Reasoning, Learning and Optimization 952215