Skip to main content

Case Adaptation by Segment Replanning for Case-Based Planning Systems

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 3620))

Abstract

An adaptation phase is crucial for a good and reasonable Case-Based Planning (CBP) system. The adaptation phase is responsible for finding a solution in order to solve a new problem. If the phase is not well designed, the CBP system may not solve the desirable range of problems or the solutions will not have appropriate quality. In this paper, a method called CASER – Case Adaptation by Segment Replanning – is presented as an adaptation rule for case-based planning system. The method has two phases: the first one completes a retrieved case as an easy-to-generate solution method. The second phase improves the quality of the solution by using a generic heuristic in a recursive algorithm to determine segments of the plan to be replanned. The CASER method does not use any additional knowledge, and it can find as good solutions as those found by the best generative planners.

This work was partially supported by FAPESP under contract number 98/15835-9.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ambite, J.L., Knoblock, C.A.: Planning by Rewriting. Journal of Artificial Intelligence Research 15, 207–261 (2001)

    Article  MATH  Google Scholar 

  2. Au, T.-C., Muñoz-Ávila, H., Nau, D.S.: On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework. In: Craw, S., Preece, A.D. (eds.) ECCBR 2002. LNCS (LNAI), vol. 2416, pp. 13–27. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Bacchus, F.: AIPS-2000 Planning Competition Results (2000), Available in http://www.cs.toronto.edu/aips2000/

  4. Blum, A., Furst, M.: Fast Planning through Planning Graphs Analysis. Artificial Intelligence 90, 281–300 (1997)

    Article  MATH  Google Scholar 

  5. Bonet, B., Geffner, H.: Planning as Heuristic Search. Artificial Intelligence 129, 5–33 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  6. Gerevini, A., Serina, I.: Fast Adaptation through Planning Graphs: Local and Systematic Search Techniques. In: Proceedings of the 5th International Conference on Artificial Intelligence Planning and Scheduling AIPS 2000, pp. 112–121. AAAI Press, Menlo Park (2000)

    Google Scholar 

  7. Gerevini, A., Serina, I.: LPG: A Planner Based on Local Search for Planning Graphs with Actions Costs. In: Preprints of the 6th International Conference on Artificial Intelligence Planning and Scheduling AIPS 2002, pp. 281–290. AAAI Press, Menlo Park (2002)

    Google Scholar 

  8. Hoffmann, J.: Extending FF to Numerical State Variables. In: Proceedings of the 15th European Conference on Artificial Intelligence, Lyon, France (2002)

    Google Scholar 

  9. Hoffmann, J., Nebel, B.: The FF Planning System: Fast Plan Generation Through Heuristic Search. Journal of Artificial Intelligence Research 14, 253–302 (2001)

    MATH  Google Scholar 

  10. Koenig, S., Furcy, D., Bauer, C.: Heuristic Search-Based Replanning. In: 6th Proceedings of the International Conference on Artificial Intelligence on Planning and Scheduling (AIPS 2002), Toulouse (2002)

    Google Scholar 

  11. Long, D., Fox, M.: The 3rd International Planning Competition - IPC 2002 (2002), Available in http://www.dur.ac.uk/d.p.long/competition.html

  12. Nebel, B., Koehler, J.: Plan reuse versus plan generation: A theoretical and empirical analysis. Artificial Intelligence 76, 427–454 (1995); Special Issue on Planning and Scheduling

    Article  Google Scholar 

  13. Tonidandel, F., Rillo, M.: An Accurate Adaptation-Guided Similarity Metric for Case-Based Planning. In: Aha, D.W., Watson, I. (eds.) ICCBR 2001. LNCS (LNAI), vol. 2080, pp. 531–545. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  14. Tonidandel, F., Rillo, M.: The FAR-OFF system: A Heuristic Search Case-Based Planning. In: Proceedings of 6th International Conference on Artificial Intelligence on Planning and Scheduling (AIPS 2002), Toulouse (2002)

    Google Scholar 

  15. Tonidandel, F., Rillo, M.: Improving the Planning Solution Quality by Replanning. In: Anais do VI Simpósio Brasileiro de Automação Inteligente, Bauru São Paulo (2003)

    Google Scholar 

  16. Tonidandel, F., Rillo, M.: A Case base Seeding for Case-Based Planning Systems. In: Lemaître, C., Reyes, C.A., González, J.A. (eds.) IBERAMIA 2004. LNCS (LNAI), vol. 3315, pp. 104–113. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  17. Veloso, M.: Planning and Learning by Analogical Reasoning. LNCS (LNAI), vol. 886. Springer, Heidelberg (1994)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Tonidandel, F., Rillo, M. (2005). Case Adaptation by Segment Replanning for Case-Based Planning Systems. In: Muñoz-Ávila, H., Ricci, F. (eds) Case-Based Reasoning Research and Development. ICCBR 2005. Lecture Notes in Computer Science(), vol 3620. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11536406_44

Download citation

  • DOI: https://doi.org/10.1007/11536406_44

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28174-0

  • Online ISBN: 978-3-540-31855-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics