  Heuristic search is a powerful approach for solving planning problems and
numeric planning is no exception. In this paper, we boost the performance of
heuristic search for numeric planning with various powerful techniques
orthogonal to improving heuristic informedness: numeric novelty heuristics, the
Manhattan distance heuristic, and exploring the use of multi-queue search and
portfolios for combining heuristics.
