By Topic

Massively parallel support for case-based planning

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
B. P. Kettler ; Dept. of Comput. Sci., Maryland Univ., College Park, MD, USA ; J. A. Hendler ; W. A. Andersen ; M. P. Evett

The Caper case-based planner 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 issued. The more specific the query, the closer the retrieved cases are to the current problem. Unlike serial planners, Caper can afford to retrieve several plans to achieve different parts of the target problem, and then merge them into a composite plan that solves most of the target goals with less adaptation. We are testing Caper's case-retrieval components in two domains: car assembly and transportation logistics.<>

Published in:

IEEE Expert  (Volume:9 ,  Issue: 1 )