Route Anything: A Study of Model and Policy Routing for General-Purpose AI Systems
AuthorsPengfei Zhou, Yixing Ma, Hexin Wang, Weidong Tang, Zhenglin Wan, Wangbo Zhao, Yang You
AffiliationsNational University of Singapore, HPC-AI Lab · Inf Rec, Cardinal AI Lab · University of California, Berkeley · Nov 2026 · Hong Kong University of Science and Technology # ; #
Route Anything studies how AI systems can choose the right specialized model or policy for each task to improve results while spending less compute.
Key results
Runs across 25 benchmarks and 452 candidate configurations.
Points above the best fixed candidate.
Points across 16 benchmarks; video-generation gain is 2.1 points.
Less policy time while routing achieves 71.6% success versus 70.5% for the best single policy.
× quality-per-cost efficiency across four testbeds.
× quality-per-cost efficiency on coding tasks.
What the paper found
Route Anything studies how a general-purpose AI system can choose among specialized models and policies instead of relying on one fixed model. It formalizes routing as maximizing expected task quality minus cost weighted by price, and shows that a router’s potential depends on what it can observe. The researchers build an omni-modal matrix of 374,401 scored runs across 25 benchmarks and 452 candidate configurations, including models from Anthropic’s Claude, OpenAI’s GPT, DeepSeek, Alibaba’s Qwen, Google’s Gemini, and xAI’s Grok families. Per-input oracle routing beats the best fixed candidate by 5.4 points, while a learned capability-tree router using Qwen3.5-4B improves the score by 0.3 points across 16 benchmarks and by 2.1 points on video generation. On robot manipulation, outcome-based routing reaches 71.6% success versus 70.5% for the best single policy, with 24% less policy time; training on winner labels performs poorly because latency tie-breaks distort those labels. For cost-aware routing against references such as Claude Opus 4.6 and GPT-4, the framework uses price-weighted selection and independent tests to certify quality floors. Across four testbeds, routing delivers 8.82× average quality-per-cost efficiency, including 25.5× on coding tasks.
Original abstract
Artificial general intelligence (AGI) requires a method that can understand, generate, reason, and act across diverse domains and modalities. Rather than relying on a single model to master every capability, a promising path toward AGI now is to orchestrate a heterogeneous ecosystem of specialized models, tools, and policies (candidates) into a unified AI system. At the heart of this vision lies a fundamental question: how can an AI system dynamically select and coordinate the most capable candidate for each task while balancing performance and computational cost? In this work, we present Route Anything, a unified framework for studying model and policy routing across general-purpose AI systems. We develop a unified theoretical foundation that characterizes optimal routing under quality--cost trade-offs and establishes how the information available to a router determines its attainable performance. To systematically investigate routing across diverse capabilities, we first construct an omni-modal trajectory matrix spanning 25 benchmarks across language understanding, image, video, and speech generation, coding and workplace agents, and robotic manipulation, comprising 374,401 scored runs from 452 candidate configurations. Building on this framework, we train and test different routers to investigate the potential of omni-modal model routing, the capabilities of learned routers, and the conditions under which routing improves efficiency. Our results reveal substantial opportunities for capability orchestration: per-input oracle routing outperforms the best fixed candidate by 5.4 points, and learned routers outperform it by 0.3 points across 16 benchmarks, by 2.1 points on video generation, and by 1.1 points on robot manipulation while using 24% less policy time. More importantly, routing raises efficiency by 8.82x on average compared with the reference model.
Read the original paperMore in AI Agents
Browse all 71 papers →ToolSpace: Scaling Tool-Centric Environment Synthesis for Long-Horizon Agents
Guanting Dong, Zhichao Sun, Xinyu Yang, Rui Wang, Xin Deng, Jiajie Jin, Zhixiong Yang, Junhao Huang, Han Han, Mingyu Ma, Xiaotao Wang, Yuyang Hu, Xiaoshuai Song, Xiaoxi Li, Jiejun Tan, Zhecan Wang, Shihan Dou, Honglin Guo, Zhiheng Xi, Tao Gui, Tao Ji, Qi Zhang, Yutao Zhu, Ji-Rong Wen, Zhicheng Dou
ToolSpace builds tougher, more realistic tool-use environments from real execution traces to train and evaluate long-horizon AI agents.
What Effort Level Should I Choose? On the Economics of Reasoning Effort in LLM Agents
Kaiser Sun, Yongchan Kwon, Zain Hasan, Shang Zhu, Kaitlyn Zhou, Federico Bianchi
More reasoning effort can cost much more without reliably improving an LLM agent’s result, so escalating only after verified failure may be a better strategy.
Build, Don't Play: Self-Improving LLM Research Agents Develop a Hearthstone Battlegrounds AI That Rivals Top Players
Changlian Ma, Limin Wang
A team of LLM research agents builds a Hearthstone Battlegrounds AI that reportedly outperforms top human players on the live ladder.