Sciweavers

Share
JAIR
2011

Scaling up Heuristic Planning with Relational Decision Trees

8 years 5 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are worth the expense. However, when evaluation functions are misguiding or when planning problems are large enough, lots of node evaluations must be computed, which severely limits the scalability of heuristic planners. In this paper, we present a novel solution for reducing node evaluations in heuristic planning based on machine learning. Particularly, we define the task of learning search control for heuristic planning as a relational classification task, and we use an off-the-shelf relational classification tool to address this learning task. Our relational classification task captures the preferred action to select in the different planning contexts of a specific planning domain. These planning contexts are defined by the set of helpful actions of the current state, the goals remaining to be achieved, and ...
Tomás de la Rosa, Sergio Jiménez, Ra
Added 14 May 2011
Updated 14 May 2011
Type Journal
Year 2011
Where JAIR
Authors Tomás de la Rosa, Sergio Jiménez, Raquel Fuentetaja, Daniel Borrajo
Comments (0)
books