Systematic Nonlinear Planning

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

Full metadata record

DC Field	Value	Language
dc.creator	McAllester, David	-
dc.creator	Rosenblatt, David	-
dc.date	2004-10-08T20:29:06Z	-
dc.date	2004-10-08T20:29:06Z	-
dc.date	1991-12-01	-
dc.date.accessioned	2013-10-09T02:46:07Z	-
dc.date.available	2013-10-09T02:46:07Z	-
dc.date.issued	2013-10-09	-
dc.identifier	AIM-1339	-
dc.identifier	http://hdl.handle.net/1721.1/6588	-
dc.identifier.uri	http://koha.mediu.edu.my:8181/xmlui/handle/1721	-
dc.description	This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is achieved by starting with a ground procedure and then applying a general and independently verifiable, lifting transformation. Previous planners have been designed directly as lifted procedures. Our ground procedure is a ground version of Tate's NONLIN procedure. In Tate's procedure one is not required to determine whether a prerequisite of a step in an unfinished plan is guarnateed to hold in all linearizations. This allows Tate"s procedure to avoid the use of Chapman"s modal truth criterion. Systematicity is the property that the same plan, or partial plan, is never examined more than once. Systematicity is achieved through a simple modification of Tate's procedure.	-
dc.format	1183592 bytes	-
dc.format	738904 bytes	-
dc.format	application/postscript	-
dc.format	application/pdf	-
dc.language	en_US	-
dc.relation	AIM-1339	-
dc.title	Systematic Nonlinear Planning	-
Appears in Collections:	MIT Items

Files in This Item:

There are no files associated with this item.

DSpace JSPUI