Accession Number:

ADA278900

Title:

Prodigy Planning Algorithm

Descriptive Note:

Research rept.

Corporate Author:

CARNEGIE-MELLON UNIV PITTSBURGH PA DEPT OF COMPUTER SCIENCE

Personal Author(s):

• Fink, Eugene
• Veloso, Manuela

Report Date:

1994-03-01

Pagination or Media Count:

13.0

Abstract:

We present a formal description of the planning algorithm used in the Prodigy 4.0 system. The algorithm is based on an interesting combination of backward-chaining planning and simulation of plan execution. The backward-chainer selects goal-relevant operators, and then Prodigy simulates their application to the current state of the world. The system can use different backward-chaining procedures, some of which are presented in the paper.

Descriptors:

• *COMPUTER PROGRAMS
• *ALGORITHMS
• *PROBLEM SOLVING
• COMPUTER LOGIC
• PLANNING
• ARTIFICIAL INTELLIGENCE
• LEARNING
• COMPUTER OPERATORS

Subject Categories:

• Computer Programming and Software
• Cybernetics

Distribution Statement:

APPROVED FOR PUBLIC RELEASE