Learning Action Strategies for Planning Domains Learning Action Strategies for Planning Domains

This paper reports on experiments where techniques of supervised machine learning are applied to the problem of planning. The input to the learning algorithm is composed of a description of a planning domain, planning problems in this domain, and solutions for them. The output is an eecient algorithm | a strategy | for solving problems in that domain. We test the strategy on an independent set of planning problems from the same domain, so that success is measured by its ability to solve complete problems. A system, L2Act, has been developed in order to perform these experiments. We have experimented with the blocks world domain, and the logistics domain, using strategies in the form of a generalization of decision lists, where the rules on the list are existentially quantiied rst order expressions. The learning algorithm is a variant of Rivest`s 39] algorithm, improved with several techniques that reduce its time complexity. As the experiments demonstrate, generalization is achieved so that large unseen problems can be solved by the learned strategies. The learned strategies are eecient and are shown to nd solutions of high quality. We also discuss preliminary experiments with linear threshold algorithms for these problems.