Thumbnail
Access Restriction
Subscribed

Author Gabriel, G. ♦ Grandcolas, S.
Source IEEE Xplore Digital Library
Content type Text
Publisher Institute of Electrical and Electronics Engineers, Inc. (IEEE)
File Format PDF
Copyright Year ©2009
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Special computer methods
Subject Keyword Filtering ♦ Performance analysis ♦ Artificial intelligence ♦ Large scale integration ♦ Engines ♦ Bridges ♦ Strategic planning ♦ State-space methods ♦ Iterative algorithms ♦ search ♦ planning ♦ CSP
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.
ISBN 9781424456192
ISSN 10823409
Educational Role Student ♦ Teacher
Age Range above 22 year
Educational Use Research ♦ Reading
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2009-11-02
Publisher Place USA
Rights Holder Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Size (in Bytes) 225.77 kB
Page Count 5
Starting Page 576
Ending Page 580


Source: IEEE Xplore Digital Library