Massively parallel support for case-based planning

Abstract

goals of the target problem. (Some systems can retrieve pieces of cases.2) Such systems can retrieve cases more efficiently by using indexing to restrict the kinds of features in a retrieval probe (thereby restricting the search to a subset of the case base), but this approach also raises several problems (see the first sidebar).We are developing the Caper case-based planner to address some of the problems of serial retrieval on an indexed case base. Caper uses the massive parallelism of the Connection Machine to quickly retrieve cases and plans from a large, unindexed memory. The system can retrieve cases and plans based on any feature of the target problem, including abstractions of target features. By controlling which features are part of the retrieval probe and their level of abstraction, a wide range of queries can be

MAC/FAC: A model of similarity-based retrieval

“…Although MAC/FAC's two-stage operation is not generally shared by case-based models, it is shared by one case-based reasoning system that uses a two-stage model, the CaPER system (Kettler, Hendler, & Anderson, 1992). CaPER is designed to retrieve all sufficiently similar plans from an unindexed case base, beginning with a massively parallel stage which does a simple, nonstructural match between a query and the contents of memory.…”

MAC/FAC: A Model of Similarity-Based Retrieval

“…Of recent cognitive simulations, the closest is the REMIND model of Wharton (1992, 1993), discussed in Section 7.1.6. Of the case-based reasoning systems, one of closest to our approach seems to be the CaPER system (Kettler, Hendler, and Anderson, 1992). CaPER is designed to retrieve all sufficiently similar plans from an unindexed case-base, using massive parallelism to do a simple, non-structural match between a query and the contents of memory.…”

Preference-Based Web Service Composition: Case-Based Planning Approach

“…A case-based planning system [16] solves planning problems by making use of stored plans that were used to solve analogous problems. CBP is a type of case-based reasoning, which involves the use of stored experiences (cases).…”