Complete Eager Replay
Héctor Muñoz‐Avila, Frank Weberskirch · 1996
We present an algorithm for completely replaying previous problem solving experiences for plan-space planners. In our approach not only the solution trace is replayed, but also the explanations of failed attempts made by the first-principle planner. In this way, the capability of refitting previous solutions into new problems is improved. 1 Introduction Case-based planning has shown to speedup the general problem solving process [16, 7, 8, 2, 6, 4]. For solving a new problem selected cases are reused in order to minimize the search effort of the first-principle problem solver. Different approaches have been developed for reusing previous problem-solving experiences. These approaches are motivated by different factors, which can be schematized as follows: Base level planner: Classical planners have been divided into plan-space and statespace planners based on the space where search is performed. The former show a better performance in domains for which the plans are nonserializable [1...