Offline and Online Plan Library Maintenance in Case-Based Planning

  • Alfonso E. Gerevini
  • Anna Roubíčková
  • Alessandro Saetti
  • Ivan Serina
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8249)


One of the ways to address the high computational complexity of planning is reusing previously found solutions whenever they are applicable to the new problem with limited adaptation. To do so, a reuse planning system needs to store found solutions in a library of plans, also called a case base. The quality of such a library critically influences the performance of the planner, and therefore it needs to be carefully designed and created. For this reason, it may be also important to update the library during the lifetime of the system, as the type of problems being addressed may evolve or differ from the ones the case base was originally designed for.

In our ongoing research, we address the problem of maintaining the library of plans in a recent case-based planner called OAKplan. After having developed offline techniques to reduce an oversized library, we introduce here a complementary online approach that attempts to limit the growth of the library, and we consider the combination of offline and online techniques to ensure the best performance of the case-based planner. The different investigated approaches and techniques are then experimentally evaluated and compared.


Case Base Solution Plan Retrieval Time Maintenance Policy Maintenance Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Ghallab, M., Nau, D.S., Traverso, P.: Automated planning - theory and practice. Elsevier (2004)Google Scholar
  2. 2.
    Muñoz-Avila, H.: Case-base maintenance by integrating case-index revision and case-retention policies in a derivational replay framework. Computational Intelligence 17(2), 280–294 (2001)CrossRefGoogle Scholar
  3. 3.
    Serina, I.: Kernel functions for case-based planning. Artificial Intelligence 174(16-17), 1369–1406 (2010)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Spalazzi, L.: A survey on case-based planning. AI Review 16(1), 3–36 (2001)MATHGoogle Scholar
  5. 5.
    Leake, D.B. (ed.): Case-Based Reasoning. The MIT Press, Cambridge (1996)Google Scholar
  6. 6.
    Leake, D.B., Wilson, D.C.: Categorizing case-base maintenance: Dimensions and directions. In: Smyth, B., Cunningham, P. (eds.) EWCBR 1998. LNCS (LNAI), vol. 1488, pp. 196–207. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  7. 7.
    Markovitch, S., Scott, P.D., Porter, B.: Information filtering: Selection mechanisms in learning systems. In: 10th Int. Conf. on Machine Learning, pp. 113–151 (1993)Google Scholar
  8. 8.
    Minton, S.: Quantitative results concerning the utility of explanation-based learning. Artificial Intelligence 42(2-3), 363–391 (1990)CrossRefGoogle Scholar
  9. 9.
    Smyth, B.: Case-base maintenance. In: Mira, J., Moonis, A., de Pobil, A.P. (eds.) IEA/AIE 1998. LNCS, vol. 1416, pp. 507–516. Springer, Heidelberg (1998)CrossRefGoogle Scholar
  10. 10.
    Smyth, B., Keane, M.T.: Adaptation-guided retrieval: Questioning the similarity assumption in reasoning. Artificial Intelligence 102(2), 249–293 (1998)CrossRefMATHGoogle Scholar
  11. 11.
    Smyth, B., McKenna, E.: Footprint-based retrieval. In: Althoff, K.-D., Bergmann, R., Branting, L.K. (eds.) ICCBR 1999. LNCS (LNAI), vol. 1650, pp. 343–357. Springer, Heidelberg (1999)CrossRefGoogle Scholar
  12. 12.
    Leake, D.B., Wilson, D.C.: Remembering why to remember: Performance-guided case-base maintenance. In: Blanzieri, E., Portinale, L. (eds.) EWCBR 2000. LNCS (LNAI), vol. 1898, pp. 161–172. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  13. 13.
    Zhu, J., Yang, Q.: Remembering to add: Competence-preserving case-addition policies for case-base maintenance. In: 16th Int. Joint Conf. on AI, pp. 234–241 (1998)Google Scholar
  14. 14.
    Reinartz, T., Iglezakis, I., Roth-Berghofer, T.: On quality measures for case base maintenance. In: Blanzieri, E., Portinale, L. (eds.) EWCBR 2000. LNCS (LNAI), vol. 1898, pp. 247–259. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  15. 15.
    Yang, Q., Wu, J.: Keep it simple: A case-base maintenance policy based on clustering and information theory. In: Hamilton, H.J. (ed.) Canadian AI 2000. LNCS (LNAI), vol. 1822, pp. 102–114. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  16. 16.
    Shiu, S.C.K., Yeung, D.S., Sun, C.H., Wang, X.: Transferring case knowledge to adaptation knowledge: An approach for case-base maintenance. Computational Intelligence 17, 295–314 (2001)CrossRefGoogle Scholar
  17. 17.
    Veloso, M.M., Carbonell, J.G.: Derivational analogy in prodigy: Automating case acquisition, storage, and utilization. Machine Learning 10, 249–278 (1993)CrossRefGoogle Scholar
  18. 18.
    Gerevini, A.E., Roubíčková, A., Saetti, A., Serina, I.: On the plan-library maintenance problem in a case-based planner. In: Delany, S.J., Ontañón, S. (eds.) ICCBR 2013. LNCS, vol. 7969, pp. 119–133. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  19. 19.
    Srivastava, B., Nguyen, T.A., Gerevini, A., Kambhampati, S., Do, M.B., Serina, I.: Domain independent approaches for finding diverse plans. In: 20th Int. Joint Conf. on Artificial Intelligence, pp. 2016–2022 (2007)Google Scholar
  20. 20.
    Fox, M., Gerevini, A., Long, D., Serina, I.: Plan stability: Replanning versus plan repair. In: 16th Int. Conf. on AI Planning and Scheduling, pp. 212–221 (2006)Google Scholar
  21. 21.
    Koenig, S.: Int. planning competition (2013),
  22. 22.
    Bacchus, F., Kabanza, F.: Using temporal logic to express search control knowledge for planning. Artificial Intelligence 116(1-2), 123–191 (2000)MathSciNetCrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Alfonso E. Gerevini
    • 1
  • Anna Roubíčková
    • 2
  • Alessandro Saetti
    • 1
  • Ivan Serina
    • 1
  1. 1.Dept. of Information EngineeringUniversity of BresciaBresciaItaly
  2. 2.Faculty of Computer ScienceFree University of Bozen-BolzanoBolzanoItaly

Personalised recommendations