On the plan-library maintenance problem in a case-based planner

7Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Case-based planning 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. However, as known in general case-based reasoning, the case base needs to be maintained at a manageable size, in order to avoid that the computational cost of querying it excessively grows, making the entire approach ineffective. We formally define the problem of case base maintenance for planning, discuss which criteria should drive a successful policy to maintain the case base, introduce some policies optimizing different criteria, and experimentally analyze their behavior by evaluating their effectiveness and performance. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Gerevini, A. E., Roubíčková, A., Saetti, A., & Serina, I. (2013). On the plan-library maintenance problem in a case-based planner. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7969 LNAI, pp. 119–133). https://doi.org/10.1007/978-3-642-39056-2_9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free