Temporal Numeric Planning with Patterns

Abstract

We consider temporal numeric planning problems Π expressed in PDDL2.1, and show how it is possible to produce SMT formulas (i) whose models correspond to valid plans of Π, and (ii) which extends the recently proposed planning with patterns approach from the numeric to the temporal case. We prove the correctness and completeness of the approach and that it outperforms all the publicly available temporal planners on 10 domains with required concurrency.

Cite

Text

Cardellini and Giunchiglia. "Temporal Numeric Planning with Patterns." AAAI Conference on Artificial Intelligence, 2025. doi:10.1609/AAAI.V39I25.34848

Markdown

[Cardellini and Giunchiglia. "Temporal Numeric Planning with Patterns." AAAI Conference on Artificial Intelligence, 2025.](https://mlanthology.org/aaai/2025/cardellini2025aaai-temporal/) doi:10.1609/AAAI.V39I25.34848

BibTeX

@inproceedings{cardellini2025aaai-temporal,
  title     = {{Temporal Numeric Planning with Patterns}},
  author    = {Cardellini, Matteo and Giunchiglia, Enrico},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2025},
  pages     = {26481-26489},
  doi       = {10.1609/AAAI.V39I25.34848},
  url       = {https://mlanthology.org/aaai/2025/cardellini2025aaai-temporal/}
}