Long-horizon robot manipulation requires a robot to both execute individual skills reliably and sequence them coherently over extended tasks. Most hierarchical vision-language-action (VLA) models make each such decision with a single forward pass, leaving no mechanism to allocate additional computation to difficult or consequential choices. We introduce τ0-VLA, a hierarchical robot foundation model that formulates high-level subtask generation as a compute-scalable inference problem through world-model-guided test-time computation. At each inference step, the high-level policy uses execution memory to generate a subtask and, when needed, searches over alternatives before committing to its output. A low-level policy then executes the generated subtask across multiple robot embodiments. The policy is trained on 40,115 hours of heterogeneous real-world data with multimodal co-training. Across in-domain and distribution-shifted settings, allocating additional test-time computation substantially improves next-subtask prediction accuracy, and these gains translate into higher closed-loop success on long-horizon robot manipulation tasks.
Figures & tables
Fig. 2: The hierarchical τ0 -VLA architecture. (a) At a high-level inference step t , the proposal model P conditions on the latest multi-view observation ot , task instruction ℓ , carried execution memory Mt−1 , and previously generated subtask zt−1⋆ . It produces observation-aligned memory Mt and a direct proposal ztdir . (b) The low-level policy conditions on the generated subtask zt⋆ , multi-view observation ot , proprioceptive state st , and textual control metadata η . A vision-language backbone and Mixture-of-Transformers (MoT) action expert generate the action chunk at:t+H−1 through conditional flow matching from a noisy action chunk. (c) On the TTC route, the proposal model is invoked N times for each retained branch to generate N candidates. Given the branch’s head-camera image and a candidate, the world model predicts the terminal head-camera image, and the value model assigns a candidate-quality score conditioned on the task instruction, candidate, and predicted image. Beam search globally retains the top- B branches by cumulative score and recursively expands them to depth D . The figure illustrates the root expansion with N=3 and B=2 , where local and cumulative scores coincide. Deeper expansion is omitted for clarity. The reflective model then conditions on hˉt and the final branch summaries Ct to generate the final subtask zt⋆ . This output may coincide with a retained proposal but is not restricted to the retained set and is passed to the low-level policy for execution.
Fig. 3: Representative physical-robot evaluation tasks. (a) Clean Room requires collecting two dirty garments, placing them in a laundry basket, hanging a handbag, handing a blanket to a person, and disposing of table trash. (b) Prepare Ingredients requires retrieving a tomato and an egg, then cracking and stirring the egg while returning the tools. (c) Tomato and Egg Stir Fry requires chopping and transferring the tomatoes, cooking and seasoning the ingredients, plating the dish, and returning the cookware and utensils. (d) Make Milk Tea requires adding toppings, pouring milk and tea, sealing the cup, and inserting a straw. (e) Collect Laundry requires transferring a T-shirt from the bedside table to a laundry basket. (f) Tidy Makeup Table comprises three separately scored instruction-following groups that require different object selections and action sequences from matched visual states.
Method
Clean Room
Prepare Ingredients
Tomato and Egg Stir Fry
Make Milk Tea
Avg.
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
GR00T N1.7 [ 26 ]
0/10
59.80%
1/10
68.57%
0/10
24.32%
0/10
28.46%
2.50%
45.29%
LingBot-VLA [ 40 ]
0/10
66.60%
0/10
35.00%
0/10
12.27%
0/10
63.85%
0.00%
44.43%
π0.5 [ 2 ]
4/10
86.20%
2/10
73.93%
0/10
49.77%
3/10
82.31%
22.50%
73.05%
τ0 -VLA
4/10
92.80%
2/10
66.43%
0/10
65.00%
5/10
96.15%
27.50%
80.10%
τ0 -VLA (Hierarchical System, Plan Once)
5/10
94.80%
4/10
82.86%
4/10
81.82%
5/10
91.92%
45.00%
87.85%
TABLE I: Long-horizon task performance. Each method–task setting uses 10 independently collected physical-robot trials. SR reports successful trials as x/10 , and Progress is the normalized milestone-completion score. Avg. is the unweighted mean of the four task-level rates. The first four rows use direct execution. The final row uses the Hierarchical System with Plan Once and no beam search.
Method
Collect Laundry
Tidy Makeup Table
T-shirt
Cotton Pad
Eyelash Curler
Makeup Puff
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
GR00T N1.7 [ 26 ]
4/10
76.00%
10/10
87.50%
8/10
77.50%
7/10
52.50%
LingBot-VLA [ 40 ]
2/10
35.00%
9/10
67.50%
3/10
22.50%
3/10
33.75%
π0.5 [ 2 ]
9/10
88.00%
9/10
85.00%
8/10
85.00%
7/10
73.75%
τ0 -VLA
10/10
97.00%
10/10
95.00%
9/10
92.50%
10/10
95.00%
TABLE II: Direct-execution performance across embodiments. Tidy Makeup Table comprises three independently scored instruction-following groups. All methods execute the full task instruction without a high-level policy. Each task or task group is evaluated over 10 trials. SR reports successful trials as x/10 , and Progress is the normalized milestone-completion score.
Fig. 4: Next-subtask prediction accuracy under different high-level inference methods. We compare Plan Once, Best-of- N , and TTC (Ours) across four evaluation settings: Make Milk Tea, Book Organization (In-Domain), Book Organization (OOD), and Clean Room.
Method
Make Milk Tea
Book Organization
Clean Room
SR ↑
Progress ↑
SR ↑
Progress ↑
SR ↑
Progress ↑
Plan Once
5/10
91.92%
6/10
66.67%
5/10
94.80%
TTC
7/10
95.38%
9/10
93.33%
7/10
97.60%
TABLE III: Closed-loop physical-robot performance with test-time computation. Each entry uses 10 independently collected trials. Book Organization uses shuffled initial arrangements and is reported without the in-domain and OOD split used in the open-loop evaluation. SR denotes task success rate, and Progress is the normalized milestone-completion score.
Fig. 5: Relationship between computational cost and subtask-prediction accuracy. The accuracy increases with additional computation for the Make Milk Tea and Book Organization tasks, shown in panels (a) and (b), respectively. Each point represents an experimental result obtained at a different computational cost. The orange dashed curves show saturation fits to these results, and the gray dashed lines indicate the Plan Once baselines.
Appendix figures & tables3 assets
Supplementary material from the paper’s appendix.
Appendix
Coordinates
Dimensions
State representation
Left EEF position
1–3
Cartesian position in meters
Left EEF orientation
4–9
Rot6D(RL)
Right EEF position
10–12
Cartesian position in meters
Right EEF orientation
13–18
Rot6D(RR)
Left gripper
19
native opening coordinate
Right gripper
20
native opening coordinate
Appendix
TABLE IV: Canonical 40-D state and action layout. Dimensions are one-indexed. For a rotation matrix R=[r1,r2,r3] , we use Rot6D(R)=[r1⊤,r2⊤]⊤ .
Task
Maximum duration
Clean Room
20 min
Prepare Ingredients
20 min
Tomato and Egg Stir Fry
20 min
Make Milk Tea
10 min
Book Organization
5 min
Collect Laundry
5 min
Appendix
TABLE V: Maximum duration of each physical-robot trial.
Family
Sampling position
Input → target memory
Target subtask
Deployment failure countered
Mix
within-subtask
anywhere in seg. n
Mn→Mn
seg. n
— (aligned, normal progression)
58%
transition
tail of seg. n
Mn→Mn+1
seg. n+1
starting a new subtask after completion
15%
catch-up
head of seg. n
Mn−1→Mn
seg. n
memory lag (behind the visual state)
10%
rollback
late in seg. n
Mn+1…n+3→Mn
retry seg. n
memory run-ahead (over-optimistic)
12%
error-think
annotated failure frame
Mn→ type-dependent
recovery step
unnoticed execution failure
5%
Appendix
TABLE VI: High-level instance families, synthesized by perturbing only the input memory while reading the corrected target from the demonstration. Mn is the memory upon entering segment n . A single unified <think> / <memory> / <subtask> format instantiates all of them at zero extra annotation.
Vision-Language-Action (VLA) models demonstrate remarkable potential for generalizable robotic manipulation. The execution of complex multi-step behaviors in VLA models can be improved by robust instruction grounding, a critical component for effective control. However, current paradigms predominantly rely on coarse, high-level task instructions during supervised fine-tuning. This instruction grounding gap leaves models without explicit intermediate guidance, leading to severe compounding errors in long-horizon tasks. Therefore, bridging this instruction gap and providing scalable post-training for VLA models is urgent. To tackle this problem, we propose \method, the first subtask-aware VLA framework integrated with a scalable offline post-training pipeline. Our framework leverages a large language model to decompose high-level demonstrations into fine-grained atomic subtasks. This approach utilizes a pretrained predictive world model to score candidate action chunks against subtask goals in the latent space, mitigating error accumulation while significantly improving long-horizon robustness. Furthermore, this approach enables highly efficient Group Relative Policy Optimization without the prohibitive expenses associated with online rollouts on physical robots. Extensive simulations validate that our AtomVLA maintains strong robustness under perturbations. When evaluated against fundamental baseline models, it achieves an average success rate of 97.0% on the LIBERO benchmark and 48.0% on the LIBERO-PRO benchmark. Finally, experiments conducted in the real world using the Galaxea R1 Lite platform confirm its broad applicability across diverse tasks, especially long-horizon tasks. All datasets, checkpoints, and code will be released to the public domain following the acceptance of this work for future research.
Xiaoquan Sun, Zetian Xu, Chen Cao +9
INFIFORCE Intelligent Technology Co., Ltd. Hangzhou, China · Huazhong University of Science and Technology, Wuhan, China · The University of Hong Kong, Hong Kong SAR, China +1
Vision-language-action (VLA) models are effective robot action executors, but they remain limited on long-horizon tasks due to the dual burden of extended closed-loop planning and diverse physical operations. We therefore propose VLAs-as-Tools, a strategy that distributes this burden across a high-level vision language model (VLM) agent for temporal reasoning and a family of specialized VLA tools for diverse local physical operations. The VLM handles scene analysis, global planning, and recovery, while each VLA tool executes a bounded subtask. To tightly couple agent planning with VLA tool execution in long-horizon tasks, we introduce a VLA tool-family interface that exposes explicit tool selection and in-execution progress feedback, enabling efficient event-triggered agent replanning without continuous agent polling. To obtain diverse specialized VLA tools that faithfully follow agent invocations, we further propose Tool-Aligned Post-Training (TAPT), which constructs invocation-aligned training units for instruction following and adopts tool-family residual adapters for efficient tool specialization. Across five simulated benchmarks, VLAs-as-Tools improves the success rate of pi05 by 8.9 percentage points on average and enhances invocation fidelity by 15.0 points in Non-biased Rate. On three real-world Franka tasks, it improves success rate from 16.7% to 58.3% under matched data and compute. Code will be released.
Zixing Lei, Changxing Liu, Yichen Xiong +5
Shanghai Jiao Tong University · Zhongguancun Academy · Beihang University
Vision-Language-Action (VLA) models are a powerful paradigm for generalist robotic control. However, their high computational cost and limited control frequency hinder real-time robotic manipulation, especially when large vision-language backbones and iterative action heads run at every control step. Existing VLA acceleration methods often optimize individual components or rely on fixed acceleration rules, treating different control steps with largely fixed computation and overlooking the non-uniform reasoning demands of sequential embodied control. Inspired by human motor control, where cognitive and feedback resources concentrate on goal-sensitive stages, we argue that VLA models should learn when to invest full computation and when to reuse prior computation. We propose ElegantVLA, a plug-in phase-adaptive inference framework that accelerates VLA models through intra-model dynamic compute scheduling. ElegantVLA introduces a lightweight scheduler that observes temporal representation similarity, robot-motion cues, and episode progress to jointly allocate computation across the vision encoder, LLM, and action head. For perception-language reasoning, the scheduler selects a five-level Vision-LLM compute mode, from full recomputation to multi-step temporal reuse, based on visual-language representation stability. For action generation, it selects a three-level denoising mode, reusing intermediate denoising states during stable motion while preserving full refinement for goal-sensitive stages. By coordinating these decisions, ElegantVLA offers a general acceleration framework for modern VLA pipelines with explicit action-generation modules, without modifying or retraining the base model. Experiments on GR00T and CogACT achieve up to 2.55x and 3.77x speedup, and on six real-world GR00T tasks ElegantVLA cuts computation by 2.18x while raising control frequency from 13.8 Hz to 26.3 Hz.
Ye Li, Huanan Liu, Kangye Ji +7
Tsinghua University · University of Illinois at Urbana-Champaign