Subset-Saturated Cost Partitioning for Optimal Classical Planning

  • Jendrik Seipp University of Basel
  • Malte Helmert University of Basel

Abstract

Cost partitioning is a method for admissibly adding multiple heuristics for state-space search. Saturated cost partitioning considers the given heuristics in sequence, assigning to each heuristic the minimum fraction of remaining costs that it needs to preserve its estimates for all states. We generalize saturated cost partitioning by allowing to preserve the heuristic values of only a subset of states and show that this often leads to stronger heuristics.

Published
2019-07-06