Planning for Conjunctive Goals

Please use this identifier to cite or link to this item: http://dspace.mediu.edu.my:8181/xmlui/handle/1721.1/6947

Full metadata record

DC Field	Value	Language
dc.creator	Chapman, David	-
dc.date	2004-10-20T20:10:06Z	-
dc.date	2004-10-20T20:10:06Z	-
dc.date	1985-11-01	-
dc.date.accessioned	2013-10-09T02:47:47Z	-
dc.date.available	2013-10-09T02:47:47Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AITR-802	-
dc.identifier	http://hdl.handle.net/1721.1/6947	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.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.	-
dc.format	4782630 bytes	-
dc.format	3760641 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AITR-802	-
dc.title	Planning for Conjunctive Goals	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI