WLPlan: Relational Features for Symbolic Planning
Not on the map. Why?
Abstract (arXiv)
Scalable learning for planning research generally involves juggling between different programming languages for handling learning and planning modules effectively. Interpreted languages such as Python are commonly used for learning routines due to their ease of use and the abundance of highly maintained learning libraries they exhibit, while compiled languages such as C++ are used for planning routines due to their optimised resource usage. Motivated by the need for tools for developing scalable learning planners, we introduce WLPlan, a C++ package with Python bindings which implements recent promising work for automatically generating relational features of planning tasks. Such features can be used for any downstream routine, such as learning domain control knowledge or probing and understanding planning tasks. More specifically, WLPlan provides functionality for (1) transforming planning tasks into graphs, and (2) embedding planning graphs into feature vectors via graph kernels. The source code and instructions for the installation and usage of WLPlan are available at tinyurl.com/42kymswc
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 19 of its 43 references that are in the map. First posted on arXiv 1 Nov 2024.
Builds on
19 of 43 references.
References · 19
- 2018How Powerful are Graph Neural Networks?cited by 4,355
- 2018Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networkscited by 878
- 2021Identity-aware Graph Neural Networkscited by 197
- 2019Neural Logic Machinescited by 144
- 2018A Survey on Data Collection for Machine Learning: a Big Data -- AI Integration Perspectivecited by 111
- 2019Wasserstein Weisfeiler-Lehman Graph Kernelscited by 104
- 2021Breaking the Limits of Message Passing Graph Neural Networkscited by 101
- 2020Machine Learning in Python: Main developments and technology trends in data science, machine learning, and artificial intelligencecited by 81
- 2019Learning Domain-Independent Planning Heuristics with Hypergraph Networkscited by 50
- 2019ASNets: Deep Learning for Generalised Planningcited by 42
- 2020Planning with Learned Object Importance in Large Problem Instances using Graph Neural Networkscited by 38
- 2021Learning General Optimal Policies with Graph Neural Networks: Expressive Power, Transparency, and Limitscited by 38
7 more
- 2017Action Schema Networks: Generalised Policies with Deep Learningcited by 32
- 2016Faster Kernels for Graphs with Continuous Attributes via Hashingcited by 31
- 2023Learning Domain-Independent Heuristics for Grounded and Lifted Planningcited by 31
- 2020Learning Generalized Relational Heuristic Networks for Model-Agnostic Planningcited by 22
- 2024Return to Tradition: Learning Reliable Heuristics with Classical Machine Learningcited by 19
- 2023What Planning Problems Can A Relational Neural Network Solve?cited by 8
- 2023Improving Subgraph-GNNs via Edge-Level Ego-Network Encodingscited by 4
Built on by
Citing papers per year: 2026: 1.
1 paper.