Possible Worlds Planning

From Tetherless World Wiki

Jump to: navigation, search

Citation: Matthew L. Ginsberg. (1986) Possible Worlds Planning. In KSL-86-37, 1986.

Publication techreport ( Edit )
type Technical Report
bibtype techreport
Bibtex basics
author Matthew L. Ginsberg
title Possible Worlds Planning
number KSL-86-37
institution Knowledge Systems, AI Laboratory
year 1986
Bibtex more
note Working Paper.
Access Paper
abstract The size of the search space is perhaps the most intractable of all the problems facing a general-purpose planner. Some planning methods (means-ends analysis being typical) address this problem by encouraging the system designer to give the planner domain-specific information (perhaps in the form of a difference table) to help govern this search.This paper presents a domain-independent approach to this problem based on the examination of possible worlds in which the planning goal has been achieved. Although a weak method, the ideas presented lead to considerable savings in many examples; in addition, the natural implementation of this approach has the attractive property that incremental efforts in controlling the search provide incremental improvements in performance. This is in contrast to many other approaches to the control of search or inference, which may require large expenditures of effort before any benefits are realized.

KSL Technical Report ID: KSL-86-37
Facts about Possible Worlds PlanningRDF feed
Abstract The size of the search space is perhaps th The size of the search space is perhaps the most intractable of all the problems facing a general-purpose planner. Some planning methods (means-ends analysis being typical) address this problem by encouraging the system designer to give the planner domain-specific information (perhaps in the form of a difference table) to help govern this search.This paper presents a domain-independent approach to this problem based on the examination of possible worlds in which the planning goal has been achieved. Although a weak method, the ideas presented lead to considerable savings in many examples; in addition, the natural implementation of this approach has the attractive property that incremental efforts in controlling the search provide incremental improvements in performance. This is in contrast to many other approaches to the control of search or inference, which may require large expenditures of effort before any benefits are realized. f effort before any benefits are realized.
Author Matthew L. Ginsberg  +
Bibtype techreport  +
Has author Matthew L. Ginsberg  +
Has identifier KSL-86-37  +
Has publishing details 1986  +
Has title Possible Worlds Planning  +
Has where published KSL-86-37  +
Has year 1986  +
Institution Knowledge Systems, AI Laboratory  +
Ksl tr id KSL-86-37  +
Note Working Paper.
Number KSL-86-37  +
Process note YES  +
Title Possible Worlds Planning  +
Year 1986  +
Personal tools