Seipp, Jendrik. (2020) Online Saturated Cost Partitioning for Classical Planning. In: HSDIP 2020: Proceedings of the 12th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP). pp. 16-22.
![[img]](https://edoc.unibas.ch/style/images/fileicons/application_pdf.png) |
PDF
- Published Version
218Kb |
Official URL: https://edoc.unibas.ch/81334/
Downloads: Statistics Overview
Abstract
Saturated cost partitioning is a general method for admissiblyadding heuristic estimates for optimal state-space search. Thealgorithm strongly depends on the order in which it considers the heuristics. The strongest previous approach precomputes a set of diverse orders and the corresponding saturatedcost partitionings before the search. This makes evaluatingthe overall heuristic very fast, but requires a long precomputation phase. By diversifying the set of orders online duringthe search we drastically speed up the planning process andeven solve slightly more tasks.
| Faculties and Departments: | 05 Faculty of Science > Departement Mathematik und Informatik > Informatik > Artificial Intelligence (Helmert) |
|---|---|
| UniBasel Contributors: | Seipp, Jendrik |
| Item Type: | Conference or Workshop Item, refereed |
| Conference or workshop item Subtype: | Conference Paper |
| Note: | Publication type according to Uni Basel Research Database: Conference paper |
| Language: | English |
| Related URLs: | |
| edoc DOI: | |
| Last Modified: | 23 Feb 2021 13:25 |
| Deposited On: | 23 Feb 2021 13:25 |
Repository Staff Only: item control page