Abstract
Case-based planning is based on the idea that a machine planner should make use of its own past experience in developing new plans, relying on its memories instead of a base of rules. Memories of past successes are accessed and modified to create new plans. Memories of past failures are used to warn the planner of impending problems and memories of past repairs are called upon to tell the planner how to deal with them. Successful plans are stored in memory, indexed by the goals they satisfy and the problems they avoid. Failures are also stored, indexed by the features in the world that predict them. By storing failures as well as successes, the planner is able to anticipate and avoid future plan failures. These ideas of memory, learning and planning are implemented in the case-based planner CHEF, which creates new plans in the domain of Szechwan cooking.
Original language | English (US) |
---|---|
Pages | 267-271 |
Number of pages | 5 |
State | Published - 1986 |
Event | 5th National Conference on Artificial Intelligence, AAAI 1986 - Philadelphia, United States Duration: Aug 11 1986 → Aug 15 1986 |
Conference
Conference | 5th National Conference on Artificial Intelligence, AAAI 1986 |
---|---|
Country/Territory | United States |
City | Philadelphia |
Period | 8/11/86 → 8/15/86 |
Funding
It was supported in part by ONR Grant This report describes work done in the Department of Computer Science Yale University. It was supported in part by ONR Grant #N00014-85-K-0108.
ASJC Scopus subject areas
- Software
- Artificial Intelligence