Abstract
Very recently, the well-known concept of landmarks has been adapted from the classical planning setting to hierarchical planning. It was shown how a pre-processing step that extracts local landmarks from a planning domain and problem description can be used in order to prune the search space that is to be explored before the actual search is performed. This pruning technique eliminates all branches of the task decomposition tree, for which can be proven that they will never lead to a solution. In this paper, we investigate this technique in more detail and extend it by introducing search strategies which use these local landmarks in order to guide the planning process more effectively towards a solution. Our empirical evaluation shows that the pre-processing step dramatically improves performance because dead ends can be detected much earlier than without pruning and that our search strategies using the local landmarks outperform many other possible search strategies.
Original language | English |
---|---|
Pages | 1-12 |
Number of pages | 12 |
Publication status | Published - 2010 |
Externally published | Yes |
Event | 25th KI Workshop on Planen, Scheduling und Konfigurieren, Entwerfen 201025th KI Workshop on Planning, Scheduling, Configuration, and Design 2010 - Karlsruhe, Germany Duration: 21 Sept 2010 → 24 Sept 2010 |
Conference
Conference | 25th KI Workshop on Planen, Scheduling und Konfigurieren, Entwerfen 201025th KI Workshop on Planning, Scheduling, Configuration, and Design 2010 |
---|---|
Country/Territory | Germany |
City | Karlsruhe |
Period | 21/09/10 → 24/09/10 |