MetaWorld-X: Hierarchical World Modeling via VLM-Orchestrated Experts for Humanoid Loco-Manipulation
Authors: Yutong Shen, Hangxu Liu, Penghui Liu, Jiashuo Luo, Yongkang Zhang, Rex Morvley, Chen Jiang, Jianwei Zhang, Lei Zhang
Organizations: School of Information Science and Technology, Beijing University of Technology, Beijing, China · School of Information Science and Engineering, Fudan University, Shanghai, China · University of Alberta, Canada · University of Hamburg, Hamburg, Germany
Learning natural, stable, and compositionally generalizable whole-body control policies for humanoid robots performing simultaneous locomotion and manipulation (loco-manipulation) remains a fundamental challenge in robotics. Existing reinforcement learning approaches typically rely on a single monolithic policy to acquire multiple skills, which often leads to cross-skill gradient interference and motion pattern conflicts in high-degree-of-freedom systems. As a result, generated behaviors frequently exhibit unnatural movements, limited stability, and poor generalization to complex task compositions. To address these limitations, we propose MetaWorld-X, a hierarchical world model framework for humanoid control. Guided by a divide-and-conquer principle, our method decomposes complex control problems into a set of specialized expert policies (Specialized Expert Policies, SEP). Each expert is trained under human motion priors through imitation-constrained reinforcement learning, introducing biomechanically consistent inductive biases that ensure natural and physically plausible motion generation. Building upon this foundation, we further develop an Intelligent Routing Mechanism (IRM) supervised by a Vision-Language Model (VLM), enabling semantic-driven expert composition. The VLM-guided router dynamically integrates expert policies according to high-level task semantics, facilitating compositional generalization and adaptive execution in multi-stage loco-manipulation tasks.
Figures & tables
Fig. 2 : MetaWorld-X achieves natural humanoid control through the dynamic orchestration of expert policies guided by a Vision-Language Model (VLM). The framework consists of two core modules: the Skill Expert Pool (SEP) trains specialized policy networks for fundamental motor skills using human motion data, while the Intelligent Router Module (IRM) employs a VLM as a supervisory teacher. The VLM guides the router’s training via few-shot inference, enabling a seamless transition from supervised learning to autonomous operation.
Fig. 3 : Architecture of the SEP module. We project human motion priors to the robot’s configuration space via operator M , then utilize alignment operator A to compute tracking signals for expert policies πθi . By optimizing JSEP with a dynamic weighting mechanism that prioritizes poorly-tracked joints, the module yields the converged expert policies.
Fig. 4 : Example of VLM prompt for Semantic Router.
Algorithm
Stand
Walk
Run
Sit
Carry
R. ± stderr.
S.(M)
R. ± stderr.
S.(M)
R. ± stderr.
S.(M)
R. ± stderr.
S.(M)
R. ± stderr.
S.(M)
PPO [ 28 ]
28.8 ± 0.4
5.3
28.8 ± 0.4
5.3
28.8 ± 0.4
5.3
28.8 ± 0.4
5.3
25.9 ± 0.4
5.4
SAC [ 29 ]
93.6 ± 17.7
4.9
32.7 ± 11.4
5.4
18.3 ± 1.5
5.4
275.9 ± 15.7
6.0
43.4 ± 9.7
5.3
TD-MPC2 [ 7 ]
749.8 ± 63.1
1.8
644.2 ± 162.3
1.8
66.1 ± 4.7
2.0
733.9 ± 120.6
1.1
438.0 ± 72.9
1.9
DreamerV3 [ 8 ]
699.3 ± 62.7
5.5
428.2 ± 14.5
6.0
298.5 ± 84.5
6.0
709.6 ± 98.4
5.2
427.8 ± 51.2
6.0
Ours (IRM)
815.9 ± 0.3 ↑
0.6 ↓
1118.7 ± 7.1 ↑
0.5 ↓
2056.9 ± 13.6 ↑
1.0 ↓
862.2 ± 2.1 ↑
0.6 ↓
963.5 ± 5.1 ↑
0.5 ↓
TABLE I: Expert policy evaluation: Our IRM module vs. baselines. We report maximum returns ( R.±stderr. ) and convergence steps S in Millions (M). ↑ indicates higher is better, ↓ indicates lower is better.
Fig. 5 : We evaluate the performance of four foundational motor skills: Walking, Running, Standing, and Sitting , after 50w training steps. The dashed lines in the learning curves qualitatively represent the reward thresholds associated with the successful execution of each skill.
Fig. 6 : In comparison with TD-MPC2, Green shaded areas highlight the superior performance of Ours , whereas red regions indicate limitations observed in baseline algorithms.
Method
Stand
Walk
Run
Sit
Carry
PPO [ 28 ]
0/10
0/10
0/10
0/10
0/10
SAC [ 29 ]
1/10
1/10
0/10
2/10
1/10
DreamerV3 [ 8 ]
2/10
2/10
1/10
3/10
2/10
TD-MPC2 [ 7 ]
3/10
3/10
2/10
4/10
3/10
Ours
9/10
9/10
9/10
8/10
9/10
TABLE II: Performance comparison on locomotion tasks (Success Rate / 10). Ours outperforms all baseline RL and model-based algorithms.
Fig. 7 : We evaluated the success rates of our method and Others on basic expert skills over 500k training iterations. For each task, ten independent trials were conducted. A trial was considered successful if the agent did not fall within a 30‑second episode and complete the task. The results demonstrate that after 500k steps, our method achieves a significantly higher success rate than Others. This confirms the robustness and reliability of our expert‑policy learning in these locomotion tasks.
Fig. 8 : The effectiveness of each ablated method on the door-opening task is illustrated in this figure.
Method
Suceess
steps(w)
return
TD-MPC2 [ 7 ]
✓
32.38
198.42
w/o Router
✓
20.36
296.57
w/o VLM
×
NULL
NULL
w/o IL
×
∞
193.61
Full Model
✓
12.64
303.95
TABLE III : Among the ablated variants, the model without Imitation Learning (IL) exhibits poor performance, primarily due to its incompatibility with our subsequent training and adaptation pipeline. Meanwhile, the without Vision-Language Model (VLM) configuration is not trained, as we aim to directly employ a rule-based router to achieve zero-shot compositional generalization without semantic guidance.
Fig. 9 : This figure illustrates a performance comparison between Ours and several baselines across various manipulation tasks. The plot includes a ”Reward Switcher” curve, which indicates the specific reference expert policy being utilized for reinforcement learning at each stage of the training process.
Task
Router (M)
PPO [ 28 ]
SAC [ 29 ]
TD-MPC2 [ 7 ]
DreamerV3 [ 8 ]
Ours
Door
0.17(S) → 0.74(W) → 2.0(R)
58.0±13.5
168.7±3.9
285.0±12.0
257.7±37.9
470.0±2.2
Basketball
0.87(S) → 2.0(R)
58.0±1.3
45.4±5.5
148.4±3.3
77.6±1.2
250.0±11.9
Push
1.09(S) → 2.0(R)
36.8±11.0
−201.3±13.6
−113.8±6.8
−59.9±7.3
70.0±2.1
Truck
0.57(S) → 1.61(W) → 2.0(R)
58.0±13.5
1142.6±15.8
1213.2±1.1
1383.4±2.5
1500.0±15.6
Package
0.51(S) → 2.0(R)
−8112.3±191.1
−6662.1±137.2
−6788.5±552.7
−5817.2±903.8
−5200.0±47.2
TABLE IV : Performance comparison on manipulation tasks. Routing schedules are indicated in Million steps (M) under each task, where S , W , and R denote Stand , Walk , and Reach reference stages, respectively.
Department of Computer Science, University of Manchester, Manchester, UK · Human-Robot Interfaces and Interaction Laboratory, Italian Institute of Technology, Genoa, Italy