AI Navigate

GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models

arXiv cs.AI / 3/11/2026

Models & Research

Key Points

  • GenePlan is a new framework that combines large language model-assisted evolutionary algorithms to generate domain-specific generalized planners for PDDL-based classical planning tasks.
  • It formulates generalized planning as an optimization problem, evolving Python interpretable planners that minimize plan lengths across various problem instances.
  • In evaluations on six benchmark domains plus two novel domains, GenePlan achieved a high SAT score of 0.91, nearly matching state-of-the-art planners and significantly outperforming other LLM-based methods like chain-of-thought prompting.
  • The planners produced by GenePlan are efficient, solving new problems quickly (0.49 seconds on average) and cost-effectively (around $1.82 per domain using GPT-4o).
  • This approach demonstrates the potential of integrating LLMs with evolutionary strategies for advancing automated planning solutions in AI.

Computer Science > Artificial Intelligence

arXiv:2603.09481 (cs)
[Submitted on 10 Mar 2026]

Title:GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models

View a PDF of the paper titled GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models, by Andrew Murray and 2 other authors
View PDF HTML (experimental)
Abstract:We present GenePlan (GENeralized Evolutionary Planner), a novel framework that leverages large language model (LLM) assisted evolutionary algorithms to generate domain-dependent generalized planners for classical planning tasks described in PDDL. By casting generalized planning as an optimization problem, GenePlan iteratively evolves interpretable Python planners that minimize plan length across diverse problem instances. In empirical evaluation across six existing benchmark domains and two new domains, GenePlan achieved an average SAT score of 0.91, closely matching the performance of the state-of-the-art planners (SAT score 0.93), and significantly outperforming other LLM-based baselines such as chain-of-thought (CoT) prompting (average SAT score 0.64). The generated planners solve new instances rapidly (average 0.49 seconds per task) and at low cost (average $1.82 per domain using GPT-4o).
Comments:
Subjects: Artificial Intelligence (cs.AI)
Cite as: arXiv:2603.09481 [cs.AI]
  (or arXiv:2603.09481v1 [cs.AI] for this version)
  https://doi.org/10.48550/arXiv.2603.09481
Focus to learn more
arXiv-issued DOI via DataCite

Submission history

From: Andrew Murray [view email]
[v1] Tue, 10 Mar 2026 10:32:05 UTC (648 KB)
Full-text links:

Access Paper:

Current browse context:
cs.AI
< prev   |   next >
Change to browse by:
cs

References & Citations

export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo
Bibliographic Tools

Bibliographic and Citation Tools

Bibliographic Explorer Toggle
Bibliographic Explorer (What is the Explorer?)
Connected Papers Toggle
Connected Papers (What is Connected Papers?)
Litmaps Toggle
Litmaps (What is Litmaps?)
scite.ai Toggle
scite Smart Citations (What are Smart Citations?)
Code, Data, Media

Code, Data and Media Associated with this Article

alphaXiv Toggle
alphaXiv (What is alphaXiv?)
Links to Code Toggle
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub Toggle
DagsHub (What is DagsHub?)
GotitPub Toggle
Gotit.pub (What is GotitPub?)
Huggingface Toggle
Hugging Face (What is Huggingface?)
Links to Code Toggle
Papers with Code (What is Papers with Code?)
ScienceCast Toggle
ScienceCast (What is ScienceCast?)
Demos

Demos

Replicate Toggle
Replicate (What is Replicate?)
Spaces Toggle
Hugging Face Spaces (What is Spaces?)
Spaces Toggle
TXYZ.AI (What is TXYZ.AI?)
Related Papers

Recommenders and Search Tools

Link to Influence Flower
Influence Flower (What are Influence Flowers?)
Core recommender toggle
CORE Recommender (What is CORE?)
About arXivLabs

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.