MPC Controller
AdvancedThe MPCController block is a discrete-time Model Predictive Controller for linear state-space systems. At every simulation step, it solves a constrained finite-horizon optimal control problem using an interior-point Quadratic Programming (QP) solver, and applies the first optimal control move to the actuator.
Where an LQR controller computes an unconstrained feedback law , MPC explicitly respects actuator limits () and state boundaries (). When the terminal cost is left empty, the block computes the infinite-horizon Discrete Algebraic Riccati Equation (DARE) solution, ensuring closed-loop stability even with finite prediction horizons.
Wire each plant state to the inputs (in1, in2, ...) in the order of ; up to six states. When reference tracking is enabled, provide setpoints to (in7, in8, ...) to track nonzero references.
Mathematical Model
The controller models the plant as a discrete-time linear state-space system:
At step , given current state , the block solves the quadratic program over prediction horizon :
Subject to:
The terminal cost matrix satisfies the discrete algebraic Riccati equation:
The first element is emitted on output port out at each time step (receding horizon control).
Inputs & Outputs
| Direction | ID | Label | Type | Status |
|---|---|---|---|---|
| → In | in1 |
x₀ | number | Required |
| → In | in2 |
x₁ | number | Optional |
| → In | in3 |
x₂ | number | Optional |
| → In | in4 |
x₃ | number | Optional |
| → In | in5 |
x₄ | number | Optional |
| → In | in6 |
x₅ | number | Optional |
| → In | in7 |
r₀ | number | Optional |
| → In | in8 |
r₁ | number | Optional |
| → In | in9 |
r₂ | number | Optional |
| → In | in10 |
r₃ | number | Optional |
| → In | in11 |
r₄ | number | Optional |
| → In | in12 |
r₅ | number | Optional |
| ← Out | out |
u | number | Output |
| ← Out | valid |
Valid | number | Output |
| ← Out | status |
Status | number | Output |
| ← Out | iterations |
Iterations | number | Output |
| ← Out | cost |
Cost | number | Output |
Parameters
| Parameters | Label | Type | Default | Description |
|---|---|---|---|---|
nx |
Number of States (nₓ) | number | 2 |
Number of states in the model (1-6). Determines how many x inputs are used. |
horizon |
Prediction Horizon (N) | number | 10 |
Number of steps to predict. Longer horizon → better performance but more computation. |
A |
A (nₓ×nₓ) | matrix | 1 0.1; 0 1 |
State transition matrix. Rows separated by ';'. Example: '1 dt; 0 1' for double integrator with dt=0.1 |
B |
B (nₓ×1) | matrix | 0.005; 0.1 |
Input matrix. One entry per state. Example: 'dt²/2; dt' for double integrator |
sampleTime |
Sample Time | number | 0.1 |
|
Q |
Q (nₓ×nₓ) | matrix | 10 0; 0 1 |
State cost matrix. Diagonal entries penalize state deviations. Larger = faster settling. |
R |
R (1×1) | matrix | 1 |
Input cost weight. Larger R = gentler control effort. Must be positive. |
P |
Terminal Cost P (nₓ×nₓ) | matrix | |
Optional terminal cost. If empty, computed automatically from DARE (infinite-horizon LQR cost-to-go). |
uMin |
Input Min | number | -100 |
Lower bound on control input u |
uMax |
Input Max | number | 100 |
Upper bound on control input u |
xMin |
State Min (per state) | matrix | |
Optional lower bounds on states (1×nₓ matrix). Leave empty to disable state constraints. |
xMax |
State Max (per state) | matrix | |
Optional upper bounds on states (1×nₓ matrix). Leave empty to disable state constraints. |
slackWeight |
State Slack Weight | number | 10000 |
Penalty weight for soft state constraints. Values > 0 guarantee solver feasibility under disturbances. Set to 0 for hard constraints. |
reference |
Enable Reference Tracking | boolean | false |
When enabled, ref0..ref(n-1) inputs are used for offset-free tracking. The controller regulates the deviation from reference. |
Usage Examples
Basic MPCController: Constrained Double Integrator
A cart positioning system (, ) with sample time has actuator limits . Starting with an initial displacement of , the MPC controller drives the state to the origin while strictly clamping the motor force within .
Constrained Thermal Chamber Setpoint Tracking
A temperature regulation process where heater power is strictly bounded and states must track an elevated temperature setpoint with zero overshoot while respecting thermal slew rate constraints.
Remarks & Best Practices
- Tuning: Start with diagonal , , and prediction horizon . Increasing expands the feasible region and improves tracking, but increases per-step QP solve time.
- Constraints: Actuator bounds and are hard constraints enforced at every step of the prediction horizon. State constraints (, ) are softened using slack variables with quadratic weight
slackWeight(default ), guaranteeing solver feasibility even when external disturbances push states beyond the boundaries. SetslackWeightto 0 for strict hard constraints. - Warm Starting: The optimal control trajectory is automatically shifted forward and cached across simulation steps, accelerating interior-point QP convergence from ~8 to ~2-3 iterations per step.
- Terminal Cost: Leaving empty automatically computes the stabilizing infinite-horizon DARE solution, ensuring stability for asymptotically controllable systems.
- Computation: Solved at each time step via a Mehrotra predictor-corrector primal-dual interior-point algorithm in Rust/WASM.
Related Components
- LQRController" class="bw-link">LQRController
- DiscreteStateSpace" class="bw-link">DiscreteStateSpace
- Saturation" class="bw-link">Saturation
- KalmanFilter" class="bw-link">KalmanFilter