Skip to content
Technology How it works Breeder — Hyperion Burner — Aegis Burner — MetroVolt AI-Native Architecture Magnets Fuel cycle Safety Roadmap
Solutions AI & Data Centers Defense & Government Grid & Baseload Neutron Detection Quantum
Learn Technical Library
Proof Publications Whitepapers Technical Library Open Science & Reproducibility The Honest Gates
Company About / Mission Leadership Environment Health & Safety Investors Careers Press Contact
3D Model
AI Architecture › Mathematical Foundations
Mathematical Foundations

The Linear-Quadratic Regulator Baseline

LQR is the unconstrained closed-form limit of MPC; its Riccati solution is the baseline gain and the terminal cost that makes MPC provably stable.

STRATEGY / SLOW ▲ ▼ MICROSECOND REAL-TIMEL7Ecosystem & Strategytelemetry ▲ control ▼open ▸L6Experience & Visualizationtelemetry ▲ control ▼open ▸L5Applications & Copilotstelemetry ▲ control ▼open ▸L4Orchestrationtelemetry ▲ control ▼open ▸L3Twin Modeling & AItelemetry ▲ control ▼open ▸L2Data Fabrictelemetry ▲ control ▼open ▸L1Control Planetelemetry ▲ control ▼open ▸L0Foundationtelemetry ▲ control ▼open ▸PHYSICAL S.M.A.R.T. GENERATOR PLANTBREEDER · HYPERION1R0 1.2 m · A 2.5 · 16.84 T · δ −0.30BURNER · TANDEM MIRROR2317 T throat · 26.49 T plug · fₙ 5.44% · DEC1 center stack + plasma · 2 high-field plug · 3 expander → direct converterCOLOR GRAMMAR strategy AI-workflow infra/data models reactor/DECLINE SEMANTICStelemetry (µs)controlKRONOS FUSION ENERGYAI-NATIVE S.M.A.R.T. GENERATORMASTER BLUEPRINTSHEET 01REV. 2026-08L0-L7 · 2 MACHINES
The AI-Native S.M.A.R.T. Generator Master Blueprint — eight layers (L0→L7), one control stack, wired to both machines. Telemetry rises in microseconds; control descends the same path.

The clean special case

Strip constraints and use an infinite horizon with a linear model and quadratic cost, and MPC collapses to the linear-quadratic regulator (LQR), which has a closed-form optimal feedback gain. LQR is both the fast inner-loop baseline (e.g. vertical stabilization) and the source of the terminal cost that certifies constrained MPC stability.

text
LQR problem (infinite horizon):

  min  sum_{k=0}^inf  x_k' Q x_k + u_k' R u_k
  s.t. x_{k+1} = A x_k + B u_k

  Optimal feedback:  u_k = -K x_k
  K = (R + B' P B)^-1 B' P A

  P solves the discrete algebraic Riccati equation (DARE):
  P = A'P A - A'P B (R + B'P B)^-1 B'P A + Q

The Riccati solution

The matrix P solving the algebraic Riccati equation is the cost-to-go: x' P x is the optimal cost from state x under LQR. It yields the stabilizing gain K and, reused as the MPC terminal weight, guarantees that the finite-horizon plan behaves well beyond the horizon. Existence of a stabilizing P requires the pair (A,B) controllable and (A,Q^1/2) observable.

python
# LQR gain via the discrete Riccati equation
from scipy.linalg import solve_discrete_are
P = solve_discrete_are(A, B, Q, R)
K = inv(R + B.T@P@B) @ (B.T@P@A)
# u = -K x  stabilizes; x'Px is the optimal cost-to-go
eig_cl = eigvals(A - B@K)          # all inside unit circle

Where LQR is used directly

For fast, near-linear loops that rarely hit constraints - vertical position, resistive-wall-mode feedback - LQR runs directly at high bandwidth because it is a single matrix multiply. MPC takes over where constraints bind or targets change: shape control at delta -0.30, plug-density regulation. The two are co-designed so LQR's authority and MPC's plans do not conflict over shared actuators.

LQR is the mathematical anchor of the control layer: fast where it suffices, and the certificate that the constrained planner inherits its stability from.

Content reviewed August 2026 · design-and-simulation stage