3.5.25 · D1Guidance, Navigation & Control (GNC)

Foundations — Unscented Kalman Filter (UKF) — sigma points, better for nonlinear

2,149 words10 min readBack to topic

Before you can read a single line of the parent note, you need a vocabulary. This page builds every symbol it uses, starting from a smart-but-blank slate. Nothing here assumes you've seen probability, matrices, or filters before.


1. What is a "state"? The symbol

Picture it: a single point floating in a room. If the room has directions you can move, the point needs numbers to pin it down.

Why the topic needs it: the entire filter's job is to keep a good estimate of over time. Everything else — noise, covariance, sigma points — exists only to answer "where is , really?"

  • ::: the number of entries in , called the dimension. A 2D position → .
  • (read "x-bar") ::: our single best guess for — the average, the center of the cloud.
  • (read "x-hat") ::: the filter's estimate of . The little hat means "estimated, not the true value."

2. Uncertainty is a cloud, not a point

We never know exactly. Our knowledge is really a fuzzy cloud of possibilities centered on .

Figure — Unscented Kalman Filter (UKF) — sigma points, better for nonlinear

The bell-shaped fuzziness above is the Gaussian (or "normal") distribution. It is the single most common way to describe "roughly here, give or take."

  • Gaussian ::: shorthand for "a bell-shaped cloud centered at with spread ." Build on Nonlinear Systems later; here just picture the haze.

3. Measuring the spread: variance and covariance

How do we put a number on "how wide is the haze"?

Picture it: is the radius of the haze in 1D — one step out from the middle catches most (about ) of the cloud.

But a state has many directions, and uncertainty can be wide in one direction, narrow in another, and tilted. One number won't do.

Figure — Unscented Kalman Filter (UKF) — sigma points, better for nonlinear

Why the topic needs it: the UKF's slogan is "push the distribution, not the function." The distribution is — a center and an ellipse. Everything downstream is about transforming this ellipse.

  • ::: covariance = the uncertainty ellipse of the state.
  • ::: the covariance of the output after we transform.
  • ::: extra uncertainty added each step because the physics itself is imperfect (process noise).
  • ::: uncertainty in the sensor readings (measurement noise).
  • (read "A-transpose") ::: flip a matrix across its diagonal; turns a column into a row. Needed because is how you build a covariance from a single offset — an outer product that produces a full grid, not one number.

4. The nonlinear map: , , and why "nonlinear" hurts

Figure — Unscented Kalman Filter (UKF) — sigma points, better for nonlinear

Why the topic needs it: the UKF exists only because and curve. If they were straight, the plain Kalman Filter (linear) would already be perfect.


5. The tool the EKF leans on: the derivative and Taylor series

To straighten a curve, the EKF uses calculus.

Why the topic needs it (as a foil): you must understand the Jacobian to appreciate the punchline — the UKF never computes one. Where has no clean derivative (e.g. at the origin), the EKF stalls and the UKF sails on.


6. The matrix square root: and Cholesky

The UKF places its sample points along the shape of the ellipse . To step "one ellipse-radius" in each direction, it needs a matrix square root.

Picture it: for a 1D variance , the square root is just — one standard-deviation step. In dimensions, generalizes "" into the tilted, stretched directions of the ellipse.

Why the topic needs it: the sigma-point formula literally cannot be written without a matrix square root. Its columns are the arrows pointing along each principal axis of the uncertainty ellipse.


7. The stars of the show: sigma points, weights, Greek tuning knobs

  • (calligraphic X, read "curly-X sub i") ::: the -th sigma point (an input sample).
  • ::: that point after being pushed through : .
  • ::: a sigma point pushed through the measurement model .
  • ::: the mean weight of point — how much it counts when averaging to find .
  • ::: the covariance weight of point — how much it counts when building the spread . Differs from only at the center point.

The Greek knobs that decide how far out the points sit and how the weights are set:

  • (lambda) ::: a scaling number, , setting the reach of the points.
  • (alpha) ::: small (e.g. ); controls the spread — small keeps points hugging the mean.
  • (kappa) ::: a secondary scaling number, usually or .
  • (beta) ::: injects prior knowledge of the cloud's shape; is best for a Gaussian.

Why the topic needs them: these seven symbols are the Unscented Transform. Master this list and the parent's boxed formulas read like plain sentences.


8. How it all connects

State vector x and dimension n

Uncertainty cloud mean x-bar

Variance sigma-squared

Covariance matrix P ellipse

Matrix square root via Cholesky

Nonlinear maps f and h

Sigma points curly-X

Weights and tuning alpha beta kappa lambda

Unscented Transform

Derivative and Jacobian EKF foil

Unscented Kalman Filter

Read it top to bottom: a state carries an uncertainty ellipse (); its square root places sigma points, weighted by the Greek knobs; pushing them through the nonlinear maps is the Unscented Transform, which the filter runs each cycle — sidestepping the Jacobian the EKF needs.


Equipment checklist

Self-test: can you answer each before revealing?

What does mean and how does it differ from ?
is the mean/best guess of the true state; is the filter's estimate of it (the hat = "estimated"). Both name the center of the uncertainty cloud.
What is the covariance matrix , geometrically?
The uncertainty ellipse: diagonal = spread along each axis, off-diagonal = how axes lean together (tilt).
Why can't one variance number describe an -dimensional state's uncertainty?
Because uncertainty can be wide in one direction, narrow in another, and tilted — that needs a full grid (), not a single .
What is the difference between and ?
is the motion model (state → next state); is the measurement model (state → what a sensor would read).
What does "nonlinear" mean and why does it break the linear Kalman filter?
The map curves, so it bends a symmetric cloud into a lopsided one; the straight-line Kalman machinery gives the wrong mean and spread.
What is the Jacobian , and does the UKF compute it?
The grid of slopes (steepness) of at ; the EKF needs it, the UKF never computes it.
Why does the UKF need a matrix square root ?
To step exactly one "ellipse-radius" along each principal axis when placing sigma points.
How many sigma points are there and where do they sit?
: one at the center, one on each side along every axis of the ellipse.
Why are there two weight sets and ?
One for averaging to the mean, one for building the covariance; they differ only at the center point so Gaussian tuning () can be injected without shifting the mean.
What does control?
The spread of the sigma points around the mean — small keeps them close to .

Recall Quick recall

The UKF carries a cloud , samples it with sigma points along the axes of the ellipse , pushes each through the true nonlinear /, and reads off the new mean and covariance — no Jacobian, unlike the Extended Kalman Filter (EKF).