Real-Time Plan Adaptation for Case-Based Planning in Real-Time Strategy Games

  • Authors:

  • Neha Sugandh;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:
  • ECCBR '08 Proceedings of the 9th European conference on Advances in Case-Based Reasoning
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

Case-based planning (CBP) is based on reusing past successful plans for solving new problems. CBP is particularly useful in environments where the large amount of time required to traverse extensive search spaces makes traditional planning techniques unsuitable. In particular, in real-time domains, past plans need to be retrieved and adapted in real time and efficient plan adaptation techniques are required. We have developed real time adaptation techniques for case based planning and specifically applied them to the domain of real time strategy games. In our framework, when a plan is retrieved, a plan dependency graph is inferred to capture the relations between actions in the plan suggested by that case. The case is then adapted in real-time using its plan dependency graph. This allows the system to create and adapt plans in an efficient and effective manner while performing the task. Our techniques have been implemented in the Darmok system (see [8]), designed to play WARGUS, a well-known real-time strategy game. We analyze our approach and prove that the complexity of the plan adaptation stage is polynomial in the size of the plan. We also provide bounds on the final size of the adapted plan under certain assumptions.