improving planning efficient by conceptual clustering  automated acquisition and organization of plan knowledge has been investigated by many researchers. vere's thoth (1980) induces a minimal set of relational operators that cover a training set of state to state transitions. for example, having observed the many individual transitions required to build a block tower, thoth might formulate abstract operator descriptions that correspond to the 'classic' operators of stack, pick-up, etc. however, thoth does not have a strong notion of 'good' operator organization, other than to discover a minimal set of abstractions that cover the training examples. nonetheless, thoth's ability to autonomously discover operator 'classes' makes it an early conceptual ancestor of the clustering approach that we propose.  unlike thoth, strips (fikes, hart & nilsson, 1972) begins with a set of abstract operator descriptions and conjoins them using means-ends analysis to form plans. moreover, strips generalizes the applicability of these plans (using analytic methods in contrast to thoth's empirical approach) and stores them for reuse. however, recent work in learning to plan indicates that a strips approach to saving plans in an unconstrained manner may actually have detrimental effects on planning time: the time to search for applicable past experience may eventually surpass the cost of planning from scratch (minton, 1988).  anderson and farley (1988) suggests a possible way to mitigate the cost of finding applicable past knowledge. their system, planerus, generates a hierarchy based on common add conditions of strips-like operators. add condition indices allow planerus to find operators that reduce differences in a means-ends planner. in principle a discrimination net over add conditions can be very efficient, but like thoth, planerus appears to lack a strong prescription of operator class quality: its indexing method appears to require an exponential number of indices in the worst case because it groups operators based on combinations of one or more shared conditions. in this regard minton (1988) points out that even with indexing schemes, systems must also be willing to dispose of past experiences (e.g., abstractions, add-condition combinations) that prove to be of low utility (e.g., infrequent).  thoth, strips, and planerus are important precursors to our work, but we hope to extend the ideas illustrated by these systems in several directions. first, a system like planerus is designed primarily to facilitate goal-driven behavior, as its exclusive reliance on add-condition indexing indicates. however, work in reactive or situated planning (schoppers, 1989) suggests that the current situation should also influence the selection of applicable operators: an ideal operator is one that achieves desirable goals and requires minimal alterations to the current situation to do so. thus, we propose that when using strips-like operators, pre conditions, as well as add conditions should be used to retrieve operators that make progress towards the goal and that best fit the current conditions of the environment. in addition, operator class discovery and indexing should be controlled by a strong heuristic prescription of high utility operator and plan classes. without these prescriptions, planning with or without the benefit of previous experience remains a search-intensive, often intractable enterprise (ginsberg, 1989).  hua yang douglas h. fisher hubertus franke