Efficient planning through automatic configuration and machine learning

Authors:
Mauro Vallati
Affiliations:
Dipartimento d'Ingegneria dell'Informazione, Università degli Studi di Brescia, Via Branze 38, 25123 Brescia, Italy. E-mail: mauro.vallati@ing.unibs.it
Venue:
AI Communications
Year:
2013

Citing 4
Cited 0

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)

Data Mining: Practical Machine Learning Tools and Techniques, Second Edition (Morgan Kaufmann Series in Data Management Systems)
Planning through stochastic local search and temporal action graphs in LPG

Journal of Artificial Intelligence Research
Unifying SAT-based and graph-based planning

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
ParamILS: an automatic algorithm configuration framework

Journal of Artificial Intelligence Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

Although in the last decade the performance of domain-independent planners has significantly improved, there is no planner that outperforms all the others in every benchmark domains. In many domains, the planning performance can be improved by automatically deriving and exploiting knowledge about the domain and problem structure that is not explicitly given in the input formalization, and that can be used for optimizing the planner behavior.This thesis proposes three innovative techniques for deriving and using additional domain and problem knowledge through automatic algorithm configuration and machine learning techniques: a prediction model of the planning horizons, a method for synthesizing domain-optimized planners from a highly parameterized generic planner, and a system for the automatic configuration of a portfolio planner.