SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning - Université Grenoble Alpes
Communication Dans Un Congrès Année : 2024

SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning

Résumé

This paper presents SibylSat, a novel SAT-based method designed to efficiently solve totally-ordered HTN problems (TOHTN). In contrast to prevailing SAT-based HTN planners that employ a breadth-first search strategy, SibylSat adopts a greedy search approach, enabling it to identify promising decompositions for expansion. The selection process is facilitated by a heuristic derived from solving a relaxed problem, which is also expressed as a SAT problem. Our experimental evaluations demonstrate that SibylSat outperforms existing SAT-based TOHTN approaches in terms of both runtime and plan quality on most of the IPC benchmarks, while also solving a larger number of problems.
Fichier principal
Vignette du fichier
m1160.pdf (972.62 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04764696 , version 1 (04-11-2024)

Identifiants

Citer

Gaspard Quenard, Damier Pellier, Humbert Fiorino. SibylSat: Using SAT as an Oracle to Perform a Greedy Search on TOHTN Planning. ECAI 2024, Oct 2024, Santiago de Compostela, Spain. pp.4157 - 4164, ⟨10.3233/FAIA240987⟩. ⟨hal-04764696⟩
21 Consultations
9 Téléchargements

Altmetric

Partager

More