Abstract

This paper investigates how various caching strategies can reduce the computational effort of the active set method (ASM) applied to solve constrained model predictive control problems with quadratic objective function and linear constraints. Specifically, we show that during closed-loop operation, the active set method often re-visits the same combination of active constraints while searching for optimal control inputs by factoring Karush-Kuhn-Tucker (KKT) systems. By storing the factors of the corresponding KKT system in a cache, these repetitive

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call