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

  • Neha Sugandh
  • Santiago Ontañón
  • Ashwin Ram
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5239)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Aha, D., Molineaux, M., Ponsen, M.: Learning to win: Case-based plan selection in a real-time strategy game. In: Muñoz-Ávila, H., Ricci, F. (eds.) ICCBR 2005. LNCS (LNAI), vol. 3620, pp. 5–20. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  2. 2.
    Hammond, K.F.: Case based planning: A framework for planning from experience. Cognitive Science 14(3), 385–443 (1990)CrossRefGoogle Scholar
  3. 3.
    Hanks, S., Weld, D.S.: A domain-independednt algorithm for plan adaptation. Journal of Artificial Intelligence Research 2, 319–360 (1995)Google Scholar
  4. 4.
    Kambhampati, S., Hendler, J.A.: A validation-structure-based theory of plan modification and reuse. Artificial Intelligence 55(2), 193–258 (1992)CrossRefGoogle Scholar
  5. 5.
    Muñoz-Avila, H., Cox, M.: Case-based plan adaptation: An analysis and review. IEEE Intelligent Systems (2007)Google Scholar
  6. 6.
    Nau, D., Au, T.C., Ilghami, O., Kuter, U., Wu, D., Yaman, F., Muñoz-Avila, H., Murdock, J.W.: Applications of shop and shop2. Intelligent Systems 20(2), 34–41 (2005)CrossRefGoogle Scholar
  7. 7.
    Nebel, B., Koehler, J.: Plan modifications versus plan generation: A complexity-theoretic perspective. Technical Report RR-92-48 (1992)Google Scholar
  8. 8.
    Ontañón, S., Mishra, K., Sugandh, N., Ram, A.: Case-based planning and execution for real-time strategy games. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS (LNAI), vol. 4626, pp. 164–178. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  9. 9.
    Ram, A., Francis, A.: Multi-plan retrieval and adaptation in an experience-based agent. In: Leake, D.B. (ed.) Case-Based Reasoning: Experiences, Lessons, and Future Directions. AAAI Press, Menlo Park (1996)Google Scholar
  10. 10.
    Spalazzi, L.: A survey on case-based planning. Artificial Intelligence Review 16(1), 3–36 (2001)MATHCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Neha Sugandh
    • 1
  • Santiago Ontañón
    • 1
  • Ashwin Ram
    • 1
  1. 1.CCL, Cognitive Computing LabGeorgia Institute of TechnologyAtlanta 

Personalised recommendations