Abstract
We present a novel strategy enabling to exploit existing plans in solving new similar planning tasks by finding a common generalized core of the existing plans. For this purpose we develop an operator yielding a minimal joint generalization of two partially ordered plans. In three planning domains we show a substantial speed-up of planning achieved when the planner starts its search space exploration from the learned common generalized core, rather than from scratch.
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
Ghallab, M., Nau, D., Traverso, P.: Automated Planning: theory and practice. Morgan Kaufmann Publishers, San Francisco (2004)
Botea, A., Enzenberger, M., Mller, M., Schaeffer, J.: Macro-FF: improving AI planning with automatically learned macro-operators. Journal of Artificial Intelligence Research 24, 581–621 (2005)
Coles, A., Smith, A.: Marvin: a heuristic search planner with online macro-action learning. Journal of Artificial Intelligence Research 28, 119–156 (2007)
Chrpa, L., Bartak, R.: Towards getting domain knowledge: Plans analysis through investigation of actions dependencies. In: Florida Artificial Intelligence Conference (2008)
Fernandez, S., Aler, R., Borrajo, D.: Using previous experience for learning planning control knowledge. In: Florida Artificial Intelligence Conference (2004)
Yoon, S.: Learning heuristic functions from relaxed plans. In: International Conference on Automated Planning and Scheduling. AAAI Press, Menlo Park (2006)
Kambhampati, S., Yoon, S.: Explanation based learning for planning. In: Encyclopedia of Machine Learning. Springer, Heidelberg (2010)
Dzeroski, S., Raedt, L.D., Blockeel, H.: Relational reinforcement learning. Machine Learning, 7–52 (1998)
Huang, Y., Selman, B., Kautz, H.: Learning declarative control rules for constraint-based planning. In: International Conference on Machine Learning (2000)
Lorenzo, D., Otero, R.P.: Learning logic programs for action-selection in planning. In: Third International Workshop on Extraction of Knowledge from Databases at the 10th Portuguese Conference on Artificial Intelligence (2001)
Plotkin, G., Meltzer, B., Michie, D.: A note on inductive generalization. Machine Intelligence 5, 153–163 (1970)
Kuwabara, M., Ogawa, T., Hirata, K., Harao, M.: On generalization and subsumption for ordered clauses. In: New Frontiers in Artificial Intelligence (2006)
Tamaddoni-Nezhad, A., Muggleton, S.: The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause. Machine Learning 76, 37–72 (2009)
de Raedt, L.: Logical and relational learning. Springer, Heidelberg (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Černoch, R., Železný, F. (2011). Speeding Up Planning through Minimal Generalizations of Partially Ordered Plans. In: Frasconi, P., Lisi, F.A. (eds) Inductive Logic Programming. ILP 2010. Lecture Notes in Computer Science(), vol 6489. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21295-6_29
Download citation
DOI: https://doi.org/10.1007/978-3-642-21295-6_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21294-9
Online ISBN: 978-3-642-21295-6
eBook Packages: Computer ScienceComputer Science (R0)