Massively parallel support for case-based planning
暂无分享,去创建一个
In case-based planning (CBP), previously generated plans are stored in memory and can be reused to solve similar planning problems in the future. CaPER system is a case-based planner that is being developed to take advantage of the efficiencies of plan re-use while addressing some of the problems and limitations of case-based planners that use serial retrieval procedures on an indexed memory. CaPER uses a massively parallel frame-based AI language (PARKA) and can do extremely fast retrieval of complex cases from a large, unindexed memory. The ability to do fast, frequent retrievals has many advantages: indexing is unnecessary; very large casebases can be used; and memory can be probed in numerous alternate ways, allowing more specific retrieval of stored plans that better fit the target problem with less adaptation. Empirical results for case retrieval, and some other systems that make use of massive parallelism for memory retrieval are discussed.<<ETX>>
[1] David L. Waltz,et al. Toward memory-based reasoning , 1986, CACM.
[2] Dedre Gentner,et al. Mechanisms of Analogical Learning. , 1987 .
[3] James A. Hendler,et al. Parallel Knowledge Representation on the Connection Machine , 1994, J. Parallel Distributed Comput..
[4] Stella Vosniadou,et al. Similarity and analogical reasoning: a synthesis , 1989 .
[5] Kristian J. Hammond,et al. Case-based planning: A framework for planning from experience ☆ , 1990 .