Speeding up planning through minimal generalizations of partially ordered plans

Authors:
Radomír Černoch;Filip Železný
Affiliations:
Czech Technical University in Prague;Czech Technical University in Prague
Venue:
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Year:
2010

Citing 8
Cited 0

Relational Reinforcement Learning

ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Learning Declarative Control Rules for Constraint-BAsed Planning

ICML '00 Proceedings of the Seventeenth International Conference on Machine Learning
Automated Planning: Theory & Practice

Automated Planning: Theory & Practice
Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)

Logical and Relational Learning: From ILP to MRDM (Cognitive Technologies)
The lattice structure and refinement operators for the hypothesis space bounded by a bottom clause

Machine Learning
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
On generalization and subsumption for ordered clauses

JSAI'05 Proceedings of the 2005 international conference on New Frontiers in Artificial Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.