Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning - Archive ouverte HAL Access content directly
Conference Papers Year : 2019

Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning

Abstract

In this paper, we propose a novel SAT-based planning approach to solve totally ordered hierarchical planning problems. Our approach called "Tree-like Reduction Exploration" (Tree-REX) makes two contributions: (1) it allows to rapidly solve hierarchical planning problems by making effective use of incremental SAT solving, and (2) it implements an anytime approach that gradually improves plan quality (makespan) as time resources are allotted. Incremental SAT solving is important as it reduces the encoding volume of planning problems , it builds on information obtained from previous search iterations and speeds up the search for plans. We show that Tree-REX outperforms state-of-the-art SAT-based HTN planning with respect to run times and plan quality on most of the considered IPC domains.
Fichier principal
Vignette du fichier
pellier19c.pdf (704.17 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-02183036 , version 1 (14-07-2019)

Identifiers

  • HAL Id : hal-02183036 , version 1

Cite

Dominik Schreiber, Damien Pellier, Humbert Fiorino, Tomáš Balyo. Tree-REX: SAT-Based Tree Exploration for Efficient and High-Quality HTN Planning. International Conference on Automated Planning and Scheduling, Jul 2019, Berkeley, United States. pp.382-390. ⟨hal-02183036⟩
212 View
98 Download

Share

Gmail Mastodon Facebook X LinkedIn More