Effective plan retrieval in case-based planning for metric-temporal problems

摘要

Case-based planning (CBP) is an approach to planning where previous planning experience stored in a case base provides guidance to solving new problems. Such a guidance can be extremely useful when the new problem is very hard to solve, or the stored previous experience is highly valuable (because, e.g. it was provided and/or validated by human experts) and the system should try to reuse it as much as possible. In this work, we address CBP in PDDL domains with real-valued fluents, action durations and timed-initial literals, which are essential to model real-world planning problems involving continuous resources and temporal constraints. We propose some new heuristic techniques for retrieving a plan from a library of existing plans that is promising for solving a new planning problem encountered by the CBP system, i.e. that can be efficiently adapted to solve the new problem. The effectiveness of these techniques, which derive much of their power from the proposed use of the numerical/temporal information in the planning problem specification and in the library plans, is evaluated through an experimental analysis.