On the public citation graph
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0004-3702(75)90019-3openalex-snapshot
An analysis of alpha-beta pruning
inferredcites →https://doi.org/10.1016/j.artint.2011.08.001openalex-snapshot
Learning heuristic functions for large state spaces
inferredcites →https://doi.org/10.1016/s0004-3702(01)00108-4openalex-snapshot
Planning as heuristic search
inferredcites →https://doi.org/10.1016/s0736-5853(86)80081-8openalex-snapshot
Heuristics: Intelligent Search Strategies for Computer Problem Solving
inferredcites →https://doi.org/10.1038/s42256-019-0070-zopenalex-snapshot
Solving the Rubik’s cube with deep reinforcement learning and search
inferredcites →https://doi.org/10.1109/cvpr.2016.90openalex-snapshot
Deep Residual Learning for Image Recognition
inferredcites →https://doi.org/10.1109/ijcnn.2008.4633963openalex-snapshot
A neural network approach to ordinal regression
inferredcites →https://doi.org/10.1609/icaps.v19i1.13370openalex-snapshot
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
inferredcites →https://doi.org/10.1609/icaps.v28i1.13873openalex-snapshot
Training Deep Reactive Policies for Probabilistic Planning Problems
inferredcites →https://doi.org/10.1609/socs.v8i1.18438openalex-snapshot
Better Orders for Saturated Cost Partitioning in Optimal Classical Planning
inferredcites →https://doi.org/10.1613/jair.855openalex-snapshot
The FF Planning System: Fast Plan Generation Through Heuristic Search
inferredcites →https://doi.org/10.4230/oasics.dx.2026.15openalex-snapshot
AutoResearch Lite: a reproducible paper-inspired experiment runner (Adam mechanism reproduction and convergence-speed comparison)
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-030-71158-0_12openalex-snapshot
Heuristic Learning in Domain-Independent Planning: Theoretical Analysis and Experimental Evaluation
inferred← citeshttps://doi.org/10.1109/isi65680.2025.11201129openalex-snapshot
A Symbolic Incubator for Training Planners via Recognition-Based Feedback
inferred← citeshttps://doi.org/10.1609/aaai.v35i13.17413openalex-snapshot
Synthesis of Search Heuristics for Temporal Planning via Reinforcement Learning
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.29984openalex-snapshot
Can LLMs Fix Issues with Reasoning Models? Towards More Likely Models for AI Planning
inferred← citeshttps://doi.org/10.1609/aaai.v38i18.29986openalex-snapshot
Learning Domain-Independent Heuristics for Grounded and Lifted Planning
inferred← citeshttps://doi.org/10.1609/icaps.v30i1.6754openalex-snapshot
Learning Domain-Independent Planning Heuristics with Hypergraph Networks
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.16008openalex-snapshot
Learning Heuristic Selection with Dynamic Algorithm Configuration
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19793openalex-snapshot
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19820openalex-snapshot
Debugging a Policy: Automatic Action-Policy Testing in AI Planning
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19845openalex-snapshot
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods
inferred← citeshttps://doi.org/10.1609/icaps.v32i1.19846openalex-snapshot
Reinforcement Learning for Classical Planning: Viewing Heuristics as Dense Reward Generators
inferred← citeshttps://doi.org/10.1609/icaps.v33i1.27185openalex-snapshot
Automatic Metamorphic Test Oracles for Action-Policy Testing
inferred← citeshttps://doi.org/10.1609/socs.v12i1.18545openalex-snapshot
Exploiting Learned Policies in Focal Search
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21771openalex-snapshot
Neural Network Heuristic Functions: Taking Confidence into Account
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21786openalex-snapshot
Focal Discrepancy Search for Learned Heuristics (Extended Abstract)
inferred← citeshttps://doi.org/10.1609/socs.v15i1.21795openalex-snapshot
Sampling from Pre-Images to Learn Heuristic Functions for Classical Planning (Extended Abstract)
inferred← citeshttps://doi.org/10.1613/jair.1.11633openalex-snapshot
ASNets: Deep Learning for Generalised Planning
inferred← citeshttps://doi.org/10.1613/jair.1.13768openalex-snapshot
Classical Planning in Deep Latent Space
inferred← citeshttps://doi.org/10.1613/jair.1.15742openalex-snapshot
Understanding Sample Generation Strategies for Learning Heuristic Functions in Classical Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2023/605openalex-snapshot
Formal Explanations of Neural Network Policies for Planning
inferred← citeshttps://doi.org/10.24963/ijcai.2023/805openalex-snapshot
AI Planning for Hybrid Systems
inferred← citeshttps://doi.org/10.5451/unibas-ep81224openalex-snapshot
Reinforcement Learning for Planning Heuristics
inferred← citeshttps://doi.org/10.5451/unibas-ep84326openalex-snapshot
Neural Network Heuristic Functions for Classical Planning: Reinforcement Learning and Comparison to Other Methods
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.