Proofs, Code and Data for Subset-Saturated Transition Cost Partitioning
Lists
Only you see this
Abstract
sstcp-code.zip contains an extended version of the Fast Downward planning system (http://fast-downward.org). Please see http://www.fast-downward.org for instructions on how to compile the planner. It contains additional code for optimal transition cost partitioning and subset-saturated transition cost partitioning.<br> The latest version is available at GitHub: https://github.com/drexlerd/fast-downward-sstcp sstcp-single_order-experimental_data.zip contains experimental data for single orders of the heuristics. sstcp-single_order-amask-experimental_data.zip contains experimental data for single orders of the heuristics and additional switching between operator and transition saturators depending on a simple threshold parameter that depends on the number of abstract transitions. sstcp-multiple_orders-amask-experiment_data.zip contains experimental data for multiple orders of the heuristics and additional switching between operator and transition saturators depending on a simple threshold parameter that depends on the number of abstract transitions. drexler-et-al-icaps2021-with-proof.pdf is the paper published at ICAPS2021 with proofs.<br>
BibTeX
@inproceedings{drexler2021proofs,
author = {Dominik Drexler and Jendrik Seipp and David Speck},
title = {{Proofs, Code and Data for Subset-Saturated Transition Cost Partitioning}},
booktitle = {Zenodo},
year = {2021},
doi = {10.5281/zenodo.5078938},
}Loading related content...