Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Other
Authors: Vallati, Mauro
Affiliations: Dipartimento d'Ingegneria dell'Informazione, Università degli Studi di Brescia, Via Branze 38, 25123 Brescia, Italy. E-mail: [email protected]
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.
Keywords: Automated planning, learning for planning
DOI: 10.3233/AIC-130561
Journal: AI Communications, vol. 26, no. 3, pp. 319-321, 2013
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]