Price-driven coordination method for solving plant-wide MPC problems
✍ Scribed by R. Cheng; J.F. Forbes; W.S. Yip
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 324 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0959-1524
No coin nor oath required. For personal study only.
✦ Synopsis
In large-scale model predictive control (MPC) applications, such as plant-wide control, two possible approaches to MPC implementation are centralized and decentralized MPC schemes. These represent the two extremes in the ''trade-off'' among the desired characteristics of an industrial MPC system, namely accuracy, reliability and maintainability. To achieve optimal plant operations, coordination of decentralized MPC controllers has been identified as both an opportunity and a challenge. Typically, plant-wide MPC problem can be formulated as a large-scale quadratic program (QP) with linking equality constraints. Such problems can be decomposed and solved with the price-driven coordination method and on-line solutions of these structured large-scale optimization problems require an efficient price-adjustment strategy to find an ''equilibrium price''. This work develops an efficient price-adjustment algorithm based on Newton's method, in which sensitivity analysis and active set change identification techniques are employed. With the off-diagonal element abstraction technique and the enhanced priced driven coordination algorithm, a coordinated, decentralized MPC framework is proposed. Several case studies show that the proposed coordination-based decentralized MPC scheme is an effective approach to plant-wide MPC applications, which provides a high degree of reliability and accuracy at a reasonable computational load.