This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Massively Parallel Support for Case-Based Planning
February 1994 (vol. 9 no. 1)
pp. 8-14

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.

Citation:
Brian P. Kettler, James A. Hendler, William A. Andersen, Matthew P. Evett, "Massively Parallel Support for Case-Based Planning," IEEE Intelligent Systems, vol. 9, no. 1, pp. 8-14, Feb. 1994, doi:10.1109/64.295138
Usage of this product signifies your acceptance of the Terms of Use.