Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning - Archive ouverte HAL Access content directly
Conference Papers Year :

Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning

(1) , (1)
1

Abstract

We present in this paper a hybrid planning system which combines constraint satisfaction techniques and planning heuris-tics to produce optimal sequential plans. It integrates its own consistency rules and filtering and decomposition mechanisms suitable for planning. Given a fixed bound on the plan length, our planner works directly on a structure related to Graphplan's planning graph. This structure is incrementally built: Each time it is extended, a sequential plan is searched. Different search strategies may be employed. Currently, it is a forward chaining search based on problem decomposition with action sets partitioning. Various techniques are used to reduce the search space, such as memorizing nogood states or estimating goals reachability. In addition, the planner implements two different techniques to avoid enumerating some equivalent action sequences. Empirical evaluation shows that our system is very competitive on many problems, especially compared to other optimal sequential planners.
Fichier principal
Vignette du fichier
article-aaai.pdf (80.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02471078 , version 1 (07-02-2020)

Identifiers

  • HAL Id : hal-02471078 , version 1

Cite

Stéphane Grandcolas, Cyril Pain-Barre. Filtering, Decomposition and Search Space Reduction for Optimal Sequential Planning. AAAI, Jul 2007, Vancouver, Canada. ⟨hal-02471078⟩
11 View
12 Download

Share

Gmail Facebook Twitter LinkedIn More