diff --git a/lqr.html b/lqr.html index 760cb7f1..32c7414f 100644 --- a/lqr.html +++ b/lqr.html @@ -531,7 +531,7 @@
A natural extension for linear optimal control is the consideration of strict constraints on the inputs or state trajectory. Most common are linear inequality constraints, such as $\forall n, |\bu[n]| \le 1$ or @@ -548,18 +548,6 @@
We do actually understand what the optimal policy of the
- inequality-constrained LQR problem looks like, thanks to work on
- "explicit MPC"
We do actually understand what the optimal policy of the
+ inequality-constrained LQR problem looks like, thanks to work on
+ "explicit MPC"