WeSearch

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

·3 min read · 0 reactions · 0 comments · 2 views
#gats#graph-augmented#tree#search#layered
GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning
TL;DR · WeSearch summary

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. Our three-layer world model integrates: (L1) exact symbolic action matching, (L2) statistics learned from execution logs, and (L3) LLM-based prediction for unknown actions. On synthetic planning tasks with branching paths and dead-ends, GATS achieves \textbf{100\% success rate} compared to 92 % for LATS and 64\% for ReAct.

Key facts
Original article
arXiv cs.AI
Read full at arXiv cs.AI →
Opening excerpt (first ~120 words) tap to expand

Computer Science > Artificial Intelligence arXiv:2607.08894 (cs) [Submitted on 9 Jul 2026] Title:GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning Authors:Maureese Williams, Dymitr Nowicki View a PDF of the paper titled GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning, by Maureese Williams and Dymitr Nowicki View PDF HTML (experimental) 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.

Excerpt limited to ~120 words for fair-use compliance. The full article is at arXiv cs.AI.

Anonymous · no account needed
Share 𝕏 Facebook Reddit LinkedIn Threads WhatsApp Bluesky Mastodon Email

Discussion

0 comments

More from arXiv cs.AI