Number 10 of 12 · November 10, 2026

The World Model Planning Accelerator (WMPA): Hardware-Algorithm Co-Design for Embedded AI in Robotics

The authors argue that robot planning with world models wastes huge amounts of energy on current GPUs, and they propose a chip design that, in simulation, cuts power enough to keep a small tile cool.

What they found

The authors derive lower bounds on the arithmetic and the CMOS dynamic energy (the energy of standard chip switching) needed for one step of a world model's latent prediction. They profile a DreamerV3-style Recurrent State Space Model (RSSM) and find that every rollout operation is limited by memory bandwidth. They report that a GPU uses at least 5.9×10¹⁰ times the CMOS energy floor. In thermal simulations, sustained back-to-back planning heats a millimeter-scale silicon tile to 556 K, even with an ideal copper heat spreader. They propose the World Model Planning Accelerator (WMPA) chip design. With a design target of 40x lower power, the same tile stays near ambient at 306 K in simulation.

Why it matters

Robots that plan by imagining outcomes must run those predictions on board, with limited power and heat. This paper tries to measure how far real hardware is from the physical minimum and to trace that gap to a specific bottleneck. The design ideas include near-memory computation, real-time entropy estimation, variable-precision rollout units, and copy-on-write latent scratchpads. The abstract reports simulation only. It does not describe a built chip or real robot tests.

How it changes the race

If the results hold, they point to a way to run world-model planning on small, heat-limited robots without large GPUs. This is a hardware design proposal backed by simulation, so any effect on the race is early and indirect.

The abstract, by the authors

Embedded AI is moving from perception to prediction. Robots now use world modelsunicodex2014learned simulators that predict the outcome of candidate actions in a compressed latent space before any is executed. Every predicted step must be computed on board within a tight power and thermal budget, yet the energy these steps fundamentally require, and how far real hardware sits from it, have not been characterized. We derive lower bounds on the arithmetic operations and the CMOS dynamic energy of a latent state transition from information theory and Boolean circuit complexity. Profiling a DreamerV3-style Recurrent State Space Model (RSSM) shows that every rollout operation is memory-bandwidth bound and that a GPU consumes at least 5.9×10¹⁰ times the CMOS energy floor. Transient 3D thermal simulations show that this inefficiency is also a thermal one, since sustained back-to-back planning heats a millimeter-scale silicon tile to 556 K even behind an ideal copper heat spreader. Guided by this chain from bound to bottleneck, we propose the World Model Planning Accelerator (WMPA), a chip architecture for embedded world model planning that combines near-memory computation, real-time entropy estimation, variable-precision rollout units, and copy-on-write latent scratchpads. With a design target of 40x lower power, the same tile stays near ambient at 306 K in simulation, pointing toward practical planning on thermally constrained robots.

Quoted from arXiv:2611.10316. The research and its words belong to its authors.

The authors

Prerana Ramkumar, Suhas Suresh Bharadwaj, Fazal Hameed

Credit for this research belongs to its authors. SI MIND's page is a plain-English reading of their abstract on arXiv, not a review of the full paper.