Macro Learning in Planning as Parameter Configuration
In AI planning, macro learning is the task of finding sub-sequences of operators that can be added to the planning domain to improve planner performance. Typically, a single set is added to the domain for all problem instances. A number of techniques have been developed to generate such a macro set based on offline analysis of problem instances. We build on recent work on instance-specific and fixed-set macros, and recast the macro generation problem as parameter configuration: the macros in a domain are viewed as parameters of the planning problem. We then apply an existing parameter configuration system to reconfigure a domain either once or per problem instance. Our empirical results demonstrate that our approach outperforms existing macro acquisition and filtering tools. For instance-specific macros, our approach almost always achieves equal or better performance than a complete evaluation approach, while often being an order of magnitude faster offline.
KeywordsPlanning Macro Learning Parameter Configuration Machine Learning
Unable to display preview. Download preview PDF.
- 1.Alhossaini, M., Beck, J.C.: Learning Instance-Specific Macros. In: ICAPS 2009 Workshop on Planning and Learning (2009)Google Scholar
- 2.Balaprakash, P., Birattari, M., Stützle, T.: Improvement strategies for the f-race algorithm: Sampling design and iterative refinement. Hybrid Metaheuristics, 108–122 (2007)Google Scholar
- 6.Ghallab, M., Nau, D., Traverso, P.: Automated Planning: Theory & Practice. Morgan Kaufmann, Elsevier Science (2004)Google Scholar
- 10.Newton, M.: Wizard: Learning Macro-Actions Comprehensively for Planning. PhD thesis, Department of Computer and Information Science, University of Strathclyde, United Kingdom (November 2008)Google Scholar
- 11.Newton, M., Levine, J., Fox, M., Long, D.: Learning macro-actions for arbitrary planners and domains. In: Proceedings of the ICAPS (2007)Google Scholar
- 12.Platt, J.: Fast training of support vector machines using sequential minimal optimization. In: Advances in Kernel Methods, pp. 185–208. MIT Press (1999)Google Scholar