arXiv (All)
open access
GAVEL: Graph World Models for Verified and Efficient Long-Horizon LLM Task Planning
Large language models (LLMs) provide a flexible interface for long-horizon robot planning, but generated plans often fail to respect embodiment constraints, recover from planning errors, or reason effectively under partial observability. We present GAVEL, a framework for verifying and repairing long
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- STRUCTUREDAGENT: Planning with AND/OR Trees for Long-Horizon Web Tasks#1036639
- GigaWorld-1: A Roadmap to Build World Models for Robot Policy Evaluation#348416
- From Solver Feedback to Faithful Plans: Multi-Role Reinforcement Learning for Symbolic Planning#1129368
- Qwen/DeepPlanning#786782
- ProgPrompt: Generating Situated Robot Task Plans using Large Language Models#16610
Record · ID 1013912
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive