Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm
计算机与自动化|Updated:2022-08-31
|
Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm
Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm
信息与电子工程前沿(英文)2011年12卷第11期 页码:919-931
Affiliations:
State Key Lab of Industrial Control Technology, Institute of Industrial Control, Department of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm[J]. 信息与电子工程前沿(英文), 2011,12(11):919-931.
Jiao-na WAN, Zhi-jiang SHAO, Ke-xin WANG, et al. Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(11): 919-931.
Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm[J]. 信息与电子工程前沿(英文), 2011,12(11):919-931. DOI: 10.1631/jzus.C10a0512.
Jiao-na WAN, Zhi-jiang SHAO, Ke-xin WANG, et al. Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm[J]. Frontiers of Information Technology & Electronic Engineering, 2011, 12(11): 919-931. DOI: 10.1631/jzus.C10a0512.
Reduced precision solution criteria for nonlinear model predictive control with the feasibility-perturbed sequential quadratic programming algorithm
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.
关键词
Keywords
references
The trial reading is over, you can activate your VIP account to continue reading.
Wiener model identification and nonlinear model predictive control of a pH neutralization process based on Laguerre filters and least squares support vector machines
相关作者
Qing-chao WANG
Jian-zhong ZHANG
相关机构
School of Energy Science and Engineering, Harbin Institute of Technology