.png){kind=icon}
.png){kind=icon}
Return
Fast distributed MPC based on active set method
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compchemeng.2014.08.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Modern chemical plants are characterized by their large-scale, strong interactions and the presence of constraints. With its ability to systematically handle these issues, distributed model predictive control (DMPC) is a promising approach for the control of such systems. However, the problem of how to efficiently solve the resulting distributed optimization problem is still an open question. This paper develops a novel fast DMPC approach based on a distributed active set method and offline inversion of the Hessian matrix to efficiently solve a constrained distributed quadratic program. A dual-mode optimization strategy based on the value of unconstrained optimal solution is developed to accelerate the computation of control action. The proposed method allows for the optimization to be terminated before convergence to cope with the fast sampling periods. Furthermore, a warm-start strategy based on the solution of the previous sampling instant is integrated with the approach to further improve convergence speed. The approach is highly parallelized as constraints can be checked in parallel. The approach is demonstrated using an academic example as well as a chemical process network control. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Distributed model predictive control
Parallel computing
Fast MPC
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
3.9
Papers:
8.1K
Citations:
1.7W