Pith. sign in

REVIEW 2 cited by

Exploring and Benchmarking the Planning Capabilities of Large Language Models

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.13094 v2 pith:P7BGHZE7 submitted 2024-06-18 cs.CL cs.AIcs.LG

Exploring and Benchmarking the Planning Capabilities of Large Language Models

classification cs.CL cs.AIcs.LG
keywords planninglanguageperformancellmsbenchmarkscapabilitiesclassicalexploring
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Classical and natural language planning tasks remain a difficult domain for modern large language models (LLMs). In this work, we lay the foundations for improving planning capabilities of LLMs. First, we construct a comprehensive benchmark suite encompassing both classical planning benchmarks and natural language scenarios. This suite includes algorithms to methodically generate instances of tasks with varying levels of difficulty, allowing for rigorous and systematic evaluation of LLM performance. Next, 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. In addition, we demonstrate the positive impact of fine-tuning LLMs on optimal planning paths. We also probe the efficacy of chain-of-thought reasoning methods to improve LLM planning performance. Moreover, we probe the performance of the proposed methods in out-of-distribution scenarios, assessing the ability to generalize to novel and unseen planning challenges. Finally, we investigate model's failure modes and reveal insights that hold true across different benchmarks.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Property-Guided LLM Program Synthesis for Planning

    cs.AI 2026-05 unverdicted novelty 7.0

    Property-guided LLM program synthesis with counterexample feedback creates direct heuristics for PDDL planning domains that require far fewer generations and less evaluation cost than score-based baselines.

  2. Planning with Transformers: Chain of Computation and Structured Context Windows

    cs.LG 2026-07 conditional novelty 6.0

    Small transformers, trained from scratch on curated instruction traces and run inside a pointer-memory loop, solve BlocksWorld/Pancake at >99.89% and Tower of Hanoi to 20 disks.