arXiv AI By Subba Reddy Oota, Francisco Herrera, Jordi Cabot Sagrera, Marcos L\'opez de Prado, Shadab Khan

Do LLM Agents Execute the Plans They Declare? From Planning-Mode Declaration to Pattern-Specific Execution

Read the original on arXiv AI →

The Flow has not summarised this story yet — read it at arXiv AI.

arXiv AI
Oct 31

Kairos: Semantics-Aware Orchestration of Planning Engines across Classical, Numeric, Temporal and Hybrid PDDL

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
Hugging Face Trending Papers
Jul 9

GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning

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.

arXiv Computation and Language
Sep 14

LLM-BabyBench: Can Language Models Plan in Worlds They Can Simulate?

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
arXiv Computation and Language
Nov 2

Capability-Grounded Agentic Planning

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