Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm

We propose a novel kind of termination criteria, reduced precision solution (RPS) criteria, for solving optimal control problems (OCPs) in nonlinear model predictive control (NMPC), which should be solved quickly for new inputs to be applied in time. Computational delay, which may destroy the closed-loop stability, usually arises while non-convex and nonlinear OCPs are solved with differential equations as the constraints. Traditional termination criteria of optimization algorithms usually involve slow convergence in the solution procedure and waste computing resources. Considering the practical demand of solution precision, RPS criteria are developed to obtain good approximate solutions with less computational cost. These include some indices to judge the degree of convergence during the optimization procedure and can stop iterating in a timely way when there is no apparent improvement of the solution. To guarantee the feasibility of iterate for the solution procedure to be terminated early, the feasibility- perturbed sequential quadratic programming (FP-SQP) algorithm is used. Simulations on the reference tracking performance of a continuously stirred tank reactor (CSTR) show that the RPS criteria efficiently reduce computation time and the adverse effect of computational delay on closed-loop stability.