Online Saturated Cost Partitioning for Classical Planning

Anonymous

Keywords: optimal classical planning, admissible heuristics, cost partitioning

TL;DR: Diversifying the set of saturated cost partitioning heuristics during the A* search drastically reduces planning times.

Abstract: Saturated cost partitioning is a general method for admissibly adding heuristic estimates for optimal state-space search. The algorithm strongly depends on the order in which it considers the heuristics. The strongest previous approach precomputes a set of diverse orders and the corresponding saturated cost partitionings before the search. This makes evaluating the overall heuristic very fast, but requires a long precomputation phase. By diversifying the set of orders online during the search we drastically speed up the planning process and even solve slightly more tasks.