1. Introduction
Model predictive control (MPC) [
1,
2,
3], as it has the ability of dealing with multivariable constrained control problems, is widely used in the process industries. Since most models are only approximations of the actual processes, it is important to MPC to be robust, and this forms an important issue denoted as robust model predictive control (RMPC) [
4]. Some researches [
5] address the RMPC problem as a min-max optimization problem and it is formulated as linear matrix inequality (LMI) forms, but the heavy online computational burden restricts it to slow dynamic systems or small-scale processes.
In the last 20 years, reducing the high computation of RMPC has been a hot topic and most of the approaches have the common characteristics of moving most of the computational burden off-line. Examples of these strategies include explicit MPC scheme [
6], efficient MPC [
7,
8], polytopic approximations of exact controllable sets [
9,
10] and nested ellipsoids [
11,
12,
13,
14]. Via multi-parametric programming explicit MPC [
15,
16,
17,
18] can compute a solution with explicit form to the finite horizon MPC problem off-line. By focusing on the nested ellipsoids scheme, the corresponding nested ellipsoids and state-feedback gains are computed off-line. Online, at each sampling time the smallest ellipsoid containing the current state is chosen and the selected state-feedback gain is implemented [
11]. From the same philosophy this result is directly extended: the minimization of a nominal quadratic index replaces the worst-case optimization [
12] and for linear parameter varying systems a new type of off-line model predictive control strategy is presented [
19].
As we all know, an effective controller should be robust, have low online computation and minimal regulating time. Most of the aforementioned approaches can move much computational burden off-line, but few strategies have all three characteristics. In [
20], we developed a shrinking ellipsoids strategy for RMPC based on the idea of geometric proportion asymptotically stable ellipsoid (GPASE), but the strategy did not consider the state and output disturbance. In this article, we extended our strategy to the system with state and output disturbance. The main contributions of this paper are as follows: the first is nested geometric proportion asymptotically stable ellipsoids are designed based on LMI; the second is a scheme of RMPC for the uncertain discrete-time with state and output disturbance is designed, and the most important is the designed controller assures the smallest regulating time of the closed system. It is more robust than the previous strategy as it can deal with the state and output disturbance explicitly. Moreover, as the state can be shrunk into the smaller ellipsoid, the online computation has been almost reduced to zero.
The structure of the article is organized as follows. In
Section 2 the problem statement and early results are given. In
Section 3, the control strategy is proposed based on the designed nested GPASEs. A simulation example is presented in next section and the conclusion is drawn in the end.
Notation: The notation used is fairly standard. is the -dimensional space of real valued vectors. is the Euclidean norm for a vector . The matrix inequality and represent positive definiteness and positive semi-definiteness for square symmetric matrices and . is the predicted value at a future prediction time predicted at real time ; or is the measured or actual value of variable at real time ; denoting the convex hull; denotes the corresponding transpose of the lower block part of symmetric matrices.
2. Problem Statement
Consider the following uncertain discrete-time system:
where
and
are input, state, state disturbance and output measurement noise, respectively.
and
are shaping matrices, the disturbance satisfies
,
and satisfies
. When
, it is corresponding to the un-disturbance condition. Assume that
where
denotes the convex hull. In other words, if
then, for some nonnegative
summing to one, we have
Suppose the disturbance and the state satisfy the following equation:
Remark 1. In practice, the disturbance ought to be less than the state, so (4) is generally satisfied.
Problem 1: We aimed at synthesizing an RMPC by solving the following min-max problem at each time
:
where
.
Consider a quadratic function
. At every sampling time
, suppose the following inequality is satisfied:
As
, summing (6) from
to
, we get
Thus . Then the designed RMPC is redefined to synthesize a state-feedback control law to minimize the upper bound .
Theorem 1. The state-feedback matrixin the control lawat the sampling timeof Problem 1 is given by, whereandcan be obtained from the following problem’s solution:subject to: Proof. The proof of Equation (8) is the same as Theorem 1 and its proof is in the Appendix in paper [
5], and the proof of Equation (10) is the same as Equation (32) in paper [
5].
Substituting
and (1), inequality (6) becomes
with
Using the S-procedure, it is easy to see that (11) and (12) are satisfied if
such that
With the aid of the Sherman–Morrison–Woodbury formula
we can get
Pre-multiplying
, post-multiplying
, and using the Schur complement, Equation (13) is equivalent to
With Equation (15) it is equivalent to
Using the Schur complement again we can get
, which is affine in , so Equation (6) is equivalent to (9), and completes the proof. □
Thus, the problem can be solved by
Obviously, it is very important to reduce the online computation as the aforementioned method has prohibitive computation. One important method is the off-line robust MPC strategy [
11,
12]. We proposed a shrinking method of RMPC [
20], but the method only considered the system without state and output disturbance. In practice, most of the dynamic systems are influence by the state and output disturbance/noise. If the disturbance is not considered, the control performance will be very poor, even the system is not stable, so we propose the shrinking ellipsoids strategy for robust model predictive control with state and output disturbance.
3. The Synthesis of the Shrinking Ellipsoids Strategy
In this section, we discuss the shrinking ellipsoids strategy for robust MPC with state and output disturbance. First, the GPASE is designed off-line. Then the synthesis of shrinking ellipsoids strategy for linear parameter-varying (LPV) system is proposed.
3.1. Design of GPASE
Definition 1. [20]. For discrete dynamical system, the ellipsoidis a geometric proportion asymptotically stable ellipsoid, if whenever, then, where. It is known that the rate of the convergence can be influenced by setting a minimum convergence rate on the state() as followsfor any.
Lemma 1. For system (1), if it has a minimum convergence rate of (20), the following LMI must be satisfied: Proof. as
It is equilibrant to .
Pre-multiplying , post-multiplying , and using the Schur complement .
That is .
As is positive, so . So it only needs .
Then using the Schur complement again we can get
□
Assumption 1. Assume the uncertain system (1) with LMIs has the proper feasible initial region. We assume the original point is the equilibrium point, so it ought to be in the feasible initial region. If the original point is not the equilibrium point, we can make a transformation (,is the original system’s equilibrium point, andis the transformed system), so that the origin is the equilibrium point of the new system.Algorithm 1. off-line as follows: |
. |
. |
, go to step 1. |
Remark 2. is the number of designed off-line ellipsoids. The biggerneeds more off-line computation and more storage, and it depends on the designed shrinking ratio.
Lemma 2. [20].Suppose the positive definite matrices satisfy, then, whereand.
The relation of
and
is shown in
Figure 1.
Remark 3. For the convenience of operation, the corresponding points can be selected on the x-axis. That is to say, all the coordinates ofare zero except the first one. For finding the largest feasible region, the method of bisection will be used, that is to say, we will findon the x-axis using the method of bisection.
Remark 4. The numberhas an influence on the feasibility and the off-line computational load. Ifis too small, Algorithm 1 will have no feasible solution; if N is too large, it will increase the off-line computational load.
3.2. Shrinking Ellipsoids Strategy
Based on the GPASE designed in 1, the shrinking ellipsoids strategy for the LPV system is proposed as follows.
Algorithm 2. (synthesis of shrinking ellipsoids strategy) |
using Algorithm 1 off-line; |
; |
Step 3: Apply the controller to the system |
. |
Step 4: Compute the state at the next sample time, return to Step 3. |
Theorem 2. For dynamical system (1), the shrinking ellipsoids strategy Algorithm 2 asymptotically stabilizes the closed-loop system.
Proof. With regard to the off-line minimization at . It is ensured that its convergence speed rate is not less than by the additional LMI (21). So, if , then . From Lemma 2, the designed controller can assure the state to be shrunk into the inner ellipsoid, that is, the control law for the ellipsoid is guaranteed to assure the state within and converge into the ellipsoid , and so on. Lastly, is guaranteed to be in and converge to the equivalent point and the asymptotic stability of the closed-loop system is realized in the end. □
Remark 5. Regarding the GPASE, the online computation only finds the smallest ellipsoid containing the initial state. Once it is found, the state is shrunk into the smaller ellipsoid, so the online computation is almost zero. So the number of the preset points only affects the off-line computation but not the online calculation.
Remark 6. The polyhedral invariant set can easily deal with non-symmetric constraints, and in this paper the designed algorithm is based on the ellipsoidal sets. So Algorithm 2 is usually more conservative than a polyhedral invariant set, so the strategy is more conservative than the method in [
21].
4. Simulation Example
Example. Consider the followed system
where
is an uncertain parameter satisfying
. In this case,
,
,
. The polytopic uncertain set is given as follows
First, the online RMPC is used and the initial condition is chosen as
. When
, the system can be controlled to the equilibrium point. When the system is simulated on the MacBook (Retina, 12-inch, 2017) with the CPU 1.2 GHz Intel Core m3, the elapsed time is 3.189613 s. The system’s states and the random variable are shown as
Figure 2 and
Figure 3, respectively.
If the Algorithm 2 is applied to the system with the same random variable the system’s states are shown as
Figure 4. The nested ellipsoids are shown as
Figure 5. The online computing time is almost zero as most of the computation time is moved off-line, and the next step is only applying the pre-computed controller on the system. From
Figure 2 and
Figure 4 we know that the performance of the designed off-line strategy is almost the same with the online controller, but the computation burden is reduced dramatically. As far as the authors know, most of the RMPC method of the system with state and output disturbance is output RMPC, so in this condition we cannot compare this method with other algorithms with the same simulation.
5. Conclusions
This paper presents an off-line strategy for robust constrained MPC with state and output disturbances. The concept of nested geometric proportion asymptotically stable ellipsoids is first proposed and designed through adding an additional LMI to the traditional RMPC problem. The GPASE strategy is designed off-line and can assure the system converges to the equivalent. With this method the online computation is almost reduced to zero, which makes it possible to apply it to the broad areas. The strategy in this article can deal with the system with state and output disturbances, and these disturbances often exist on real systems, so the online calculation is reduced dramatically. The usefulness and effectiveness of the method is illustrated with a simulation example.
Author Contributions
Writing–original draft, Y.Y.; Software, L.Z. All authors have read and agreed to the published version of the manuscript.
Funding
This work is supported by the fund of the National Nature Science Foundation of China Scholarship Council under grant 201706735054, the Hebei Provincial Natural Science Foundation under Grant F2016502025.
Institutional Review Board Statement
Not applicable.
Informed Consent Statement
Not applicable.
Data Availability Statement
Data sharing not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Grüne, L.; Pannek, J. Nonlinear model predictive control. In Nonlinear Model Predictive Control; Springer: Berlin/Heidelberg, Germany, 2017; pp. 45–69. [Google Scholar]
- Mayne, D.Q.; Rawlings, J.B.; Rao, C.V.; Scokaert, P.O.J.A. Constrained model predictive control: Stability and optimality. Automatica 2000, 36, 789–814. [Google Scholar] [CrossRef]
- Lorenzen, M.; Cannon, M.; Allgöwer, F.J.A. Robust MPC with recursive model update. Automatica 2019, 103, 461–471. [Google Scholar] [CrossRef]
- Eliasi, H.; Rahmati, S. Robust model predictive control for a class of discrete nonlinear systems. J. Nonlinear Syst. Electric. Eng. 2020, 6, 104–118. [Google Scholar]
- Kothare, M.V.; Balakrishnan, V.; Morari, M.J.A. Robust constrained model predictive control using linear matrix inequalities. Automatica 1996, 32, 1361–1379. [Google Scholar] [CrossRef] [Green Version]
- Lee, J.; Chang, H.-J.; Ahn, H.-S. Explicit MPC for column-type EPS systems. IET Electr. Power Appl. 2019, 14, 91–100. [Google Scholar] [CrossRef]
- Kouvaritakis, B.; Rossiter, J.; Schuurmans, J. Efficient robust predictive control. IEEE Trans. Automat. Contr. 2000, 45, 1545–1549. [Google Scholar] [CrossRef]
- Abdelbaky, M.A.; Liu, X.; Jiang, D.J.R.E. Design and implementation of partial offline fuzzy model-predictive pitch controller for large-scale wind-turbines. Renew. Energy 2020, 145, 981–996. [Google Scholar] [CrossRef]
- Diehl, M.; Bjornberg, J. Robust dynamic programming for min-max model predictive control of constrained uncertain systems. IEEE Trans. Automat. Contr. 2004, 49, 2253–2257. [Google Scholar] [CrossRef]
- Ma, A.; Cheng, Q.; Liu, K.; Xia, Y. Time optimal model predictive control for linear systems based on ellipsoidal and polytopic sets. Renew. Energy 2019, 1–9. [Google Scholar] [CrossRef]
- Wan, Z.; Kothare, M.V. An efficient off-line formulation of robust model predictive control using linear matrix inequalities. Automatica 2003, 39, 837–846. [Google Scholar] [CrossRef]
- Ding, B.; Xi, Y.; Cychowski, M.T.; O’Mahony, T. Improving off-line approach to robust MPC based-on nominal performance cost. Automatica 2007, 43, 158–163. [Google Scholar] [CrossRef]
- Zhang, L.G.; Liu, X.J.; Kong, X.B. State estimators for uncertain linear systems with different disturbance/Noise using quadratic boundedness. J. Appl. Math. 2012, 1–11. Available online: https://www.hindawi.com/journals/jam/2012/101353 (accessed on 3 June 2012). [CrossRef] [Green Version]
- Longge, Z.; Yan, Y. Robust shrinking ellipsoid model predictive control for linear parameter varying system. PLoS ONE 2017, 12, e0178625. [Google Scholar] [CrossRef] [PubMed] [Green Version]
- Avraamidou, S.; Pistikopoulos, E.N. A multi-parametric bi-level optimization strategy for hierarchical model predictive control. In Computer Aided Chemical Engineering; Elsevier: Amsterdam, The Netherlands, 2017; pp. 1591–1596. [Google Scholar]
- Diangelakis, N.A.; Oberdieck, R.; Pistikopoulos, E.N. Explicit (Offline) optimization for MPC. In Handbook of Model Predictive Control; Springer: Berlin/Heidelberg, Germany, 2019; pp. 359–385. [Google Scholar]
- Taghavipour, A.; Vajedi, M.; Azad, N.L. Multi-parametric predictive control. In Intelligent Control of Connected Plug-in Hybrid Electric Vehicles; Springer: Berlin/Heidelberg, Germany, 2019; pp. 79–102. [Google Scholar]
- Charitopoulos, V.M.; Papageorgiou, L.G.; Dua, V.J. Closed-loop integration of planning, scheduling and multi-parametric nonlinear control. Comput Chem Eng. 2019, 122, 172–192. [Google Scholar] [CrossRef]
- Bumroongsri, P.; Kheawhom, S. An ellipsoidal off-line model predictive control strategy for linear parameter varying systems with applications in chemical processes. Syst. Control. Lett. 2012, 61, 435–442. [Google Scholar] [CrossRef]
- Zhang, L.G. Automatic offline formulation of robust model predictive control based on linear matrix inequalities method. Abstr. Appl. Anal. 2013, 1–9. [Google Scholar] [CrossRef]
- Shokrollahi, A.; Shamaghdari, S. Offline robust model prsedictive control for lipschitz non-linear systems using polyhedral invariant sets. Asian J Control 2020, 22, 288–296. [Google Scholar] [CrossRef]
| Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2021 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).