Using Meta-reasoning to Improve the Performance of Case-Based Planning

  • Authors:

  • Manish Mehta;Santiago Ontañón;Ashwin Ram

  • Affiliations:

  • CCL, Cognitive Computing Lab, Georgia Institute of Technology, Atlanta GA 30332/0280;CCL, Cognitive Computing Lab, Georgia Institute of Technology, Atlanta GA 30332/0280;CCL, Cognitive Computing Lab, Georgia Institute of Technology, Atlanta GA 30332/0280

  • Venue:
  • ICCBR '09 Proceedings of the 8th International Conference on Case-Based Reasoning: Case-Based Reasoning Research and Development
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Case-based planning (CBP) systems are based on the idea of reusing past successful plans for solving new problems. Previous research has shown the ability of meta-reasoning approaches to improve the performance of CBP systems. In this paper we present a new meta-reasoning approach for autonomously improving the performance of CBP systems that operate in real-time domains. Our approach uses failure patterns to detect anomalous behaviors, and it can learn from experience which of the failures detected are important enough to be fixed. Finally, our meta-reasoning approach can exploit both successful and failed executions for meta-reasoning. We illustrate its benefits with experimental results from a system implementing our approach called Meta-Darmok in a real-time strategy game. The evaluation of Meta-Darmok shows that the system successfully adapts itself and its performance improves through appropriate revision of the case base.