Lifting Embodied World Models for Planning and Control
TLDR
Proposes lifting embodied world models by training a policy to map high-level actions to low-level joint actions, improving planning efficiency.
Reasoning
The paper addresses high-dimensional action spaces in embodied world models by introducing a lightweight policy for action abstraction, showing significant performance gains. Strengths include a practical solution with interpretable waypoints and empirical validation; weaknesses include limited embodiment scope and lack of real-world experiments.
Read-first score
Read-first score 43.4, weighted from topical fit, citation, graph, method, reproducibility, and recency signals. Original total remains 29.
Field roles
Rank sensitivity
Stability: volatile; rank range: 231.
Keyword Scores
Deep Analysis
Innovations
- Lifted world model that predicts future observations from high-level actions via a lightweight policy composed with a frozen world model
- High-level action space defined as a small set of 2D waypoints on the current observation frame for leaf joints (pelvis, head, hands), which are low-dimensional and visually interpretable
- Demonstration that searching in high-level waypoint space substantially outperforms searching directly in low-level joint space (3.8× lower mean joint error) while being more compute-efficient and generalizing to unseen environments
Methodology
The authors train a lightweight policy that maps high-level actions (2D waypoints) to sequences of low-level joint actions. This policy is composed with a frozen world model to create a lifted world model that predicts future observations from a single high-level action. The framework is instantiated for a human-like embodiment, with high-level actions defined as near-term goal positions for leaf joints. Evaluation compares the lifted world model against direct search in low-level joint space using mean joint error to the goal pose.
Key Results
The lifted world model achieves a 3.8× lower mean joint error to the goal pose compared to searching directly in low-level joint space, while remaining more compute-efficient and generalizing to environments unseen by the policy.