Simulation studies on online constraint removal with a Lyapunov function
classification
🧮 math.OC
keywords
constraintcontrolremovalaccelerationapplycombiningcomparecomputational
read the original abstract
We apply a recently proposed method for the acceleration of model predictive control (MPC) to 36 MPC implementations, which result from combining six sample receding horizon control problems with six quadratic programming solvers. We implement each of the 36 system-solver-combinations both with and without constraint removal and compare computational times for statistically relevant numbers of runs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.