Abstract

In this paper, a model predictive control (MPC) scheme based on Hammerstein model is carried on. The use of such nonlinear models complicates the implementation of the MPC in terms of computational time and burden since a nonlinear and so a nonconvex optimization problem will result. The Nelder Mead (NM) algorithm, as a free derivative method, is used to solve the resulting optimization problem. NM algorithm proves its efficiency in terms of computation time and global optimum seeking that can be successfully exploited especially with fast dynamic systems. A comparative study between the NM algorithm and the gradient-based method (GBM) based on computation time is established. The efficiency of the NM algorithm is illustrated with SISO and MIMO examples compared to GBM algorithm.

Full Text
Published version (Free)

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