# Novelty Heuristics, Multi-Queue Search, and Portfolios for Numeric Planning

arXiv: https://arxiv.org/abs/2404.05235 · HTML: https://mlsanity.com/paper/2404.05235/

## Key facts

- Cited by 6 papers in the map (data through 14 Oct 2026).
- Builds on 4 of its 37 references that are in the map.
- First posted on arXiv 8 Apr 2024.

## Builds on (most cited first, 4 of 4)

- [The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarks](https://mlsanity.com/paper/1401.3839/) (2014)
- [Learning to Rank for Synthesizing Planning Heuristics](https://mlsanity.com/paper/1608.01302/) (2016)
- [Online Planner Selection with Graph Neural Networks and Adaptive Scheduling](https://mlsanity.com/paper/1811.00210/) (2018)
- [A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planning](https://mlsanity.com/paper/1402.0564/) (2014)

## Built on by (most cited first, 6 of 6)

- [Successor-Generator Planning with LLM-generated Heuristics](https://mlsanity.com/paper/2501.18784/) (2025)
- [Graph Learning for Numeric Planning](https://mlsanity.com/paper/2410.24080/) (2024)
- [Graph Learning for Planning: The Story Thus Far and Open Challenges](https://mlsanity.com/paper/2412.02136/) (2024)
- [Symmetry-Invariant Novelty Heuristics via Unsupervised Weisfeiler-Leman Features](https://mlsanity.com/paper/2508.18520/) (2025)
- [Personalized Medication Planning via Direct Domain Modeling and LLM-Generated Heuristics](https://mlsanity.com/paper/2601.03687/) (2026)
- [Exploiting Search in Symbolic Numeric Planning with Patterns](https://mlsanity.com/paper/2606.16329/) (2026)

## Abstract (arXiv)

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.