Saturated Post-Hoc Optimization for Classical Planning
Abstract
Saturated cost partitioning and post-hoc optimization are two powerful cost partitioning algorithms for optimal classical planning. The main idea of saturated cost partitioning is to give each considered heuristic only the fraction of remaining operator costs that it needs to prove its estimates. We show how to apply this idea to post-hoc optimization and obtain a heuristic that dominates the original both in theory and on the IPC benchmarks.
Cite
Text
Seipp et al. "Saturated Post-Hoc Optimization for Classical Planning." AAAI Conference on Artificial Intelligence, 2021. doi:10.1609/AAAI.V35I13.17419Markdown
[Seipp et al. "Saturated Post-Hoc Optimization for Classical Planning." AAAI Conference on Artificial Intelligence, 2021.](https://mlanthology.org/aaai/2021/seipp2021aaai-saturated/) doi:10.1609/AAAI.V35I13.17419BibTeX
@inproceedings{seipp2021aaai-saturated,
title = {{Saturated Post-Hoc Optimization for Classical Planning}},
author = {Seipp, Jendrik and Keller, Thomas and Helmert, Malte},
booktitle = {AAAI Conference on Artificial Intelligence},
year = {2021},
pages = {11947-11953},
doi = {10.1609/AAAI.V35I13.17419},
url = {https://mlanthology.org/aaai/2021/seipp2021aaai-saturated/}
}