Abstract
Current efficient planners employ an informed search guided by a heuristic function that is quite expensive to compute. Thus, ordering nodes in the search tree becomes a key issue, in order to select efficiently nodes to evaluate from the successors of the current search node. In a previous work, we successfully applied a CBR approach to order nodes for evaluation, thus reducing the number of calls to the heuristic function. However, once cases were learned, they were not modified according to their utility on solving planning problems. We present in this work a scheme for learning case quality based on its utility during a validation phase. The qualities obtained determine the way in which these cases are preferred in the retrieval and replay processes. Then, the paper shows some experimental results for several benchmarks taken from the International Planning Competition (IPC). These results show the planning performance improvement when case utilities are used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Hoffmann, J., Nebel, B.: The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research 14, 253–302 (2001)
Vidal, V.: A lookahead strategy for heuristic search planning. In: Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling, pp. 150–160 (2004)
Chen, Y., Hsu, C.W., Wah, B.: SGPlan: Subgoal partitioning and resolution in planning. In: ICAPS’04. Proceedings of the 4th International Planning Competition (IPC4) in Conference, pp. 30–33 (2004)
DelaRosa, T., Borrajo, D., Garcfa-Olaya, A.: Replaying type sequences in forward heuristic planning. In: Ruml, W., Hutter, F. (eds.) Technical Report of the AAAI 2006 Workshop on Learning for Search, Boston, MA, AAAI Press, Stanford (2006)
De la Rosa, T., Garcfa Olaya, A., Borrajo, D.: Case-based recommendation for node ordering in planning. In: Dankel II, D. (ed.) Proceedings of the 20th International FLAIRS Conference, Key West, FL, AAAI Press, Stanford (2007)
Fox, M., Long, D.: The automatic inference of state invariants in TIM. Journal of Artificial Intelligence Research 9, 317–371 (1998)
Bergmann, R., Wilke, W.: Paris: Flexible plan adaptation by abstraction and refinement. In: Voss, A. (ed.) ECAI (1996). Workshop on Adaptation in Case-Based Reasoning, John Wiley & Sons, Chichester (1996)
Muñoz-Avila, H., Paulokat, J., Wess, S.: Controlling nonlinear hierarchical planning by case replay. In: in working papers of the Second European Workshop on Case-based Reasoning, Chantilly, France, pp. 195–203 (1994)
Veloso, M.M., Carbonell, J.G.: Derivational analogy in PRODIGY: Automating case acquisition, storage, and utilization. Machine Learning 10(3), 249–278 (1993)
Macedo, L., Cardoso, A.: Cased-based, decision-theoretic, HTN-Planning. In: Funk, P., González Calero, P.A. (eds.) ECCBR 2004. LNCS (LNAI), vol. 3155, Springer, Heidelberg (2004)
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)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de la Rosa, T., García Olaya, A., Borrajo, D. (2007). Using Cases Utility for Heuristic Planning Improvement. In: Weber, R.O., Richter, M.M. (eds) Case-Based Reasoning Research and Development. ICCBR 2007. Lecture Notes in Computer Science(), vol 4626. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74141-1_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-74141-1_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74138-1
Online ISBN: 978-3-540-74141-1
eBook Packages: Computer ScienceComputer Science (R0)