Saturated Post-hoc Optimization for Classical Planning
AbstractSaturated 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.
How to Cite
Seipp, J., Keller, T., & Helmert, M. (2021). Saturated Post-hoc Optimization for Classical Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 35(13), 11947-11953. Retrieved from https://ojs.aaai.org/index.php/AAAI/article/view/17419
AAAI Technical Track on Planning, Routing, and Scheduling