mlsanityData to 7 Oct 2026

Learning Search-Space Specific Heuristics Using Neural Networks

arXiv 2306.04019 ↗First posted 6 Jun 2023cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose and evaluate a system which learns a neuralnetwork heuristic function for forward search-based, satisficing classical planning. Our system learns distance-to-goal estimators from scratch, given a single PDDL training instance. Training data is generated by backward regression search or by backward search from given or guessed goal states. In domains such as the 24-puzzle where all instances share the same search space, such heuristics can also be reused across all instances in the domain. We show that this relatively simple system can perform surprisingly well, sometimes competitive with well-known domain-independent heuristics.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 9 of its 31 references that are in the map. First posted on arXiv 6 Jun 2023.

Builds on

9 of 31 references.

References · 9

  1. 2022Generative Adversarial Networkscited by 5,603
  2. 2019Learning Domain-Independent Planning Heuristics with Hypergraph Networkscited by 50
  3. 2017Learning Generalized Reactive Policies using Deep Neural Networkscited by 39
  4. 2016Learning to Rank for Synthesizing Planning Heuristicscited by 22
  5. 2019Size Independent Neural Transfer for RDDL Planningcited by 12
  6. 2018Transfer of Deep Reactive Policies for MDP Planningcited by 11
  7. 2017Towards learning domain-independent planning heuristicscited by 3
  8. 2014Scaling up Heuristic Planning with Relational Decision Treescited by 2
  9. 2018Learning Classical Planning Strategies with Policy Gradientcited by 2

Built on by

Cited by year

Citing papers per year: 2023: 1; 2024: 0; 2025: 1.

2 papers.