arXiv AI

HTN-Orchestrate: A Hierarchical Task Network Framework for Multi-Agent Orchestration

HTN‑Orchestrate is a two‑layer framework that separates global task planning from local subtask execution using a hierarchical task network. The Planner builds and updates subtask hierarchies only when prerequisite results are available, while local Orchestrators schedule workers to carry out leaf subtasks. On five benchmarks—including web research, scientific reasoning, and research workflows—the framework outperforms ReAct, Agent Team, and DeepSeek Harness, achieving 89.73% accuracy on BrowseComp and 73.44% on SUPERChem.

arXiv Computation and Language
Oct 12

Proactive Agentic Orchestration

The paper introduces POrchestra, a proactive agentic orchestration framework that lets sub‑agents request harness adjustments during execution, enhancing adaptability to dynamic environments. It also proposes On‑Policy Orchestration Distillation (OPOD), which uses hindsight feedback from sub‑agents’ requests to provide targeted improvement signals for training the orchestration policy. Experiments on three long‑horizon benchmarks show that POrchestra boosts task success by about 9.1% over the best baseline, and with OPOD the improvement rises to 10.0%, while also improving cost‑performance trade‑offs.

By Xueyang Feng, Chaozhuo Li, Xiaohe Bo, Jiakai Tang, Chenxi Li, Qiwei Ye, Xu Chen
arXiv AI
Jun 9

SearchSwarm: Towards Delegation Intelligence in Agentic LLMs for Long-Horizon Deep Research

arXiv:2606. 09730v1 Announce Type: new Abstract: Large language models are increasingly expected to handle complex, long-horizon real-world tasks whose context demands can grow without bound, yet model context windows remain inherently finite.

By Pu Ning, Quan Chen, Kun Tao, Xinyu Tang, Tianshu Wang, Qianggang Cao, Xinyu Kong, Zujie Wen, Zhiqiang Zhang, Jun Zhou
arXiv AI
Jul 10

WebSwarm: Recursive Multi-Agent Orchestration for Deep-and-Wide Web Search

arXiv:2607. 08662v1 Announce Type: cross Abstract: Large language model (LLM)-based web search agents are transforming information seeking from simple factoid question answering into complex, deep-and-wide search and research-oriented tasks.

By Xiaoshuai Song, Liancheng Zhang, Kangzhi Zhao, Yutao Zhu, Zhongyuan Wang, Guanting Dong, Jinghan Yang, Han Li, Kun Gai, Ji-Rong Wen, Zhicheng Dou
arXiv AI
Oct 7

DHCG: Dynamic Construction of Hierarchical Collaboration Graphs for LLM-Based Multi-Agent Reasoning

The paper introduces DHCG, a framework that dynamically constructs hierarchical collaboration graphs for large language model–based multi‑agent systems. DHCG coordinates Planner, Worker, and Generator modules to adaptively determine the composition and scale of agents during execution, guided by feedback and action‑aware preference optimization. Experiments on code generation, mathematical reasoning, and domain‑specific tasks show DHCG surpasses static and dynamic baselines, improving performance by 2.77–8.02 points and achieving a 13.06‑point gain over single‑agent baselines.

By Jie Ren, Jiakang Yuan, Chenyu Huang, Hezeer Ma, Jiayuan Fan, Tao Chen
arXiv AI
Oct 28

Spine: Compiling Subtask Trees into Structured Context for Long-Horizon Coding Agents

Spine is a new interface and runtime that aligns a language model’s context with the nesting and completion of subtasks in long‑horizon coding problems. By letting agents declare explicit subtask boundaries through work scopes, Spine records interactions in a persistent SpineTree and compiles only the necessary unfinished subtask history into the model’s prompt, replacing completed subtasks with their results while reusing prefix‑cache. Integrated into Codex and Pi, SpineCodex and the reusable Pi package achieve significant performance gains—improving SWE‑Milestone and ProgramBench scores and reducing costs—without the overhead of recursive subagent delegation.

By Jiahong Xiang, Kunqiu Chen, Lingming Zhang, Yuqun Zhang
arXiv AI
Oct 15

SkillHorizon: Constructing Long-Horizon Agent Tasks through Skill Composition

arXiv:2610.14966v1 Announce Type: new Abstract: Long-horizon agents must complete workflows in which later activities depend on earlier outputs and changes to shared state. A key challenge for evalua...

By Yuxuan Liu, Zhaochen Su, Hangyu Guo, Shijue Huang, Zhixiong Zhang, Kawai Chung, Zhongwei Xie, Tianshi Zheng, Wei Fan, Qing Zong, Haochen Shi, Baixuan Xu, Haoran Li, Yangqiu Song
arXiv AI
Oct 9

TaReD: Tool-Aware Recursive Decomposition for Long-Horizon Tasks

TaReD introduces a tool-aware recursive decomposition strategy for long‑horizon tasks, organizing tools into a hierarchy of capabilities and allowing agents to discover and use tools on demand. By aligning subtask decomposition with the required capabilities, the method reduces the unreliability of long execution chains and improves task success rates. Experiments on complex real‑world tasks demonstrate up to a 40‑percentage‑point improvement over baseline approaches.

By Wei-Xiang Mao, Zhi-Kai Chen, De-Chuan Zhan, Han-Jia Ye