DillonZChen/wlplan

Relational Features for Planning

47
/ 100
Emerging

WLPlan helps researchers and practitioners in automated planning to analyze and understand complex planning problems. It takes in standard PDDL (Planning Domain Definition Language) problem descriptions and converts them into structured graph representations. From these graphs, it generates numerical feature embeddings that can be used for machine learning tasks, such as learning better planning heuristics. This tool is ideal for academic researchers and advanced AI practitioners working on improving AI planning systems.

Use this if you need to transform PDDL planning problems into a format suitable for machine learning algorithms to build or evaluate planning heuristics.

Not ideal if you are looking for a domain-independent planner or a tool to visualize planning solutions.

automated-planning AI-research machine-learning-for-planning heuristic-search graph-features
No Package No Dependents
Maintenance 10 / 25
Adoption 5 / 25
Maturity 16 / 25
Community 16 / 25

How are scores calculated?

Stars

14

Forks

6

Language

C++

License

MIT

Last pushed

Feb 18, 2026

Commits (30d)

0

Get this data via API

curl "https://pt-edge.onrender.com/api/v1/quality/ml-frameworks/DillonZChen/wlplan"

Open to everyone — 100 requests/day, no key needed. Get a free key for 1,000/day.