Planning with Complex Actions

From Tetherless World Wiki

Jump to: navigation, search

Citation: Ronald Fadel. (2002) Planning with Complex Actions. In KSL-02-03, 2002.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Ronald Fadel
title Planning with Complex Actions
number KSL-02-03
institution Knowledge Systems, AI Laboratory
year 2002
Bibtex more
Access Paper
abstract In this thesis we propose a framework to represent complex actions as primitive operators and plan with them. In particular, we provide semantically-justified definitions and characterizations of the preconditions and conditional effects of complex actions,and we prove the soundness and completeness of planning using complex actions with respect to planning in the initial primitive action domain. The representation of complex actions as primitive operators is relevant in the case of Web services,since the latter can often be represented as complex actions, but do not have a priori explicit preconditions or effects, which is needed in order to plan with them using operator-based techniques. Based on this representation, our framework of planning with complex actions is interesting in classical operator-based planning because it allows the use of relevant conditional subplans, potentially reducing the search space.Using the results of this thesis, we present an algorithm of a compiler that computes the preconditions and effects of a restricted class of complex actions, with the domain being represented in a PDDL-equivalent form. We present experimental results which show a dramatic improvement in automatic plan generation when using complex actions. We use the situation calculus and Golog to formalize the task and our solution.

KSL Technical Report ID: KSL-02-03
Facts about Planning with Complex ActionsRDF feed
Abstract In this thesis we propose a framework to r … In this thesis we propose a framework to represent complex actions as primitive operators and plan with them. In particular, we provide semantically-justified definitions and characterizations of the preconditions and conditional effects of complex actions,and we prove the soundness and completeness of planning using complex actions with respect to planning in the initial primitive action domain. The representation of complex actions as primitive operators is relevant in the case of Web services,since the latter can often be represented as complex actions, but do not have a priori explicit preconditions or effects, which is needed in order to plan with them using operator-based techniques. Based on this representation, our framework of planning with complex actions is interesting in classical operator-based planning because it allows the use of relevant conditional subplans, potentially reducing the search space.Using the results of this thesis, we present an algorithm of a compiler that computes the preconditions and effects of a restricted class of complex actions, with the domain being represented in a PDDL-equivalent form. We present experimental results which show a dramatic improvement in automatic plan generation when using complex actions. We use the situation calculus and Golog to formalize the task and our solution. og to formalize the task and our solution.
Author Ronald Fadel  +
Bibtype techreport  +
Has author Ronald Fadel  +
Has identifier KSL-02-03  +
Has publishing details 2002  +
Has title Planning with Complex Actions  +
Has where published KSL-02-03  +
Has year 2002  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-02-03  +
Number KSL-02-03  +
Process note YES  +
Title Planning with Complex Actions  +
Year 2002  +
Retrieved from "http://tw.rpi.edu/wiki/Planning_with_Complex_Actions"
Personal tools