Papers › Planning in Strawberry Fields: Evaluating and Improving the Planning and Scheduling...

Planning in Strawberry Fields: Evaluating and Improving the Planning and Scheduling Capabilities of LRM o1

3 Oct 2024arXiv:2410.02162archive 2025-07-28

Karthik Valmeekam, Kaya Stechly, Atharva Gundawar, Subbarao Kambhampati

The ability to plan a course of action that achieves a desired state of affairs has long been considered a core competence of intelligent agents and has been an integral part of AI research since its inception. With the advent of large language models (LLMs), there has been considerable interest in the question of whether or not they possess such planning abilities, but -- despite the slew of new private and open source LLMs since GPT3 -- progress has remained slow. OpenAI claims that their recent o1 (Strawberry) model has been specifically constructed and trained to escape the normal limitations of autoregressive LLMs -- making it a new kind of model: a Large Reasoning Model (LRM). In this paper, we evaluate the planning capabilities of two LRMs (o1-preview and o1-mini) on both planning and scheduling benchmarks. We see that while o1 does seem to offer significant improvements over autoregressive LLMs, this comes at a steep inference cost, while still failing to provide any guarantees over what it generates. We also show that combining o1 models with external verifiers -- in a so-called LRM-Modulo system -- guarantees the correctness of the combined system's output while further improving performance.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2410.02162")

Code

Syntology Ran 8 of 9 code samples harvested from 2 repositories linked to this paper; 1 has no recorded run. Of those that ran: 8 ran with no contract checked.

By repository: community (archive-listed): 9 samples from 2 repositories, 8 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

karthikv792/gpt-plan-benchmark mentioned on GitHubMIT report
karthikv792/llms-planning mentioned on GitHubMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

9 samples harvested; 8 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

8ran
1unverified

Licence: 0 of the 9 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from 2 repositories linked to this paper, official or community; each sample names its own and says which. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

fill_template karthikv792/gpt-plan-benchmark/plan-bench/utils/pddl_to_text.py community (archive-listed) ran MIT (permissive) · 8221b37cc068b36a · report
generate_from_bloom karthikv792/gpt-plan-benchmark/plan-bench/utils/llm_utils.py community (archive-listed) ran MIT (permissive) · 52b78255f2b9a159 · report
get_data karthikv792/llms-planning/llm_planning_analysis/stats_generation.py community (archive-listed) ran MIT (permissive) · 5a1377db1f3d97a5 · report
get_sorted karthikv792/gpt-plan-benchmark/plan-bench/utils/pddl_to_text.py community (archive-listed) ran MIT (permissive) · b088e7075b491add · report
parse_problem karthikv792/gpt-plan-benchmark/plan-bench/utils/pddl_to_text.py community (archive-listed) ran MIT (permissive) · 799968ced0b94957 · report
random_mapping karthikv792/gpt-plan-benchmark/plan-bench/obfuscator.py community (archive-listed) ran MIT (permissive) · 232066a31b3b39f1 · report
send_query karthikv792/gpt-plan-benchmark/plan-bench/utils/llm_utils.py community (archive-listed) ran MIT (permissive) · e56a33cbda477581 · report
store_predicates karthikv792/gpt-plan-benchmark/plan-bench/model_parser/parser_new.py community (archive-listed) ran MIT (permissive) · 57a2407f329edb96 · report
random_mapping karthikv792/llms-planning/llm_planning_analysis/obfuscator.py community (archive-listed) unverified MIT (permissive) · 51fd8b7713cc3071 · report

Tasks

Scheduling

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections