Planning for Conjunctive Goals

Chapman, David

Planning for Conjunctive Goals

Name

AITR-802.pdf

Size

3.59 MB

Format

Adobe PDF

Checksum (MD5)

589d3f6af3d51260c02c5930584dc30e

Name

AITR-802.ps

Size

4.56 MB

Format

PostScript

Checksum (MD5)

0bb4e67464a3a5688c2137c696eb577d

Author(s)

Chapman, David

Date Issued

November 1, 1985

Series/Report no.

AITR-802

Abstract

The problem of achieving conjunctive goals has been central to domain independent planning research; the nonlinear constraint-posting approach has been most successful. Previous planners of this type have been comlicated, heuristic, and ill-defined. I have combined and distilled the state of the art into a simple, precise, implemented algorithm (TWEAK) which I have proved correct and complete. I analyze previous work on domain-independent conjunctive planning; in retrospect it becomes clear that all conjunctive planners, linear and nonlinear, work the same way. The efficiency of these planners depends on the traditional add/delete-list representation for actions, which drastically limits their usefulness. I present theorems that suggest that efficient general purpose planning with more expressive action representations is impossible, and suggest ways to avoid this problem.

Persistent DSpace Link

http://hdl.handle.net/1721.1/6947