We consider temporal numeric planning problems Π expressed in PDDL 2.1 level 3, and show how to produce SMT formulas (i) whose models correspond to valid plans of Π, and (ii) that extend the recently proposed planning with patterns approach from the numeric to the temporal case. We prove the correctness and completeness of the approach and show that it performs very well on 10 domains with required concurrency.
Temporal Numeric Planning with Patterns
Cardellini, M.;Giunchiglia, E.
2025-01-01
Abstract
We consider temporal numeric planning problems Π expressed in PDDL 2.1 level 3, and show how to produce SMT formulas (i) whose models correspond to valid plans of Π, and (ii) that extend the recently proposed planning with patterns approach from the numeric to the temporal case. We prove the correctness and completeness of the approach and show that it performs very well on 10 domains with required concurrency.
File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
