Cartesian Abstraction Refinement for Simple Numeric Planning
Proceedings of the International Conference on Automated Planning and Scheduling · 08.06.2026 · 36 (1) · 420-424
DOI: 10.1609/icaps.v36i1.42857 ↗Kurz gefasst
Fachartikel in der Zeitschrift Proceedings of the International Conference on Automated Planning and Scheduling, online erschienen am 08.06.2026. Verfasst von Tanja Schindler und 2 weiteren Autor:innen.
Abstract (Originalsprache)
Cartesian abstractions are a successful approach for obtaining admissible heuristics in optimal classical planning. In this paper, we generalize the counterexample-guided abstraction refinement (CEGAR) algorithm to compute Cartesian abstractions for simple numeric planning. Specifically, our CEGAR algorithm operates on a special form of Cartesian states consisting of a single interval per numeric variable. We prove that, in the absence of zero-cost actions, this algorithm is semi-complete and optimal. Our experimental evaluation shows that our approach performs similarly to other abstraction heuristics and provides better heuristic estimates in multiple domains.
Zitieren
APA
Schindler, T., Speck, D., & Helmert, M. (2026). Cartesian Abstraction Refinement for Simple Numeric Planning. Proceedings of the International Conference on Automated Planning and Scheduling, 36(1), 420-424. https://doi.org/10.1609/icaps.v36i1.42857
Vancouver
Schindler T, Speck D, Helmert M. Cartesian Abstraction Refinement for Simple Numeric Planning. Proceedings of the International Conference on Automated Planning and Scheduling. 2026;36(1):420-424. doi:10.1609/icaps.v36i1.42857
BibTeX
@article{Schindler2026,
author = {Schindler, Tanja and Speck, David and Helmert, Malte},
title = {Cartesian Abstraction Refinement for Simple Numeric Planning},
journal = {Proceedings of the International Conference on Automated Planning and Scheduling},
year = {2026},
volume = {36},
number = {1},
pages = {420--424},
doi = {10.1609/icaps.v36i1.42857}
}
EUVIMED