You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
| Best | $O(n)$ | $O(n)$ | Linear sweep over $n+1$ ESO states |
61
+
| Average | $O(n)$ | $O(n)$ | Same; gains precomputed at construction |
62
+
| Worst | $O(n)$ | $O(n)$ | No branching in the hot path |
63
63
64
64
Gains are computed once at construction from closed-form binomial formulas in $O(n)$ time. The `Compute` hot path is a pair of $O(n)$ loops with no dynamic allocation.
|[Active Disturbance Rejection Control](ActiveDisturbanceRejection.md)| Near model-free controller pairing an Extended State Observer with bandwidth-parameterized PD feedback to estimate and cancel total disturbance in real time |
10
-
|[Sliding Mode Control](SlidingModeControl.md)| Variable-structure controller driving the state onto a sliding surface with a boundary layer to suppress chattering — robust to matched disturbances and parameter uncertainty |
|[Active Disturbance Rejection Control](ActiveDisturbanceRejection.md)| Near model-free controller pairing an Extended State Observer with bandwidth-parameterized PD feedback to estimate and cancel total disturbance in real time |
10
+
|[Sliding Mode Control](SlidingModeControl.md)| Variable-structure controller driving the state onto a sliding surface with a boundary layer to suppress chattering — robust to matched disturbances and parameter uncertainty |
0 commit comments