Archivio Istituzionale della RicercaWe 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.
Temporal Numeric Planning with Patterns / Cardellini, Matteo; Giunchiglia, Enrico. - 39:(2025), pp. 26481-26489. (Intervento presentato al convegno AAAI Conference on Artificial Intelligence tenutosi a Philadelphia (USA) nel February 25–March 4, 2025) [10.1609/aaai.v39i25.34848].
Temporal Numeric Planning with Patterns
Cardellini, Matteo;
2025
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.
| File | Dimensione | Formato | |
|---|---|---|---|
|
34848-Article Text-38915-1-2-20250410.pdf
accesso aperto
Tipologia:
2a Post-print versione editoriale / Version of Record
Licenza:
Pubblico - Tutti i diritti riservati
Dimensione
173.49 kB
Formato
Adobe PDF
|
173.49 kB | Adobe PDF | Visualizza/Apri |
Pubblicazioni consigliate
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11583/3002389