arXiv (All)
open access
STRUCTUREDAGENT: Planning with AND/OR Trees for Long-Horizon Web Tasks
Existing LLM-based web agents struggle on complex, long-horizon tasks due to limited in-context memory, weak planning abilities, and greedy behaviors that lead to premature termination. To address these challenges, we propose \SA{}, a hierarchical planning framework that interleaves planning and exe
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
- GAVEL: Graph World Models for Verified and Efficient Long-Horizon LLM Task Planning#1013912
- NexForge: Scaling Agent Capabilities through Requirement-Driven Task Synthesis for LLMs#381815
- From Solver Feedback to Faithful Plans: Multi-Role Reinforcement Learning for Symbolic Planning#1129368
- UniACE: A Unified Framework for Evaluating LLM Agentic Capabilities#820473
- GitHarness: Git Init Your Harness Working Memory for Perpetual User Requirements#1131990
Record · ID 1036639
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