Hydra: A Navigation World Action Model with Discrete Latent Planning and Continuous Flow-Matching Execution
- URL: http://arxiv.org/abs/2608.28995v1
- Date: Sat, 29 Aug 2026 01:58:19 GMT
- Title: Hydra: A Navigation World Action Model with Discrete Latent Planning and Continuous Flow-Matching Execution
- Abstract summary: World models let robots imagine possible futures, but exploiting this capability for real-time control is bottlenecked by a representation misalignment.<n>We present Hydra, a discrete World Action Model that closes this gap by moving the planner, both the sampler and the evaluator, inside the model.<n> Hydra outperforms state-of-the-art world models in goal-directed planning, while matching or exceeding the closed-loop execution capabilities of leading reactive foundation policies.
- Score: 51.519325778407016
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: World models let robots imagine possible futures, but exploiting this capability for real-time control is bottlenecked by a representation misalignment: the generative model and the planner operate on decoupled manifolds, so the planner has no shared structure to search over and must instead decode every candidate back into high-dimensional pixel space to evaluate it. This decoding step is a major obstacle to real-time control on physical hardware. In this paper, we present Hydra, a discrete World Action Model that closes this gap by moving the planner, both the sampler and the evaluator, inside the model. Hydra establishes a unified latent manifold over visual states, physical poses, and control actions, then compresses this manifold through modality-specific Vector-Quantized bottlenecks into discrete vocabularies of kinodynamic intents and visual states. Because candidates are now drawn directly from this shared manifold, sampling is informed by the model's own understanding of the observation rather than proposed blind, and evaluation happens natively within the discrete space: candidates are ranked by a Kinematic-Perceptual Cost, without ever decoding to pixels. We term this Discrete Latent Planning (DLP). Because planning over discrete intents alone cannot supply the smooth, continuous commands physical actuation requires, Hydra pairs DLP with conditional Flow Matching, which maps each selected intent to a continuous trajectory for execution. Evaluated on two physical robotic platforms, Hydra outperforms state-of-the-art world models in goal-directed planning, while matching or exceeding the closed-loop execution capabilities of leading reactive foundation policies.
Related papers
- SLIM-0.5B: Learning Action-Grounded Predictive Latents for Robot Manipulation [35.54319311306262]
We present SLIM, a compact latent interaction policy.<n>It learns representations through self-supervised masked trajectory prediction.<n>SLIM matches or exceeds representative large-scale VLA and world-action-model baselines with fewer parameters.
arXiv Detail & Related papers (2026-08-10T15:58:39Z) - VisualPatchWorld: Code World Models as Latent Structured Representations for Planning [8.39933163242427]
We introduce VisualPatchWorld (VPW), which represents world dynamics as code.<n>VPW first selects a qualitative dynamical form with short active probes, then fits that form's free parameters from recorded state-action traces.<n>VPW attains 69.0% mean planning success and exceeds the strongest code baseline by 23.5 points.
arXiv Detail & Related papers (2026-07-28T03:23:47Z) - KineBench: Benchmarking Embodied World Models via IDM-Free Kinematic Grounding [58.541098216700796]
evaluating the physical consistency of embodied world models is a critical open challenge.<n>Existing frameworks almost exclusively rely on Inverse Dynamics Models(IDMs) for action extraction.<n>We present KineBench, an IDM-free closed-loop benchmark for EWMs.
arXiv Detail & Related papers (2026-07-22T08:04:17Z) - Sensorimotor World Models: Perception for Action via Inverse Dynamics [59.121736411156384]
We introduce a sensorimotor world model trained end-to-end with inverse dynamics regularization.<n>It prevents representation collapse and induces action-aligned representations.<n>It learns compact, interpretable latent spaces and enables competitive planning performance across simple 2D and 3D control tasks.
arXiv Detail & Related papers (2026-06-18T11:25:16Z) - Lifting Embodied World Models for Planning and Control [59.09016913513998]
We train a lightweight policy that maps high-level actions to sequences of low-level joint actions.<n>We instantiate this framework for a human-like embodiment, defining the high-level action space as a small set of 2D waypoints.<n>We show that the lifted world model substantially outperforms searching directly in low-level joint space.
arXiv Detail & Related papers (2026-04-28T23:59:19Z) - Bench2Drive-R: Turning Real World Data into Reactive Closed-Loop Autonomous Driving Benchmark by Generative Model [63.336123527432136]
We introduce Bench2Drive-R, a generative framework that enables reactive closed-loop evaluation.<n>Unlike existing video generative models for autonomous driving, the proposed designs are tailored for interactive simulation.<n>We compare the generation quality of Bench2Drive-R with existing generative models and achieve state-of-the-art performance.
arXiv Detail & Related papers (2024-12-11T06:35:18Z) - TRiPOD: Human Trajectory and Pose Dynamics Forecasting in the Wild [77.59069361196404]
TRiPOD is a novel method for predicting body dynamics based on graph attentional networks.
To incorporate a real-world challenge, we learn an indicator representing whether an estimated body joint is visible/invisible at each frame.
Our evaluation shows that TRiPOD outperforms all prior work and state-of-the-art specifically designed for each of the trajectory and pose forecasting tasks.
arXiv Detail & Related papers (2021-04-08T20:01:00Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.