论文信息 - Conceptual Clustering of Mean-Ends Plans

Conceptual Clustering of Mean-Ends Plans

ABSTRACT Planning benefits from efficient and accurate recall of relevant past experience. We describe the application of conceptual clustering to the task of organizing operators and plans for efficient reuse. In particular, STRIPS-style operators and plans may be grouped, characterized and reused based on similar applicability (ADD, DELETE, and PRE) conditions.

Hua Yang | Douglas H. Fisher | D. Fisher | Hua Yang

[1] Arthur M. Farley,et al. Plan Abstraction Based on Operator Generalization , 1988, AAAI.

[2] R. Michalski,et al. Learning from Observation: Conceptual Clustering , 1983 .

[3] Steven A. Vere,et al. Multilevel Counterfactuals for Generalizations of Relational Concepts and Productions , 1980, Artif. Intell..

[4] Douglas H. Fisher,et al. Noise-Tolerant Conceptual Clustering , 1989, IJCAI.

[5] Stephen F. Smith,et al. Reactive Plan Revision , 1988, AAAI.

[6] Richard Fikes,et al. Learning and Executing Generalized Robot Plans , 1993, Artif. Intell..

[7] Mark A. Gluck,et al. Information, Uncertainty and the Utility of Categories , 1985 .