Skip to Main content Skip to Navigation
Conference papers

Searching Optimal Parallel Plans: A Filtering and Decomposition Approach

Abstract : In the domain of planning, searching for optimal plans gives rise to many works. Most of the existing planners search for optimal parallel plans, that is plans which are optimal in the number of steps. FDP is an exception: it searches for optimal sequential plans, that is plans which are optimal in the number of actions. FDP implements a depth-first iterative-deepening search, using a CSP-like structure, decomposition rules, and filtering techniques similar to consistency-enforcing techniques. We propose a new planner based on FDP, which generates optimal parallel plans. This planner has been compared on a set of selected problems with the well-known optimal parallel planner SATPLAN, and with the planner FDP, so as to analyse the effects of the optimization criteria in the performances.
Document type :
Conference papers
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal-amu.archives-ouvertes.fr/hal-02471093
Contributor : Stéphane Grandcolas <>
Submitted on : Friday, February 7, 2020 - 5:24:13 PM
Last modification on : Monday, March 30, 2020 - 8:41:31 AM
Long-term archiving on: : Friday, May 8, 2020 - 4:56:03 PM

File

ictai.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02471093, version 1

Citation

Guillaume Gabriel, Stéphane Grandcolas. Searching Optimal Parallel Plans: A Filtering and Decomposition Approach. ICTAI, Nov 2009, New York, United States. ⟨hal-02471093⟩

Share

Metrics

Record views

40

Files downloads

116