mlsanityData to 14 Oct 2026

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

arXiv 2404.05235 ↗First posted 8 Apr 2024cs.AIcited by 6

Not on the map. Why?

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.

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

4 of 37 references.

References · 4

  1. 2014The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarkscited by 87
  2. 2016Learning to Rank for Synthesizing Planning Heuristicscited by 22
  3. 2018Online Planner Selection with Graph Neural Networks and Adaptive Schedulingcited by 13
  4. 2014A Hybrid LP-RPG Heuristic for Modelling Numeric Resource Flows in Planningcited by 2

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 2; 2025: 2; 2026: 2.

6 papers.

  1. 2025Successor-Generator Planning with LLM-generated Heuristicscited by 7
  2. 2024Graph Learning for Numeric Planningcited by 5
  3. 2024Graph Learning for Planning: The Story Thus Far and Open Challengescited by 0
  4. 2025Symmetry-Invariant Novelty Heuristics via Unsupervised Weisfeiler-Leman Featurescited by 0
  5. 2026Personalized Medication Planning via Direct Domain Modeling and LLM-Generated Heuristicscited by 0
  6. 2026Exploiting Search in Symbolic Numeric Planning with Patternscited by 0