GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models

• URL: http://arxiv.org/abs/2603.09481v1
• Date: Tue, 10 Mar 2026 10:32:05 GMT
• Title: GenePlan: Evolving Better Generalized PDDL Plans using Large Language Models
• Abstract summary: We present GenePlan, a novel framework that leverages large language model (LLM) to generate domain-dependent generalized planners.<n>GenePlan iteratively evolves interpretable Python planners that minimize plan length across diverse problem instances.<n>In empirical evaluation, GenePlan achieved an average SAT score of 0.91, closely matching the performance of the state-of-the-art planners.
• Score: 4.400420377775205
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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).

Related papers

• PDDLCoder: Agentic PDDL Generation for LLM-Assisted Symbolic Planning [0.4433169165028139]
  We present PDDLCoder, an agentic framework for PDDL generation from natural language that iteratively generates, analyzes, and refines planning specifications.<n>Experiments on the NL-pddlgym test set show that PDDLCoder generates applicable plans for 89.6% of tested planning problems.
  arXiv  Detail & Related papers  (2026-08-17T14:34:56Z)
• Robust Asynchronous Planning via Auto-Formalization [18.999996458563373]
  LLMs can plan by either generating action sequences directly as a Planner or translating tasks into domain specific language for an external solver as a Formalizer.<n>We unify these challenges that under a single formulation and introduce the first three benchmarks that address each at scale.<n>We conclude the choice of formal representation primarily determines whether planning scales.
  arXiv  Detail & Related papers  (2026-05-31T03:28:42Z)
• Self-Improvement for Fast, High-Quality Plan Generation [13.377592170793994]
  We show that a decoder-only transformer can generate high-quality plans for unseen problem instances.<n>We also show how to self-improve an initial model trained on sub-optimal data.
  arXiv  Detail & Related papers  (2026-05-05T10:55:18Z)
• Hierarchical LLM-Based Multi-Agent Framework with Prompt Optimization for Multi-Robot Task Planning [0.9453554184019106]
  Multi-robot task planning requires decomposing natural-language instructions into executable actions.<n>PDDL planners provide rigorous guarantees but struggle to handle ambiguous or long-horizon missions.<n>We present a hierarchical multi-agent LLM-based planner with prompt optimization.
  arXiv  Detail & Related papers  (2026-02-25T08:08:26Z)
• TodoEvolve: Learning to Architect Agent Planning Systems [68.48983335970901]
  TodoEvolve is a meta-planning paradigm that autonomously synthesizes and dynamically revises task-specific planning.<n>PlanFactory provides a common interface for heterogeneous planning patterns.<n>TodoEvolve consistently surpasses carefully engineered planning modules while maintaining economical API costs and runtime overhead.
  arXiv  Detail & Related papers  (2026-02-08T06:37:01Z)
• Improved Generalized Planning with LLMs through Strategy Refinement and Reflection [58.79806530685551]
  We introduce an approach that generates the strategy in the form of pseudocode.<n>We extend the Python debug phase with a reflection step prompting the LLM to pinpoint the reason for the observed plan failure.<n>Running experiments on 17 benchmark domains, we show that these extensions substantially improve the quality of the generalized plans.
  arXiv  Detail & Related papers  (2025-08-19T14:42:18Z)
• PLAN-TUNING: Post-Training Language Models to Learn Step-by-Step Planning for Complex Problem Solving [66.42260489147617]
  We introduce PLAN-TUNING, a framework that distills synthetic task decompositions from large-scale language models.<n>Plan-TUNING fine-tunes smaller models via supervised and reinforcement-learning objectives to improve complex reasoning.<n>Our analysis demonstrates how planning trajectories improves complex reasoning capabilities.
  arXiv  Detail & Related papers  (2025-07-10T07:30:44Z)
• Exploring and Benchmarking the Planning Capabilities of Large Language Models [57.23454975238014]
  This work lays the foundations for improving planning capabilities of large language models (LLMs) We construct a comprehensive benchmark suite encompassing both classical planning benchmarks and natural language scenarios. We investigate the use of many-shot in-context learning to enhance LLM planning, exploring the relationship between increased context length and improved planning performance.
  arXiv  Detail & Related papers  (2024-06-18T22:57:06Z)
• AdaPlanner: Adaptive Planning from Feedback with Language Models [56.367020818139665]
  Large language models (LLMs) have recently demonstrated the potential in acting as autonomous agents for sequential decision-making tasks. We propose a closed-loop approach, AdaPlanner, which allows the LLM agent to refine its self-generated plan adaptively in response to environmental feedback. To mitigate hallucination, we develop a code-style LLM prompt structure that facilitates plan generation across a variety of tasks, environments, and agent capabilities.
  arXiv  Detail & Related papers  (2023-05-26T05:52:27Z)
• A Framework for Neurosymbolic Robot Action Planning using Large Language Models [3.0501524254444767]
  We present a framework aimed at bridging the gap between symbolic task planning and machine learning approaches. The rationale is training Large Language Models (LLMs) into a neurosymbolic task planner compatible with the Planning Domain Definition Language (PDDL) Preliminary results in selected domains show that our method can: (i) solve 95.5% of problems in a test data set of 1,000 samples; (ii) produce plans up to 13.5% shorter than a traditional symbolic planner; (iii) reduce average overall waiting times for a plan availability by up to 61.4%.
  arXiv  Detail & Related papers  (2023-03-01T11:54:22Z)
• Differentiable Spatial Planning using Transformers [87.90709874369192]
  We propose Spatial Planning Transformers (SPT), which given an obstacle map learns to generate actions by planning over long-range spatial dependencies. In the setting where the ground truth map is not known to the agent, we leverage pre-trained SPTs in an end-to-end framework. SPTs outperform prior state-of-the-art differentiable planners across all the setups for both manipulation and navigation tasks.
  arXiv  Detail & Related papers  (2021-12-02T06:48:16Z)
• Divide-and-Conquer Monte Carlo Tree Search For Goal-Directed Planning [78.65083326918351]
  We consider alternatives to an implicit sequential planning assumption. We propose Divide-and-Conquer Monte Carlo Tree Search (DC-MCTS) for approximating the optimal plan. We show that this algorithmic flexibility over planning order leads to improved results in navigation tasks in grid-worlds.
  arXiv  Detail & Related papers  (2020-04-23T18:08:58Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.