Kairos is a planning system that orchestrates five heterogeneous planning engines—ground heuristic search, compressed and snap-action temporal search, time-step hybrid dynamics, and lifted search—based on a semantic profile of each task. By scheduling these engines within a shared time and memory budget and validating every candidate plan with an independent validator, Kairos achieves broader PDDL coverage (from STRIPS to PDDL+) and outperforms the strongest specialized planners on 1,756 tasks, especially in numeric, temporal, PDDL3, and PDDL+ domains. The system also handles all seventeen PDDL features tested, with key contributions from compressed temporal search and a novelty fallback mechanism.
By Francisco Mart\'in Rico, Esther Aguado Gonz\'alez, Francisco Miguel Moreno Olivo, Rodrigo P\'erez Rodr\'iguez, Jos\'e Miguel Guerrero Hern\'andez, Francisco J. Rodr\'iguez Lera
arXiv:2607. 08894v1 Announce Type: new Abstract: Large Language Model (LLM) agents have shown promise in multi-step planning tasks, but existing approaches like LATS (Language Agent Tree Search) and ReAct rely heavily on LLM inference during planning, leading to high computational costs and stochastic behavior.
By Maureese Williams, Dymitr Nowicki
arXiv:2606.00981v2 Announce Type: replace
Abstract: LLMs can plan by generating schedules directly as a Planner, or by translating a task into a formal specification for a solver as a Formalizer. Mos...
By Jiayi Zhang, Jianing Yin, Ben Zhou, Li Zhang
Large Language Model (LLM) agents have shown promise in multi-step planning tasks, but existing approaches like LATS (Language Agent Tree Search) and ReAct rely heavily on LLM inference during planning, leading to high computational costs and stochastic behavior. We present \textbf{GATS} (Graph-Augmented Tree Search), a planning framework that combines systematic UCB1-based tree search with a layered world model to eliminate LLM calls during inference while achieving superior planning performance.
LLM‑BabyBench transforms the BabyAI gridworld into a fully observable, purely textual setting that isolates planning as the sole source of failure. By serialising the entire grid, providing formal instructions, and validating actions deterministically, the benchmark introduces the PPD suite—Predict, Plan, and Decompose tasks—each scored with metrics that separate mission understanding from sequencing. Across a range of large language models, simulation accuracy is high while planning success drops sharply beyond a model‑specific horizon, revealing that plan length—not grid size—drives failure and that models often commit to a single corridor‑shaped route without backtracking.
By Idriss Malek, Omar Choukrani, Daniil Orel, Anh Duy Le Dinh, Zhuohan Xie, Zangir Iklassov, Martin Tak\'a\v{c}, Salem Lahlou
Capability‑Grounded Agentic Planning (CGAP) is a method that transforms a natural‑language request into a deterministic PDDL model by compiling a catalog of tools, then uses a classical planner to generate an abstract plan. An LLM interprets the request as goals and, during execution, adds missing entity‑specific calls while a verifier ensures each result satisfies the original request. Experiments on ToolSandbox, ComplexFuncBench, BFCL multi‑turn, and τ²‑bench retail show CGAP can outperform standard tool‑calling agents by up to 28.9 points.
By Shikha Shrestha, William Yeoh, Ning Zhang, Yevgeniy Vorobeychik
arXiv:2608. 04265v1 Announce Type: cross Abstract: Evaluations of LLM planning agents largely ask whether a task succeeds or a declared plan is followed.
By J. de Curt\`o, I. de Zarz\`a
arXiv:2606. 27806v1 Announce Type: new Abstract: World models for language agents come in two useful forms.
By Xinyuan Song, Zekun Cai
Translating natural-language planning intent into verified plans is a longstanding challenge: people communicate goals in language, while classical planners require formal PDDL specifications. Recent agentic frameworks bridge this gap by orchestrating a pool of specialized repair agents inside a verifier-checked refinement loop, but the orchestrator at the centre is itself a prompted frontier LLM, paying a frontier-LLM API call at every refinement step.
PlannerForge is a unified LLM‑agent framework that covers the entire scenario‑based testing pipeline for autonomous driving systems, from scenario generation to ADS assessment, and adds ADS enhancement and benchmarking stages. It was evaluated with ten off‑the‑shelf LLMs across all tasks and five prompt conditions, achieving best‑per‑task scores between 0.88 and 1.00 and matching commercial APIs with open‑source models such as Qwen3.6:35B. The end‑to‑end chaining retains 83% of seed queries for commercial backends and 78% for open‑source, outperforming existing tools like Scenario Factory 2.0 and BM25 in natural‑language generation, attribute realization, and physically valid edits.
whyItMatters":"PlannerForge demonstrates that a single LLM‑based system can streamline and improve the fragmented scenario‑based testing workflow for autonomous driving, achieving high performance without domain‑specific fine‑tuning."
By Yuan Gao, Sebastian M\"uller, Mattia Piccinini, Marc Kaufeld, Yuchen Zhang, Finn Rasmus Sch\"afer, Qunying Song, Johannes Betz
arXiv:2508. 02721v2 Announce Type: replace-cross Abstract: While powerful, the inherent non-determinism of large language model (LLM) agents limits their application in structured operational environments where procedural fidelity and predictable execution are strict requirements.
By Libin Qiu, Yuhang Ye, Zhirong Gao, Xide Zou, Junfu Chen, Ziming Gui, Weizhi Huang, Xiaobo Xue, Wenkai Qiu, Kun Zhao
Plan-and-Patch is a plan‑and‑act framework that uses a diffusion language model to generate structured, program‑like plans and then repairs them by filling in selected regions while keeping the surrounding steps fixed. The approach avoids regenerating entire plans, reducing unnecessary changes. Experiments show that on the Natural Plan benchmark, diffusion planners achieve a 53.7% plan‑repair success rate versus 27.0% for autoregressive planners, and after task‑specific training on ALFWorld and TextCraft, diffusion planners match autoregressive planners in plan generation success while cutting mean plan‑generation latency by 39–46%.
By Syamantak Kumar, Jiang Guo, Hassan Hamad, Hideo Kobayashi, Yi Xiang, Yezhou Yang, Yanjun Qi, Daniele Bonadiman, Jiarong Jiang