EUVIMEDEUVIMED entdecken
Crossref

Two Constraint Compilation Methods for Lifted Planning

Periklis Mantenoglou, Luigi Bonassi, Enrico Scala, Pedro Zuidberg Dos Martires

Proceedings of the AAAI Conference on Artificial Intelligence · 14.03.2026 · 40 (43) · 36325-36333

DOI: 10.1609/aaai.v40i43.40952 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the AAAI Conference on Artificial Intelligence, online erschienen am 14.03.2026. Verfasst von Periklis Mantenoglou und 3 weiteren Autor:innen.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study planning in a fragment of PDDL with qualitative state-trajectory constraints, capturing safety requirements, task ordering conditions, and intermediate sub-goals commonly found in real-world problems. A prominent approach to tackle such problems is to compile their constraints away, leading to a problem that is supported by state-of-the-art planners. Unfortunately, existing compilers do not scale on problems with a large number of objects and high-arity actions, as they necessitate grounding the problem before compilation. To address this issue, we propose two methods for compiling away constraints without grounding, making them suitable for large-scale planning problems. We prove the correctness of our compilers and outline their worst-case time complexity. Moreover, we present a reproducible empirical evaluation on the domains used in the latest International Planning Competition. Our results demonstrate that our methods are efficient and produce planning specifications that are orders of magnitude more succinct than the ones produced by compilers that ground the domain, while remaining competitive when used for planning with a state-of-the-art planner.

Zitieren

APA

Mantenoglou, P., Bonassi, L., Scala, E., & Martires, P. Z. D. (2026). Two Constraint Compilation Methods for Lifted Planning. Proceedings of the AAAI Conference on Artificial Intelligence, 40(43), 36325-36333. https://doi.org/10.1609/aaai.v40i43.40952

Vancouver

Mantenoglou P, Bonassi L, Scala E, Martires PZD. Two Constraint Compilation Methods for Lifted Planning. Proceedings of the AAAI Conference on Artificial Intelligence. 2026;40(43):36325-36333. doi:10.1609/aaai.v40i43.40952

BibTeX
@article{Mantenoglou2026,
  author = {Mantenoglou, Periklis and Bonassi, Luigi and Scala, Enrico and Martires, Pedro Zuidberg Dos},
  title = {Two Constraint Compilation Methods for Lifted Planning},
  journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
  year = {2026},
  volume = {40},
  number = {43},
  pages = {36325--36333},
  doi = {10.1609/aaai.v40i43.40952}
}
Kostenlos starten →