The Closed-Form Control Laws of the Constrained Model Predictive Control Algorithm
MetadataShow full item record
The Analysis of quadratic Stability and strongly Hperformance of Model Predictive Control (MPC) with hard constraints (or called Constrained Model Predictive Control (CMPC)) can be accomplished by reformulating the hard constraints of CMPC. From the CMPC algorithm, each term of the closed-form of CMPC control law corresponding to an active constraint situation can be decomposed to have an uncertainty block, which is time varying over the control period. The control law also contains a bias from the bounds of the constraints which cause difficulty in stability and performance analysis. An alternative way to avoid this difficulty is to reformulate the hard constraints to adjustable constraints with time varying adjustable weights on the adjustable variables added to the on-line objective function. The time varying weights in the adjustable constraint control law make the control action just the same as the hard constrained control. Theoretical derivatives and examples are given. The same reformulation is applied to the softened constraint cases.<P>On the analysis of the quadratic stability and strongly H performance, the control system for hard constraint control law without bias satisfies the stability and performance criteria if and only if the control system for adjustable constraint control law with time varying adjustable weights satisfies the same criteria. The details will be shown in the technical reports on quadratic stability and strongly Hperformance analysis, which are in preparation.