Information-seeking multi-agent systems increasingly traverse vast corpora spanning thousands of documents, expansive code repositories, and heterogeneous databases. However, most existing frameworks partition computation around static data slices, causing multi-agent coordination overhead to scale combinatorially with how data is segmented rather than what the user query actually requires. UIUC researchers introduce ANTMAN (Adaptive Need Tracking for Multi-Agent Navigation), an adaptive coordination framework treating evolving unresolved information needs as the atomic unit of runtime dispatch. ANTMAN maintains a revisable Need Graph tracking requirements, accumulated evidence, prior retrieval attempts, and progress, adaptively controlling worker selection, routing, and task-local recovery. Under a 16x expansion in searchable context, baseline partition methods suffer a >15x surge in coordination costs, whereas ANTMAN expands active coordination by only 1.23x while preserving high response fidelity.
Key Takeaways
- ✓Need-Driven Multi-Agent Scheduling: Replaces rigid dataset partitioning with a dynamic Need Graph that tracks evolving informational deficits, eliminating coordination blowups over massive data spaces.
- ✓1.23x Coordination Growth under 16x Context Scaling: As searchable corpus size expands 16-fold, traditional partition baselines experience a >15x explosion in coordination exchanges, while ANTMAN grows by only 1.23x.
- ✓Cost-Efficient Delegation to Smaller Workers: Decoupling high-level coordination from underlying substrate search enables seamless delegation to smaller, economical worker models without degrading synthesis accuracy.
Finished reading? Explore benchmark rankings & pricing
Real-world SWE-bench scores & $20/mo vs API cost break-even calculator

Discussion & Comments
0Sign in to join the discussion
Connect with AI developers to exchange benchmark insights.