Empirical methods for artificial intelligence
Empirical methods for artificial intelligence
Fast training of support vector machines using sequential minimal optimization
Advances in kernel methods
Automated Planning: Theory & Practice
Automated Planning: Theory & Practice
Learning Control Knowledge for Forward Search Planning
The Journal of Machine Learning Research
The FF planning system: fast plan generation through heuristic search
Journal of Artificial Intelligence Research
VHPOP: versatile heuristic partial order planner
Journal of Artificial Intelligence Research
Macro-FF: improving AI planning with automatically learned macro-operators
Journal of Artificial Intelligence Research
Marvin: a heuristic search planner with online macro-action learning
Journal of Artificial Intelligence Research
ParamILS: an automatic algorithm configuration framework
Journal of Artificial Intelligence Research
Improvement strategies for the F-Race algorithm: sampling design and iterative refinement
HM'07 Proceedings of the 4th international conference on Hybrid metaheuristics
Analyzing search topology without running any search: on the connection between causal graphs and h+
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
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.