WebSwarm: A Recursive Multi-Agent Collaboration Framework for Depth and Breadth Web Search

This paper introduces WebSwarm, a recursive multi-agent orchestration framework for depth-and-breadth web search. Existing LLM-based single-agent search methods are limited by long reasoning traces and context window constraints, making it difficult to simultaneously achieve search depth and coverage. WebSwarm addresses this by dynamically instantiating search nodes that jointly optimize task decomposition, recursive expansion, and agent collaboration. Each node couples a local objective with a search mode, enabling it to either solve the task autonomously or delegate sub-tasks to child nodes while returning evidence upward for the parent node's further expansion and aggregation. The approach further guides the search process by probing how information is organized on web pages and reusing prior experience. Experiments on benchmarks such as BrowseComp-Plus and WideSearch demonstrate that WebSwarm significantly outperforms both single-agent and multi-agent baselines across depth, breadth, and interleaved search tasks, showcasing exceptional search effectiveness and generalization.

Background and Context

The landscape of information retrieval is undergoing a significant structural shift as large language models (LLMs) move beyond simple factual query-response paradigms toward complex, research-grade tasks that demand both depth and breadth. Traditional single-agent architectures, predominantly built on the ReAct framework, face critical limitations in this new environment. These systems rely on long, linear reasoning traces that are inherently constrained by the finite context windows of current LLMs. When a user query requires navigating through multiple layers of information, the agent often loses track of earlier evidence or fails to maintain coherence across a wide search space, leading to performance bottlenecks. This constraint makes it exceptionally difficult for a single agent to simultaneously achieve deep analytical rigor and broad coverage of relevant sources.

While recent multi-agent systems have attempted to mitigate these issues by employing parallel execution and result aggregation, they often fall short in handling recursive depth and adaptive collaboration. Existing solutions typically lack the ability to dynamically adjust the search tree structure based on the evolving complexity of the query. They tend to operate with fixed topologies that do not allow for the organic expansion of search branches when deeper investigation is required. Consequently, these systems struggle with tasks that require interleaving deep dives into specific sub-topics with broad surveys of the wider information landscape. The inability to recursively delegate sub-tasks and aggregate evidence in a structured manner limits their effectiveness in high-stakes research scenarios where precision and comprehensiveness are equally critical.

To address these fundamental architectural gaps, researchers have introduced WebSwarm, a novel recursive multi-agent orchestration framework designed specifically for depth-and-breadth web search. WebSwarm departs from linear or flat search structures by implementing a dynamic, tree-based collaboration network. This approach allows the system to autonomously determine the necessary depth and breadth of search for any given query. By breaking away from the passive execution model of traditional agents, WebSwarm empowers agents to act as autonomous planners capable of recursive delegation. This paradigm shift not only resolves the context loss issues inherent in single-agent long-horizon reasoning but also establishes a robust technical pathway for handling high-complexity research queries that were previously intractable for automated systems.

Deep Analysis

At the core of WebSwarm’s technical architecture is a mechanism for the dynamic instantiation of search nodes, each tightly coupled with a specific local objective and a defined search mode. The search mode dictates how a node organizes its internal search behavior and collaborates with other nodes, providing the system with exceptional flexibility. Unlike static multi-agent setups, WebSwarm does not pre-determine the search path. Instead, it dynamically decides the subsequent actions of each node based on its current state. A node may choose to solve a task autonomously if sufficient information is available, or it may decompose the task further and delegate sub-tasks to child nodes. This recursive delegation mechanism enables the system to automatically expand the search tree when facing complex problems, ensuring that no relevant avenue of inquiry is prematurely abandoned.

The framework employs a sophisticated feedback loop that combines bottom-up information aggregation with top-down task decomposition. When child nodes complete their assigned sub-tasks, they return detailed evidence and results to their parent nodes. The parent node then uses this evidence to further expand, correct, or aggregate the search process. This recursive structure ensures that decisions at higher levels of the search tree are grounded in concrete evidence gathered from deeper levels. To guide this complex recursive process, WebSwarm introduces two key strategies: first, it probes how information is organized on web pages to provide grounding for subsequent node expansions, ensuring that the search direction remains logical and relevant. Second, it reuses process-level experiences among sibling nodes with similar characteristics, significantly improving search efficiency by avoiding redundant computations.

The implementation of experience reuse is particularly critical for maintaining efficiency in large-scale search tasks. By recognizing patterns in how different nodes approach similar sub-problems, WebSwarm can apply previously successful strategies to new, analogous tasks. This reduces the computational overhead associated with exploring unproductive search paths and allows the system to scale effectively. The dynamic nature of the node instantiation means that the system can adapt its resource allocation in real-time, focusing computational power on the most promising branches of the search tree while pruning less relevant ones. This adaptive capability ensures that WebSwarm maintains high performance even as the complexity and scope of the user’s query increase, making it a robust solution for real-world information retrieval challenges.

Industry Impact

The evaluation of WebSwarm’s effectiveness was conducted across a comprehensive suite of authoritative web search benchmarks, including BrowseComp-Plus, WideSearch, DeepWideSearch, and GISA. These datasets were specifically chosen to cover a wide spectrum of task complexities, ranging from single-depth queries to extensive breadth searches, and finally to interleaved tasks that require both. The experimental results demonstrate that WebSwarm consistently outperforms existing single-agent and multi-agent baseline methods across all tested benchmarks. The performance gap is particularly pronounced in interleaved search tasks, where the system’s ability to balance depth and breadth is most heavily tested. This superior performance validates the efficacy of the recursive collaboration mechanism in handling complex information needs that require both detailed analysis and broad contextual understanding.

Further ablation studies provided deep insights into the specific contributions of WebSwarm’s components. The analysis revealed that the modules for task decomposition, recursive expansion, and experience reuse are critical to the system’s overall performance. Removing any of these components resulted in a significant drop in effectiveness, highlighting their interdependent roles in the framework. The research also explored the impact of varying task difficulties, web tool efficiency, and model generalization capabilities. It was found that WebSwarm maintains stable performance improvements across different model sizes, indicating that its architectural advantages are not solely dependent on the underlying LLM’s capabilities. Furthermore, the system showed significant sensitivity to optimizations in tool calling, suggesting that efficient integration with external search tools is a key factor in maximizing its potential.

The implications of these findings extend beyond mere performance metrics. WebSwarm’s ability to generalize across different task types and model scales suggests that it is not just a specialized tool for specific benchmarks but a versatile framework for general-purpose research assistance. The consistent superiority over baselines in complex, interleaved tasks underscores the importance of recursive delegation in modern information retrieval. As the volume of online information continues to grow, the ability to navigate this complexity with both depth and breadth is becoming increasingly valuable. WebSwarm’s performance demonstrates that recursive multi-agent systems can effectively overcome the limitations of context windows and linear reasoning, offering a scalable solution for the next generation of search applications.

Outlook

The introduction of WebSwarm carries significant implications for the open-source community, industrial applications, and future research directions. For the open-source community, the dynamic recursive orchestration framework provides a scalable template for developers looking to build more complex agent collaboration systems. By lowering the barrier to entry for designing multi-agent architectures, WebSwarm encourages innovation and experimentation in the field of autonomous agents. Developers can leverage this framework to create specialized search agents for niche domains without having to reinvent the underlying coordination mechanisms. This accessibility is likely to accelerate the development of a diverse ecosystem of specialized search tools tailored to specific user needs.

In the industrial sector, WebSwarm’s capability to balance depth and breadth positions it as a valuable asset for high-value applications such as financial analysis, legal research, and academic literature reviews. These domains require not just the retrieval of facts but the synthesis of vast amounts of information into coherent, evidence-based conclusions. WebSwarm’s recursive structure allows it to delve deep into specific legal precedents or financial reports while simultaneously surveying broader market trends or regulatory changes. This dual capability enhances the practicality and accuracy of search robots in professional settings, potentially transforming how experts access and process information. The system’s ability to ground its findings in specific web page structures and reuse prior experiences makes it particularly suited for environments where precision and efficiency are paramount.

Looking forward, the strategies employed by WebSwarm for evidence grounding and experience reuse offer new avenues for improving the interpretability and efficiency of multi-agent systems. As LLMs continue to advance, the recursive search paradigm advocated by WebSwarm is poised to become a standard architecture for handling ultra-large-scale information retrieval tasks. This evolution will likely drive a shift from simple information acquisition to deep knowledge discovery, enabling systems to not just find answers but to construct comprehensive understanding. The future of web search may well be defined by the ability of systems to recursively explore, delegate, and synthesize information in a manner that mimics human research processes, with WebSwarm serving as a foundational blueprint for this transition.

Sources