Observations, Sensors, and Multimodal Data › Key Parameters

Michael BrenndoerferJune 13, 20262 min read
World Models HandbookAll chapters
Part 3 of 12Representing Agents and Worlds
Chapter 13Observations, Sensors, and Multimodal Data › Key Parameters
Reading section 8 of 11 · Key Parameters · 2 minSection 8 of 11 · 2 min

Book contents

Section 8 of 11 · 2 min read

Observations, Sensors, and Multimodal Data › Key ParametersOne section · Sections in this chapter8 / 11 ↓
Reading tools Definitions & inline links

Choose your expertise level to adjust how many terms are explained. Beginners see more tooltips, experts see fewer to maintain reading flow. Hover over underlined terms for instant definitions.

Article links

Make inline references clickable

The key parameters for the fusion example are:

  • dt: Base time step (0.01 s, the 100 Hz rate at which the encoder and filter run). It appears in FF, BB, and QQ, so changing it changes the dynamics, control mapping, uncertainty growth, and number of updates per physical second.
  • q_accel: Continuous white-acceleration spectral density (0.09 m2^2/s3^3). It scales QQ and therefore predicted covariance growth. Larger values generally make measurement updates more influential because prediction becomes less certain.
  • R_ENC: Encoder measurement noise variance (0.052^2 m2^2). Smaller values make the filter trust encoder updates more heavily.
  • R_CAM: Camera measurement noise variance (0.022^2 m2^2). The camera is 6.25 times as precise as the encoder when a frame is available. Relative sensor variances affect their weighting, but their absolute scale relative to QQ and the propagated covariance also matters. Scaling only the two RR values changes the Kalman gain; covariance-scale invariance would require scaling P0P_0, QQ, and all RR values together.
  • DELAY: Camera latency in base-rate steps (6 steps, 60 ms). Replay work per delayed frame and the minimum retained buffer grow linearly with this value. This teaching implementation retains the full TT-step state history and encoder-update array, so its actual memory use is O(T)O(T); a production implementation can prune entries older than the maximum supported delay.