EUVIMEDEUVIMED entdecken
Crossref

From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations

Malte Helmert, Gabriele Röger

Proceedings of the International Symposium on Combinatorial Search · 14.08.2026 · 19 (1) · 56-64

DOI: 10.1609/socs.v19i1.43073 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the International Symposium on Combinatorial Search, online erschienen am 14.08.2026. Verfasst von Malte Helmert und 1 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The four major classes of state space abstractions in classical planning are projections, domain abstractions, Cartesian abstractions and merge-and-shrink abstractions. We study the representations for these classes through the lens of compactness: one class is at least as compact as another if it can represent all abstractions the other can represent with a polynomially bounded increase in representation size. We complete the picture of compactness relationships among the four classes of abstractions, in particular resolving an open question from the literature on the relative compactness of Cartesian abstractions and merge-and-shrink.

Zitieren

APA

Helmert, M., & Röger, G. (2026). From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations. Proceedings of the International Symposium on Combinatorial Search, 19(1), 56-64. https://doi.org/10.1609/socs.v19i1.43073

Vancouver

Helmert M, Röger G. From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations. Proceedings of the International Symposium on Combinatorial Search. 2026;19(1):56-64. doi:10.1609/socs.v19i1.43073

BibTeX
@article{Helmert2026,
  author = {Helmert, Malte and Röger, Gabriele},
  title = {From Projections to Cartesian Abstractions and Merge-and-Shrink: Comparing the Compactness of Abstraction Representations},
  journal = {Proceedings of the International Symposium on Combinatorial Search},
  year = {2026},
  volume = {19},
  number = {1},
  pages = {56--64},
  doi = {10.1609/socs.v19i1.43073}
}
Kostenlos starten →