MPC Controller
Advanced
Ejecutar el ejemplo en vivo
Gratis · sin registro · funciona en tu navegador
El bloque MPCController es un controlador predictivo basado en modelo (MPC) de tiempo discreto para sistemas lineales en el espacio de estados. En cada paso de simulación, resuelve un problema de programación cuadrática (QP) con restricciones sobre un horizonte de predicción finito utilizando un método de punto interior primal-dual predictor-corrector de Mehrotra, aplicando la primera acción de control calculada .
A diferencia de un LQR no restringido, el MPC respeta explícitamente los límites del actuador () y los límites de estado (). Si la matriz de coste terminal se deja vacía, el bloque calcula la solución estabilizadora de la ecuación algebraica de Riccati en tiempo discreto (DARE).
Entradas y Salidas
| Direction | ID | Label | Tipo | 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 |
Parámetros
| Parámetros | Label | Tipo | Por defecto | Descripción |
|---|---|---|---|---|
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. |
Observaciones y Buenas Prácticas
- Warm-Starting: La trayectoria óptima se desplaza y almacena en caché entre pasos, acelerando la convergencia del solver QP Mehrotra a solo 2-3 iteraciones.
- Restricciones blandas: Las restricciones de estado se suavizan mediante variables de holgura (slacks) para evitar infactibilidad por perturbaciones externas.