GAVEL: Graph World Models for Verified and Efficient Long-Horizon LLM Task Planning
Summary
This paper introduces GAVEL, a framework that uses graph world models to verify and repair long-horizon LLM planning for robotic tasks, significantly improving success rates and efficiency in simulations.
View Cached Full Text
Cached at: 09/21/26, 03:22 PM
Paper page - GAVEL: Graph World Models for Verified and Efficient Long-Horizon LLM Task Planning
Source: https://huggingface.co/papers/2609.19315
Abstract
Largelanguagemodels(LLMs)provideaflexibleinterfaceforlong-horizonrobotplanning,butgeneratedplansoftenfailtorespectembodimentconstraints,recoverfromplanningerrors,orreasoneffectivelyunderpartialobservability.WepresentGAVEL,aframeworkforverifyingandrepairinglong-horizonLLMplanningbuiltaroundanexplicitgraphworldmodel.Thegraphrepresentsrelevantobject-relations,actionpre-conditionsandeffects,andprobabilisticbeliefsoverunobservedobjectlocations.ThismodelcanpredicttheconsequencesofLLM-generatedactionsbeforeexecution,detectviolations,andrepairthosewhosecorrectionsfollowdirectlyfromtheworldmodel.ThismethodalsoreservesLLMreplanningsolelyforerrorsrequiringsemanticreasoning.Formulti-taskinstructions,GAVELreasonsoverdistributionsofpossibleobjectlocationstoreorderremainingsubtasksandminimizeexpectedsearchcost.WeevaluateGAVELonBEHAVIOR-1Kacross100singlelong-horizontasksand500multi-taskinstructions.WithQwen3-8B,GAVELimprovessingle-tasksuccessfrom41.2%to91.8%andmulti-tasksuccessfrom19.9%to92.6%.Distributionalbeliefreasoningalsoreducestraveldistancebyapproximately5.4%comparedwithastaticvariant.Theseimprovementsshowthatanexplicitgraphworldmodelharnesscansubstantiallyimprovethereliabilityandefficiencyoflong-horizonembodiedplanningacrosscompactandfrontierhostedLLMcapabilities.
View arXiv pageView PDFAdd to collection
Get this paper in your agent:
hf papers read 2609\.19315
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2609.19315 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2609.19315 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2609.19315 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
GraphThink: Graph-Enhanced LLM Thinking for Long-Horizon Embodied Task Planning
GraphThink is a framework that integrates task graphs and scene graphs to enhance LLM-based planning for long-horizon embodied tasks, achieving state-of-the-art results on the ALFRED benchmark and improving generalization and closed-loop replanning.
Grounded Iterative Language Planning: How Parameterized World Models Reduce Hallucination Propagation in LLM Agents
This paper introduces Grounded Iterative Language Planning (GILP), a method that combines a small parameterized world model with LLM-based reasoning to reduce hallucination propagation in LLM agents. Experiments show GILP reduces hallucinated-state rate from 0.176 to 0.035 and raises task success from 0.668 to 0.838 on graph-structured planning benchmarks.
GigaWorld-1: A Roadmap to Build World Models for Robot Policy Evaluation
This paper systematically studies world models for robotic policy evaluation, introduces the WMBench benchmark and GigaWorld-1 model, and shows that long-horizon rollout consistency is more critical than short-term visual realism.
τ_0-VLA: a Hierarchical Robot Foundation Model with World-Model-Guided Test-Time Computation
A hierarchical vision-language-action model improves long-horizon robot manipulation by using world-model-guided test-time search to scale computation for high-level subtask decisions.
GATS: Graph-Augmented Tree Search with Layered World Models for Efficient Agent Planning
GATS introduces a Graph-Augmented Tree Search with a layered world model (symbolic, learned, generative) to eliminate LLM calls during planning, achieving 100% success on synthetic tasks and stress tests, outperforming LATS and ReAct.