In this paper, we present a symbolic search-based procedure for numeric planning based on Symbolic Pattern Planning (SPP). In SPP, a pattern is a sequence of actions used to define a logic formula whose models correspond to sequences of applicable actions and reachable states. Here, starting from the empty pattern, we iteratively extend and compress it using search techniques until a goal state is reached. We prove the correctness and completeness of the procedure and demonstrate its good performance compared to both the original SPP approach and other publicly available numeric planners on the 2023 International Planning Competition Agile track.

Pushing the Envelope in Numeric Pattern Planning / Cardellini, Matteo; Giunchiglia, Enrico. - (2025), pp. 762-772. ( International Conference on Principles of Knowledge Representation and Reasoning Melbourne, Australia November 11-17, 2025) [10.24963/kr.2025/73].

Pushing the Envelope in Numeric Pattern Planning

Matteo Cardellini;
2025

Abstract

In this paper, we present a symbolic search-based procedure for numeric planning based on Symbolic Pattern Planning (SPP). In SPP, a pattern is a sequence of actions used to define a logic formula whose models correspond to sequences of applicable actions and reachable states. Here, starting from the empty pattern, we iteratively extend and compress it using search techniques until a goal state is reached. We prove the correctness and completeness of the procedure and demonstrate its good performance compared to both the original SPP approach and other publicly available numeric planners on the 2023 International Planning Competition Agile track.
2025
978-1-956792-08-9
File in questo prodotto:
File Dimensione Formato  
kr2025-0073-cardellini-et-al.pdf

accesso aperto

Tipologia: 2a Post-print versione editoriale / Version of Record
Licenza: Pubblico - Tutti i diritti riservati
Dimensione 244.99 kB
Formato Adobe PDF
244.99 kB Adobe PDF Visualizza/Apri
Pubblicazioni consigliate

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11583/3002393