Accession Number : ADA259671


Title :   Systematic Nonlinear Planning


Descriptive Note : Memorandum rept.


Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE ARTIFICIAL INTELLIGENCE LAB


Personal Author(s) : McAllester, David ; Rosenblitt, David


Full Text : https://apps.dtic.mil/dtic/tr/fulltext/u2/a259671.pdf


Report Date : Dec 1991


Pagination or Media Count : 14


Abstract : 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 guaranteed 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.


Descriptors :   *ALGORITHMS , *OPTIMIZATION , *NONLINEAR SYSTEMS , *PLANNING , *PROBLEM SOLVING , *SEARCHING , *ARTIFICIAL INTELLIGENCE , AUTOMATION , MODIFICATION , SIMPLIFICATION , THEOREMS , REASONING , LEARNING MACHINES


Subject Categories : Cybernetics


Distribution Statement : APPROVED FOR PUBLIC RELEASE