VFlash: Can Parallel VLM Planning Deliver Real-Time Robot Control?.

VFlash: Fast, Accurate Visual Planning via Flash Primitive Decoding • Yu-Cheng Chou, Shihao Wang, Jin Huang et al. • NVIDIA, Johns Hopkins, Hong Kong Polytechnic, Purdue, and HKU • arXiv • 2026.

Cold Open.

Imagine asking a robot to lift a mug and place it on a shelf. Before the controller moves, a vision-language model writes a gripper trajectory. It emits a coordinate token, runs again, emits another, and continues through the remaining waypoints. The answer is geometry. The computation resembles a chatbot finishing a sentence.

Now imagine specifying the answer’s structure beforehand: how many waypoints you want, which coordinates describe each point, and where the trajectory ends. Why should producing that object require so many sequential neural-network calls?.

That is the tension behind VFlash. NVIDIA’s researchers propose generating complete geometric primitives in parallel, and report that the resulting trajectory predictions can outperform the autoregressive model supplying their context.

The interesting question is how those two outcomes fit together. Why would a smaller prediction module produce better geometry while doing less sequential work? Answering that requires looking at what the decoder is actually trained to reproduce.

The Idea.

Start with the planning architecture. HAMSTER established a useful pattern: a high-level VLM predicts an image-space path, and a separate, geometry-aware policy turns that guidance into robot actions. Its training separates broad visual and semantic understanding from precise execution. That makes an intermediate trajectory a meaningful interface between two learning problems, rather than merely a visualization of the policy’s intentions.

VFlash addresses how to generate such intermediate geometry efficiently. Its decoding ancestry comes from DFlash, which uses a lightweight diffusion-style model to propose several tokens simultaneously. The large target model supplies internal context features and verifies the proposal. In ordinary speculative decoding, the objective is to reproduce the target model’s output while requiring fewer sequential calls to it. Exact agreement determines how much proposed text survives verification.

That contract makes the target an oracle: the smaller model succeeds by anticipating what the larger model would say. For geometry, consider a different contract. Suppose two predictions place a waypoint in neighboring coordinate bins. Token identity treats them as different answers. A spatial metric asks how far each point lies from the demonstrated trajectory. Those are different definitions of correctness.

VFlash’s main robot VLM combines Qwen3-4B with a MoonViT image encoder. Task-adapted targets are frozen before training a five-layer bidirectional drafter. Robot training draws on MolmoBot, AgiBot, InternA1, OXE-Trace, and DROID. The drafter receives coordinate annotations as supervision, using token cross-entropy rather than learning to reproduce the target’s generated continuation.

The central mechanism is Flash Primitive Decoding. A tool call declares the requested length, while the primitive type determines the layout. Dedicated coordinate tokens or fixed-width numeric fields give each output position a stable role. The drafter fills the complete primitive in parallel. Length is therefore fixed for an individual request, while the framework supports different requested lengths.

Think of this as filling a typed form. Before any values are predicted, the form already distinguishes the horizontal coordinate of the first waypoint from the depth coordinate of the last. The network supplies the values. It does not need to spend sequential decoding steps establishing the meaning of every successive position.

The accepted plan then passes through the target VLM to produce features for the downstream action model. Ordinary text retains speculative verification; bounding boxes additionally use a confidence-based autoregressive fallback. The single-pass operation belongs to primitive drafting inside this larger pipeline.

LocateAnything provides another important precedent. Its open implementation treats a bounding box as an atomic prediction unit, generating its coordinates together and using a hybrid inference path. VFlash’s extension brings that structural idea to richer visual plans and variable-length trajectories.

The conceptual move is to separate representation quality from output imitation. A pretrained model can supply useful visual-language features without its own sequential coordinate predictions becoming the quality ceiling. The smaller decoder gets a narrowly defined job and supervision aligned with that job. That is a much more interesting proposition than simply asking a smaller network to impersonate a larger one.

The Result.

The headline number is 5.1× lower model-pipeline latency on Jetson Thor for the MolmoSpaces manipulation pipeline. The measurements cover vision processing, prompt processing, decoding, and action prediction, using a customized TensorRT-Edge-LLM runtime. DGX Spark shows a similar overall improvement.

Why emphasize the pipeline rather than the more spectacular decoding-only headline? Because that is the useful unit for an engineer deciding where to invest optimization effort. Making one operation dramatically faster matters most when it occupies a large fraction of the original computation. Here, removing sequential coordinate generation changes the balance of the inference workload.

There is also a representation result, and it changes the story from acceleration to control quality.

MolmoSpaces is Ai2’s physics-based environment and benchmark ecosystem. It includes manipulation tasks involving picking, placing, opening, and closing, with a simulated Franka platform and systematically varied scenes and objects. Its contact simulation and articulated assets make it a substantive test of manipulation policies across different geometries.

In VFlash’s experiment, replacing the world action model’s native text conditioning with visual-plan features improves average success by 7.6 percentage points. The ablations retain the action-model architecture and training budget. Both autoregressively generated plans and image-plus-subtask conditioning perform worse than the full VFlash plan-conditioning configuration.

That ablation is the informative part. A language-conditioned controller could benefit simply from receiving a better subtask description. A new vision-language backbone could also provide stronger scene features. Comparing those alternatives helps identify what the explicit trajectory contributes. The reported ordering supports treating geometry as useful information for execution, rather than decorative output attached to an otherwise unchanged decision.

Separate open-loop tests on InternA1, AgiBot, and MolmoBot also improve the reported 3D trajectory metrics against matched autoregressive decoding.

These measurements answer complementary questions. Waypoint errors assess the spatial prediction itself. Manipulation success assesses whether the downstream controller can use the resulting representation. Hardware profiling measures the cost of producing it.

For a practitioner, that combination is valuable. A faster intermediate representation deserves attention when it also helps the next component do its job. The experiment therefore motivates a concrete architectural choice: preserve explicit visual planning, and make its production a specialized parallel operation.

It also changes what a good decoder means. The useful output is the plan that supports successful behavior, not necessarily the coordinate sequence that the original language-model head would have produced.

The Biggest Weakness.

The central weakness is that speed and control quality are not tested together in a continuously advancing physical loop.

In the main MolmoSpaces evaluation, the simulator stops while inference runs. Hardware latency is profiled separately. The success results therefore test plan-conditioned control without making the environment evolve during the model’s computation.

That distinction directly affects the real-time deployment thesis. Imagine the mug moving after the camera frame is captured. A faster planner might deliver a useful correction sooner. Alternatively, the execution schedule might continue following an older action chunk, delaying the benefit of the new plan. A paused environment cannot distinguish those situations.

There is a second clock beyond neural inference: when the robot can actually incorporate a new decision. Observation timing, action-chunk execution, and replanning interact. The relevant question is how old the information is when it changes the robot’s behavior.

Physical Intelligence’s Real-Time Chunking work makes this interaction explicit. It generates a new action chunk while the previous one executes, conditions the transition on actions already committed, and evaluates robustness to inference delays in dynamic simulation and real bimanual tasks. That is a useful methodological reference because computation time participates in the control problem itself.

The decisive VFlash experiment would couple those clocks. Run matched policies with the same execution schedule while the scene continues moving, then vary inference delay or introduce controlled perturbations. Measure recovery time and task completion alongside success.

That test would reveal whether the computational saving changes behavior when timing matters. The present results establish faster model computation and better plan-conditioned manipulation under the reported protocol. Calling the combination a demonstrated physical reflex goes beyond what that protocol measures.

Verdict.

VFlash deserves the attention of teams building hierarchical robot policies: systems where a generalist visual-language component produces guidance for a specialized action model.

The architectural opportunity is an explicit interface that can be optimized independently. A planning module can learn spatial intent from broad data, while an execution module concentrates on the robot’s action space and dynamics. HAMSTER demonstrated the value of that division for cross-domain learning; VFlash makes efficient generation of the intermediate representation a first-class design problem.

There is a useful parallel with OpenVLA-OFT. That work combines parallel decoding, action chunking, continuous action representations, and a regression objective to improve policy speed and performance. Its prediction unit is a chunk of robot actions. VFlash places its parallel prediction unit at the visual-planning interface. These approaches highlight distinct places in a robotics stack where the output structure can guide computation.

For inference engineers, the broader lesson is to look beyond faster execution of an unchanged token-generation loop. The choice of what constitutes one prediction can be an architectural optimization. A complete box, path, or action chunk gives the runtime a different unit of work from an arbitrary window of text tokens.

For learning researchers, the compelling question is what a frozen model already represents. A specialized readout can exploit those representations under a different supervision target. The large model’s own output head need not be the only way to turn its features into a useful answer. DFlash’s feature-conditioned drafting and LocateAnything’s geometric prediction units supply concrete ingredients for that research direction.

My take is straightforward: VFlash makes a strong case for designing decoding around the structure of the robot’s intermediate plans.

The practical takeaway is equally direct: keep the broad visual understanding, and specialize the production of geometry. That is a reusable systems idea with implications beyond any one manipulation benchmark.

Outro.

Watch whether typed geometric predictions become a standard interface between generalist perception and specialized action models.

The memorable question from VFlash is simple: when we already know the structure of an answer, how much sequential generation should producing it require?.

That question applies whenever an embodied system exchanges a path, a pose, a box, or a structured forecast. It encourages us to examine the representation boundary itself, rather than treating decoding as an implementation detail inherited from language modeling.

This is Embodied AI 101. The next improvement in robot intelligence may begin with choosing a better unit of prediction.