Planning for Conjunctive Goals
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 th...
| Main Author: | |
|---|---|
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://hdl.handle.net/1721.1/6947 |
| _version_ | 1811071915620564992 |
|---|---|
| author | Chapman, David |
| author_facet | Chapman, David |
| author_sort | Chapman, David |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T08:58:03Z |
| id | mit-1721.1/6947 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:58:03Z |
| publishDate | 2004 |
| record_format | dspace |
| spelling | mit-1721.1/69472019-04-10T19:58:46Z Planning for Conjunctive Goals Chapman, David 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. 2004-10-20T20:10:06Z 2004-10-20T20:10:06Z 1985-11-01 AITR-802 http://hdl.handle.net/1721.1/6947 en_US AITR-802 4782630 bytes 3760641 bytes application/postscript application/pdf application/postscript application/pdf |
| spellingShingle | Chapman, David Planning for Conjunctive Goals |
| title | Planning for Conjunctive Goals |
| title_full | Planning for Conjunctive Goals |
| title_fullStr | Planning for Conjunctive Goals |
| title_full_unstemmed | Planning for Conjunctive Goals |
| title_short | Planning for Conjunctive Goals |
| title_sort | planning for conjunctive goals |
| url | http://hdl.handle.net/1721.1/6947 |
| work_keys_str_mv | AT chapmandavid planningforconjunctivegoals |