Vallati, Mauro, Chrpa, Lukáš and Kitchin, Diane (2013) An Automatic Algorithm Selection Approach for Planning. In: IEEE International Conference on Tools with Artificial Intelligence (ICTAI) - 2013, November 4th - 6th 2013, Washington DC, USA. (Unpublished)
- Submitted Version
Despite the advances made in the last decade in automated planning, no planner outperforms all the others in every known benchmark domain. This observation motivates the idea of selecting different planning algorithms for different domains. Moreover, the planners' performances are affected by the structure of the search space, which depends on the encoding of the considered domain. In many domains, the performance of a planner can be improved by exploiting additional knowledge, extracted in the form of macro-operators or entanglements.
In this paper we propose ASAP, an automatic Algorithm Selection Approach for Planning that: (i) for a given domain initially learns additional knowledge, in the form of macro-operators and entanglements, which is used for creating different encodings of the given planning domain and problems, and (ii) explores the 2 dimensional space of available algorithms, defined as encodings--planners couples, and then (iii) selects the most promising algorithm for optimising either the runtimes or the quality of the solution plans.
|Item Type:||Conference or Workshop Item (Paper)|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Q Science > QA Mathematics > QA76 Computer software
|Schools:||School of Computing and Engineering|
|Depositing User:||Diane Kitchin|
|Date Deposited:||22 Aug 2013 12:51|
|Last Modified:||04 Dec 2016 22:05|
Downloads per month over past year
Repository Staff Only: item control page