Deep Learning for Generalised Planning with Background Knowledge
Not on the map. Why?
Abstract (arXiv)
Automated planning is a form of declarative problem solving which has recently drawn attention from the machine learning (ML) community. ML has been applied to planning either as a way to test `reasoning capabilities' of architectures, or more pragmatically in an attempt to scale up solvers with learned domain knowledge. In practice, planning problems are easy to solve but hard to optimise. However, ML approaches still struggle to solve many problems that are often easy for both humans and classical planners. In this paper, we thus propose a new ML approach that allows users to specify background knowledge (BK) through Datalog rules to guide both the learning and planning processes in an integrated fashion. By incorporating BK, our approach bypasses the need to relearn how to solve problems from scratch and instead focuses the learning on plan quality optimisation. Experiments with BK demonstrate that our method successfully scales and learns to plan efficiently with high quality solutions from small training data generated in under 5 seconds.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 54 references that are in the map. First posted on arXiv 10 Oct 2024.
Builds on
21 of 54 references.
References · 21
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2020Reward Machines: Exploiting Reward Function Structure in Reinforcement Learningcited by 191
- 2019Neural Logic Machinescited by 145
- 2014The LAMA Planner: Guiding Cost-Based Anytime Planning with Landmarkscited by 87
- 2019Learning Domain-Independent Planning Heuristics with Hypergraph Networkscited by 50
- 2021Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limitscited by 38
- 2023Learning Domain-Independent Heuristics for Grounded and Lifted Planningcited by 31
- 2018Features, Projections, and Representation Change for Generalized Planningcited by 25
- 2016Learning to Rank for Synthesizing Planning Heuristicscited by 22
- 2020Learning Generalized Relational Heuristic Networks for Model-Agnostic Planningcited by 22
- 2024Return to Tradition: Learning Reliable Heuristics with Classical Machine Learningcited by 19
- 2019Qualitative Numeric Planning: Reductions and Complexitycited by 18
9 more
- 2021Generalized Planning as Heuristic Searchcited by 18
- 2023Deep Explainable Relational Reinforcement Learning: A Neuro-Symbolic Approachcited by 15
- 2022Scaling-up Generalized Planning as Heuristic Search with Landmarkscited by 14
- 2019Blocks: Collaborative and Persistent Augmented Reality Experiencescited by 11
- 2023Optimize Planning Heuristics to Rank, not to Estimate Cost-to-Goalcited by 10
- 2020Beyond Graph Neural Networks with Lifted Relational Neural Networkscited by 9
- 2023Levin Tree Search with Context Modelscited by 7
- 2022Hierarchical Decomposition and Analysis for Generalized Planningcited by 4
- 2024Learning Generalized Policies for Fully Observable Non-Deterministic Planning Domainscited by 1
Built on by
Citing papers per year: 2024: 2.
2 papers.
- 2024Graph Learning for Numeric Planningcited by 5
- 2024Graph Learning for Planning: The Story Thus Far and Open Challengescited by 0
- 2024Graph Learning for Planning: The Story Thus Far and Open Challenges3 Dec 2024
- 2024Graph Learning for Numeric Planning31 Oct 2024
Similar, not cited
Close in wording, no citation either way
- 2024Learning to Select Goals in Automated Planning with Deep-Q Learning
- 2026Intelli-Planner: Towards Customized Urban Planning via Large Language Model Empowered Reinforcement Learning
- 2025Reasoning Is All You Need for Urban Planning AI
- 2026Learning to Search and Searching to Learn for Generalization in Planning
- 2026PDDLCoder: Agentic PDDL Generation for LLM-Assisted Symbolic Planning
- 2026Planning with Transformers: Chain of Computation and Structured Context Windows
- 2026Language Models as Higher-Order Planning Formalizers
- 2021Planning from Pixels in Environments with Combinatorially Hard Search Spaces