Abstract
Previous approaches to case-based planning often finds a similar plan case to a new planning problem to adapt to solve the new problem. However, in the case base, there may be some other cases that provide helpful knowledge in building the new solution plan. Likewise, from each existing case there may be only certain parts that can be adapted for solving the new problem. In this paper, we propose a novel constraint-based case-based planning framework that can consider all similar plans in a case base to the current problem, and take only portions of their solutions in adaptation. Our solution is to convert all similar plan cases to constraints, and use them to solve the current problem by maximally exploiting the reusable knowledge from all the similar plan cases using a weighted MAX-SAT solver. We first encode a new planning problem as a satisfiability problem, and then extract constraints from plan cases. After that, we solve the SAT problem, including the extracted constraints, using a weighted MAX-SAT solver and convert the solution to a plan to solve the new planning problem. In our experiments, we test our algorithm in three different domains from International Planning Competition (IPC) to demonstrate the efficiency and effectiveness of our approach.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Kuchibatla, V., Muñoz-Ávila, H.: An Analysis of Transformational Analogy: General Framework and Complexity. In: Roth-Berghofer, T.R., Göker, M.H., Güvenir, H.A. (eds.) ECCBR 2006. LNCS, vol. 4106, pp. 458–473. Springer, Heidelberg (2006)
Kautz, H., Selman, B.: Planning as Satisfiability. In: ECAI (1992)
Borchers, B., Furman, J.: A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems. Journal of Combinatorial Optimization 2(4), 299–306 (1998)
McCarthy, J., Hayes, P.J.: Some Philosophical Problems from the Standpoint of Artificial Intelligence. Machine Intelligence, 463–502 (1969)
Munoz-Avila, H., Cox, M.T.: Case-Based Plan Adaptation: An Analysis and Review. IEEE Intelligent Systems (2007)
Blum, A.L., Furst, M.L.: Fast planning through planning graph analysis. Artificial Intelligence (90), 1636–1642 (1997)
Hammond, K.J.: Case-Based Planning: Viewing Planning as a Memory Task. Academic Press, San Diego (1989)
Sugandh, N., Ontanon, S., Ram, A.: On-Line Case-Based Plan Adaptation for Real-Time Strategy Games, pp. 702–707. AAAI, Menlo Park (2008)
Kuchibatla, V., Muñoz-Ávila, H.: An Analysis on Transformational Analogy: General Framework and Complexity. In: Roth-Berghofer, T.R., Göker, M.H., Güvenir, H.A. (eds.) ECCBR 2006. LNCS, vol. 4106, pp. 458–473. Springer, Heidelberg (2006)
Bajo, J., Corchado, J.M., Rodriguez, S.: Intelligent Guidance and Suggestions Using Case-Based Planning. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS, vol. 4626, pp. 389–403. Springer, Heidelberg (2007)
de la Rosa, T., García Olaya, A., Borrajo, D.: Using cases utility for heuristic planning improvement. In: Weber, R.O., Richter, M.M. (eds.) ICCBR 2007. LNCS, vol. 4626, pp. 137–148. Springer, Heidelberg (2007)
Petrik, M., Zilberstein, S.: Learning Heuristic Functions Through Approximate Linear Programming. In: ICAPS (2008)
de la Rosa, T., Jimenez, S., Borrajo, D.: Learning Relational Decision Trees for Guiding Heuristic Planning. In: ICAPS (2008)
Yoon, S., Fern, A., Givan, R.: Learning Control Knowledge For Forward Search Planning. JMLR 9(APR), 683–718 (2008)
Fikes, R., Nilsson, N.J.: Strips: A new approach to the application of theorem proving to problem solving. Artificial Intelligence, 189–208 (1971)
Yang, Q.: Intelligent Planning: A Decomposition and Abstraction Based Approach. Springer, Berlin (1997)
Chapman, D.: Planning for Conjunctive Goals. Artificial Intelligence 32, 333–377 (1987)
Wilkins, D.E.: Recovering from Execution Errors in SIPE. Computational Intelligence 1, 33–45 (1985)
Selman, B., Levesque, H., Mitchell, D.: Hard and Easy Distributions of SAT Problems. In: Proc. of the 10th National Conference on Artificial Intelligence, San Jose, CA, July 1992, pp. 440–446. AAAI Press/MIT Press (1992)
Carbonell, J.G.: Learning by analogy: formulating and generalizing plans from past experience. In: Michalski, R.S., Carbonell, J.G., Mitchell, T.M. (eds.) Machine Learning: An Artificial Intelligence Approach, Tioga, Palo Alto, California (1983)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Zhuo, H., Yang, Q., Li, L. (2009). Constraint-Based Case-Based Planning Using Weighted MAX-SAT. In: McGinty, L., Wilson, D.C. (eds) Case-Based Reasoning Research and Development. ICCBR 2009. Lecture Notes in Computer Science(), vol 5650. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02998-1_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-02998-1_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-02997-4
Online ISBN: 978-3-642-02998-1
eBook Packages: Computer ScienceComputer Science (R0)