Accepted to AAMAS 2026 (Full Paper)

ReAcTree: Hierarchical LLM Agent Trees
with Control Flow for Long-Horizon Task Planning

Jae-Woo Choi1, 2, Hyungmin Kim2, Hyobin Ong2, Youngwoo Yoon1, 2,
Minsu Jang1, 2, Dohyung Kim1, 2, Jaehong Kim1
1 Electronics and Telecommunications Research Institute (ETRI)
2 University of Science and Technology (UST)

Abstract

Recent advancements in large language models (LLMs) have enabled significant progress in decision-making and task planning for embodied autonomous agents. However, most existing methods struggle with complex, long-horizon tasks because they rely on a monolithic trajectory that entangles all past decisions and observations to solve the entire task in a single unified process. To address this limitation, we propose ReAcTree, a hierarchical task-planning method that decomposes a complex goal into manageable subgoals within a dynamically constructed agent tree. Each subgoal is handled by an LLM agent node capable of reasoning, acting, and further expanding the tree, while control flow nodes coordinate the execution strategies of agent nodes. In addition, we integrate two complementary memory systems: each agent node retrieves goal-specific, subgoal-level examples from episodic memory and shares environment-specific observations through working memory. Experiments on the WAH-NL and ALFRED show ReAcTree consistently outperforms strong task-planning baselines such as ReAct across diverse LLMs. Notably, on WAH-NL, ReAcTree achieves a 61% goal success rate with Qwen 2.5 72B, nearly doubling ReAct’s 31%.

Video Demonstration

Method Overview

Overview of ReAcTree framework
Figure 1. Overview of ReAcTree framework. Given a high-level goal from a user, the root agent node generates a sub-plan and expands the tree by adding appropriate control flow nodes and child agent nodes. Then, the agent tree is executed, coordinated by control flow nodes, with agent nodes performing reasoning and actions in the environment.

Quantitative Results

ReAcTree consistently outperforms baselines across diverse LLMs. Notably, on the WAH-NL dataset, ReAcTree+WM achieves a 61% Goal Success Rate (GSR) with Qwen 2.5 72B, nearly doubling the performance of ReAct+WM.

1. Main Results on WAH-NL

Method LLaMA 3.1 8B LLaMA 3.1 70B Qwen 2.5 7B Qwen 2.5 72B Mistral 7B Gemma 2 9B Phi-4-RP 14B
GSRSSR GSRSSR GSRSSR GSRSSR GSRSSR GSRSSR GSRSSR
ZSP [19] 1.0013.03 0.0014.42 0.008.98 0.0014.22 0.0011.65 1.0013.87 17.900.00
Tree-Planner (N=25) 1.0017.00 2.0016.72 6.0022.23 6.0032.41 1.0020.43 2.0017.58 3.0017.52
Tree-Planner (N=50) 4.0021.85 4.0023.43 8.0028.10 9.0036.03 6.0023.63 3.0023.30 4.0020.40
ReAct [56] 8.0034.25 30.0057.05 10.0031.82 26.0051.38 6.0028.18 9.0037.20 33.0048.13
ReAct + WM 16.0042.65 33.0063.15 13.0039.73 31.0054.05 9.0031.95 11.0039.93 33.0051.28
ReAcTree (Ours) 21.0051.98 32.0060.58 18.0050.20 48.0075.13 11.0037.92 26.0060.43 49.0067.47
ReAcTree + WM (Ours) 30.0060.77 58.0079.27 37.0059.63 61.0079.58 15.0049.57 38.0067.08 49.0069.30

Table 1. Goal Success Rate (GSR) and Subgoal Success Rate (SSR) on WAH-NL dataset (%). Bold indicates the best result, and underline indicates the second best.

2. Main Results on ALFRED

Split Method LLaMA 3.1 70B Qwen 2.5 72B
Valid-Seen ReAct + WM 33.31 37.07
ReAcTree + WM 40.00 40.85
Valid-Unseen ReAct + WM 32.40 39.10
ReAcTree + WM 37.03 39.83

Table 2. Goal Success Rate (GSR) on ALFRED dataset (%). ReAcTree demonstrates strong generalization to unseen environments.

Qualitative Results

Qualitative example on WAH-NL
Figure 3. Qualitative example on WAH-NL. (Left) ReAcTree successfully completes the long-horizon task by effectively combining reasoning, acting, and planning capabilities. (Right) ReAct fails the task due to repetitive actions and lack of hierarchical planning.

Citation

@misc{choi2025reactree,
      title={ReAcTree: Hierarchical LLM Agent Trees with Control Flow for Long-Horizon Task Planning}, 
      author={Jae-Woo Choi and Hyungmin Kim and Hyobin Ong and Youngwoo Yoon and Minsu Jang and Dohyung Kim and Jaehong Kim},
      year={2025},
      eprint={2511.02424},
      archivePrefix={arXiv},
      primaryClass={cs.AI},
      url={https://arxiv.org/abs/2511.02424},
}
}