STRUCTUREDAGENT: Planning with AND/OR Trees for Long-Horizon Web Tasks

ELita Lobo, Xu Chen, Jingjing Meng, Nan Xi, Yang Jiao +3 more
3/5/2026
cs.AI

No confident code implementation found for this paper.

Abstract

Recent advances in large language models (LLMs) have enabled agentic systems for sequential decision-making. Such agents must perceive their environment, reason across multiple time steps, and take actions that optimize long-term objectives. However, existing web agents struggle on complex, long-horizon tasks due to limited in-context memory for tracking history, weak planning abilities, and greedy behaviors that lead to premature termination. To address these challenges, we propose STRUCTUREDAGENT, a hierarchical planning framework with two core components: (1) an online hierarchical planner that uses dynamic AND/OR trees for efficient search and (2) a structured memory module that tracks and maintains candidate solutions to improve constraint satisfaction in information-seeking tasks. The framework also produces interpretable hierarchical plans, enabling easier debugging and facilitating human intervention when needed. Our results on WebVoyager, WebArena, and custom shopping benchmarks show that STRUCTUREDAGENT improves performance on long-horizon web-browsing tasks compared to standard LLM-based agents.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{lobo2026structuredagent,
  title  = {STRUCTUREDAGENT: Planning with AND/OR Trees for Long-Horizon Web Tasks},
  author = {ELita Lobo and Xu Chen and Jingjing Meng and Nan Xi and Yang Jiao and Chirag Agarwal and Yair Zick and Yan Gao},
  year   = {2026},
  eprint = {2603.05294},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2603.05294v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2603.05294.svg)](https://codeofpaper.com/paper/2603.05294)

Discussion