In this article, we study the Pareto optimal H2 /H∞ filter design problem for a generalization of discrete-time stochastic systems. By constructing the estimation equation of the given systems with the estimated signal, a filter error estimation system is obtained. The aim is to obtain a gain matrix K⋆ that optimizes both performance indicators we set. To deal with this problem, two different upper bounds for two performance indicators are given respectively. The optimal problem therefore is transformed into a Pareto optimal problem with linear matrix inequalities (LMIs) which can be addressed through the LMI toolbox in MATLAB.
Citation: Xiaoyu Ren, Ting Hou. Pareto optimal filter design with hybrid H2/H∞ optimization[J]. Mathematical Modelling and Control, 2023, 3(2): 80-87. doi: 10.3934/mmc.2023008
[1] | Zhaoxia Duan, Jinling Liang, Zhengrong Xiang . Filter design for continuous-discrete Takagi-Sugeno fuzzy system with finite frequency specifications. Mathematical Modelling and Control, 2023, 3(4): 387-399. doi: 10.3934/mmc.2023031 |
[2] | Vladimir Djordjevic, Ljubisa Dubonjic, Marcelo Menezes Morato, Dragan Prsic, Vladimir Stojanovic . Sensor fault estimation for hydraulic servo actuator based on sliding mode observer. Mathematical Modelling and Control, 2022, 2(1): 34-43. doi: 10.3934/mmc.2022005 |
[3] | Naveen Kumar, Km Shelly Chaudhary . Position tracking control of nonholonomic mobile robots via H∞-based adaptive fractional-order sliding mode controller. Mathematical Modelling and Control, 2025, 5(1): 121-130. doi: 10.3934/mmc.2025009 |
[4] | Saravanan Shanmugam, R. Vadivel, S. Sabarathinam, P. Hammachukiattikul, Nallappan Gunasekaran . Enhancing synchronization criteria for fractional-order chaotic neural networks via intermittent control: an extended dissipativity approach. Mathematical Modelling and Control, 2025, 5(1): 31-47. doi: 10.3934/mmc.2025003 |
[5] | Abdul-Fatawu O. Ayembillah, Baba Seidu, C. S. Bornaa . Mathematical modeling of the dynamics of maize streak virus disease (MSVD). Mathematical Modelling and Control, 2022, 2(4): 153-164. doi: 10.3934/mmc.2022016 |
[6] | Bader Saad Alshammari, Daoud Suleiman Mashat, Fouad Othman Mallawi . Numerical investigation for a boundary optimal control of reaction-advection-diffusion equation using penalization technique. Mathematical Modelling and Control, 2024, 4(3): 336-349. doi: 10.3934/mmc.2024027 |
[7] | Iman Malmir . Novel closed-loop controllers for fractional nonlinear quadratic systems. Mathematical Modelling and Control, 2023, 3(4): 345-354. doi: 10.3934/mmc.2023028 |
[8] | S. Y. Tchoumi, Y. Kouakep-Tchaptchie, D. J. Fotsa-Mbogne, J. C. Kamgang, J. M. Tchuenche . Optimal control of a malaria model with long-lasting insecticide-treated nets. Mathematical Modelling and Control, 2021, 1(4): 188-207. doi: 10.3934/mmc.2021018 |
[9] | Wen Zhang, Jinjun Fan, Yuanyuan Peng . On the discontinuous dynamics of a class of 2-DOF frictional vibration systems with asymmetric elastic constraints. Mathematical Modelling and Control, 2023, 3(4): 278-305. doi: 10.3934/mmc.2023024 |
[10] | Jiaquan Huang, Zhen Jia, Peng Zuo . Improved collaborative filtering personalized recommendation algorithm based on k-means clustering and weighted similarity on the reduced item space. Mathematical Modelling and Control, 2023, 3(1): 39-49. doi: 10.3934/mmc.2023004 |
In this article, we study the Pareto optimal H2 /H∞ filter design problem for a generalization of discrete-time stochastic systems. By constructing the estimation equation of the given systems with the estimated signal, a filter error estimation system is obtained. The aim is to obtain a gain matrix K⋆ that optimizes both performance indicators we set. To deal with this problem, two different upper bounds for two performance indicators are given respectively. The optimal problem therefore is transformed into a Pareto optimal problem with linear matrix inequalities (LMIs) which can be addressed through the LMI toolbox in MATLAB.
How to design a filter is a synthesis problem of high concern. It has developed from classical filters to the present various filters which can be designed according to different characteristics. Therefore, the filtering design plays a great role in dealing with engineering [1,2,3,4,5]. For example, designing a suitable filter for a certain system can reduce the damage of external disturbances to the observed signals. However, in practice, it is hard to design an optimal filter in order to optimize the system, which requires strong theoretical and tool support.
In recent years, the designs of H∞ filter and H2/H∞ filter have become hot research issues and attracted extensive attention [6,7,8,9,10,11]. H∞ filter design is a single-objective filter design problem under the restricted condition of a prescribed H∞ performance index. The vast majority of studies now still focus on the H∞ filter. As for the advantage of the H∞ filter, [12] explained that one does not need to know explicitly the statistical nature of the external interference, and it is only needed to assume that the external disturbance has bounded energy. In this paper, we consider Pareto optimal filter design with H2/H∞ constraints. It requires the filter reaches the given H2 and H∞ performance indices at the same time. Significantly, this simultaneous optimization is optimal not in the usual sense, but in the sense of Pareto optimality. It can be seen as a kind of ideal state of resource allocation. In particular, if a group of people and natural resources are allocated, it should make a person better, at least not make anyone to get worse when a distribution state changes from one to another. In fact, it can be thought of a cooperative game.
Since the concept of Pareto optimality was put forward, many scholars have explored this hot issue [13,14,15,16,17,18]. Generally speaking, three methods are mainly adopted to solve Pareto Optimization problem: variational method, Pontryagin maximum principle and Bellman dynamic programming method. For continuous or discrete stochastic systems, necessary and sufficient conditions of the existence of Pareto optimal strategy have been studied deeply, and the optimal problem under the LQ performance index in a finite and an infinite time domain have also been dealt with, which provide some basic theoretical support for the subsequent discussions of related problems [19,20]. Pareto optimization filter design has received a lot of attention in recent years[21,22,23]. To design a multi-objective H2/H∞ filter for nonlinear systems, [24] developed an evolutionary algorithm based on LMIs to derive the Pareto optimal solution.
In this paper, we attempt to construct an estimation equation for a general linear system with perturbations. Through a series of constraints, we will get that the filtering error estimation system meets the H2 and H∞ performance indices in the sense of Pareto optimality. We just convert the inequality constrained problem into a Pareto optimal problem with LMIs and find out the optimal gain matrix K∗. To this end, by analyzing the linear quadratic objective function and the robustness, a sufficient condition by means of a constraint optimization is derived in the first place.
For convenience, the notation is given as follows: Rn is the space of all real n-dimensional vectors; x(k), ˆx(k) and ˜x(k) represent the state vector, the state estimation and the estimation error, respectively; Tr(A) denotes the trace of a matrix A; min(α∗,β∗) is the simultaneous minimization of α and β.
Consider the following discrete-time linear stochastic system with perturbations and multiplicative noises:
{x(k+1)=Ax(k)+Bv(k)+[Cx(k)+Dv(k)]ω(k),y(k)=Lx(k)+Gv(k),z(k)=Mx(k), | (2.1) |
where x(k)∈Rn, y(k)∈Rq and z(k)∈Rm are the system state, the measurement output and the state combination to be estimated, respectively. A, B, C, D, L, G and M are constant matrices of appropriate dimensions. Let {ω(k), k=1,2,⋯} be a sequence of real random variables defined on the filtered probability space (Ω,F,P,Fk) with Fk=σ{ω(s), s=1,2,⋯,k}, satisfying E(ω(s))=0 and E(ω(s1)ω(s2)) = δs1s2, where δs1s2 is the Kronecker operator. v∈l2(R+;Rnv):={vk is Fk-measurable, and E(∑∞k=0‖v(k)‖2)12<∞} is the exogenous disturbance. Moreover, assume that v(k) and ω(k) are independent of each other.
Construct the estimated equation for z(k) as follows:
{ˆx(k+1)=Aˆx(k)+Cˆx(k)ω(k)+K[y(k)−Lˆx(k)],ˆz(k)=Mˆx(k). | (2.2) |
Subtracting (2.2) from (2.1), we can obtain the filtering error estimation equation:
{˜x(k+1)=(A−KL)˜x(k)+(B−KG)v(k)+[C˜x(k)+Dv(k)]ω(k),˜z(k)=M˜x(k), | (2.3) |
where ˜x(k)=x(k)−ˆx(k) stands for the state estimation error and ˜z(k)=z(k)−ˆz(k) stands for the signal estimation error.
We express H∞ and H2 performance indices of system (2.1) in the following form:
J1(K)=supv∈l2(R+;Rnv),v≠0,x(0)=0E{∑∞k=0˜xT(k)MTR1M˜x(k)}E{∑∞k=0v(k)Tv(k)},J2(K)=Tr(E{˜z(k+1)R2˜zT(k+1)}), |
where R1 and R2 are given weighted matrices with R2≥0. The problem of multi-objective filter design can be represented as follows:
minK(J1(K),J2(K)). | (2.4) |
Remark 2.1. The traditional H2/H∞ filter design focuses on minimizing the H2 filter performance index J2(K)⩽ with a given expected H_{\infty} performance, which is usually viewed as a single-objective problem with the limit of H_{\infty} index. For the multi-objective H_{2}/H_{\infty} filter problem in (2.4), the filtering performance indices J_1(K) and J_2(K) need to be minimized at the same time. This is the difference between the multi-objective H_{2}/H_{\infty} filter design problem and the traditional one.
With the above analysis, the design of the multi-objective filter including at least two objectives in (2.4), we utilize an indirect method to solve this meaningful question. To this end, we consider the following upper bound for each indicator:
\begin{equation} J_{1}(K)\leqslant\alpha, \end{equation} | (2.5) |
\begin{equation} J_2(K)\leqslant\beta, \end{equation} | (2.6) |
where \alpha and \beta are positive scalars.
On the basis of (2.5) and (2.6), the multi-objective optimization problem (2.4) can be converted to a solvable form:
\begin{equation} \begin{aligned} &\min\limits_{K}(\alpha, \beta)\\ s.t.\quad &J_1(K)\leqslant\alpha, \\ &J_2(K)\leqslant\beta. \end{aligned} \end{equation} | (2.7) |
The definitions and lemma that will be shown are essential to the later discussions.
Definition 2.1 ([16]). (Pareto optimality) Let \mathcal U be the admissible set of all gain matrices. If there is no K\in \mathcal U satisfying J_{i}(K)\leqslant J_{i}(K^{*}) , i = 1, 2 and an inequality is strictly true, then K^{*}\in \mathcal U is called Pareto efficient. The corresponding point J_{i}(K^{*}) is called a Pareto solution. The set of all Pareto efficient solutions is called the Pareto frontier.
Definition 2.2 ([16]). (Pareto dominance) For two solutions (\alpha_1, \beta_1) and (\alpha_2, \beta_2) , if at least one inequality in \alpha_1\leqslant\alpha_2 and \beta_1\leqslant\beta_2 is strictly true, then we call that (\alpha_1, \beta_1) is dominate solutions.
Lemma 2.1. In the sense of Pareto optimality, the multi-objective optimization problem in (2.4) is the same as the one in (2.7).
Proof. Just state that the two inequality constraints in (2.7) are of the form of Pareto optimal solution. Assume that the 3 -element optimal solution of the multi-objective optimization problem in (2.7) is (K^{*}, \alpha^{*}, \beta^{*}) , and the inequality in (2.7) is treated as a strict inequality in the sense of Pareto solutions. If we set J_{1}(K^{*}) < \alpha^{*} , then there is an \alpha^{1} such that \alpha^{1} < \alpha^{*} and J_{1}(K^{*}) = \alpha^{1} are satisfied for the same K^{*} , and then (\alpha^{1}, \beta^{*}) dominates the optimal solution (\alpha^{*}, \beta^{*}) , which contradicts the hypothesis. So, the conclusion is correct.
Definition 2.3 ([7]). (asymptotically mean square stability) Let v = 0 in (2.1). Stochastic system (2.1) is said to be asymptotically stable in the sense of mean square for any initial state x(0) = x_{0}\in R^{n} , if
lim_{k\rightarrow \infty}E[x(k)x^{\mathrm{T}}(k)] = 0. |
The fundamental purpose of this article is to get a filter gain matrix K so that the two conditions which will be shown are satisfied:
(i) The equilibrium point \tilde{x} \equiv 0 of the filtering error estimation system with v = 0 is globally mean square asymptotically stable;
(ii) J_1(K)\leqslant\alpha , J_2(K)\leqslant\beta hold for the given disturbance attenuation level \alpha and \beta , namely, the upper bounds of the performance indices.
From (2.5), it can be obtained that:
\begin{equation} E\left\{\sum\limits_{k = 0}^{\infty} \tilde{x}^{\mathrm{T}}(k){M}^{\mathrm{T}} R_{1} M\tilde{x}(k)\right\} \leqslant\alpha E\left\{\sum\limits_{k = 0}^{\infty}v(k)^{\mathrm{T}}v(k)\right\}. \end{equation} | (2.8) |
Because of the impact of initial conditions \tilde{x}(0) on the performance indices of H_{\infty} , the above should be corrected as follows:
\begin{equation} \begin{aligned} &E\left\{\sum\limits_{k = 0}^{\infty} \tilde{x}^{\mathrm{T}}(k){M}^{\mathrm{T}} R_{1} M\tilde{x}(k)\right\}\\ \leqslant &E{\tilde{x}^{\mathrm{T}}(0)P\tilde{x}(0)} +\alpha E\left\{\sum\limits_{k = 0}^{\infty}v(k)^{\mathrm{T}}v(k)\right\}, \end{aligned} \end{equation} | (2.9) |
where P is some positive definite matrix.
Meanwhile, (2.8) can be denoted by
\begin{equation} J_2(K) = \operatorname{Tr}\left(E\left\{\tilde{z}(k+1) R_2 \tilde{z}^{\mathrm{T}}(k+1)\right\}\right)\leqslant\beta. \end{equation} | (2.10) |
Through the introductory analysis, the H_{2}/H_{\infty} filter design problem treated with in the sense of Pareto optimality has been fully presented. In this section, we will describe our main results.
Theorem 3.1. The H_{2}/H_{\infty} filter design issue in (2.6) can be transformed into the following multi-objective optimization problem:
\begin{equation} \min\limits_{P > 0, K}(\alpha, \beta), \end{equation} | (3.1) |
s.t. (3.2), (3.3), (3.4) (These three inequalities are detailed at the upward side of the page down.), and in (3.4) m is the dimension of M .
\begin{equation} \left[ \begin{array}{ccccc} P-M^{\mathrm{T}} R_1 M & 0 & 0 & 0 & (A-K L)^{\mathrm{T}} P\\ 0 & \alpha I & 0 & 0 & (B-K G)^{\mathrm{T}} P \\ 0 & 0 & I & 0 & C^{\mathrm{T}} \\ 0 & 0 & 0 & I & D^{\mathrm{T}} \\ P(A-K L) & P(B-K G) & C & D & P\\ \end{array} \right] > 0, \end{equation} | (3.2) |
\begin{equation} \left[ \begin{array}{ccccc} P&P(B-KG) \sqrt{R_2} & PD \sqrt{R_2} & PC\sqrt{R_2} & P(A-KL) \sqrt{R_2} \\ 0 & I & 0 & 0 & 0 \\ 0 & 0 & I & 0 & 0 \\ 0 & 0 & 0 & P & 0 \\ \left(P(B-K G) \sqrt{R_2}\right)^T & \left(PD\sqrt{R_2}\right)^T & \left(PC\sqrt{R_2}\right)^T & \left(P(A-KL)\sqrt{R_2}\right)^T & P\\ \end{array} \right] > 0, \end{equation} | (3.3) |
\begin{equation} \left[ \begin{array}{cc} \beta I & \sqrt{m} M \\ \sqrt{m} M^T & P\\ \end{array} \right] > 0, \end{equation} | (3.4) |
Before proving Theorem 3.1, we recall the following useful lemma.
Lemma 3.1 ([24]).(Schur complement) The LMI
\begin{equation} \left( \begin{array}{cc} R_1(x) & S(x) \\ S^{\mathrm{T}}(x) & R_2(x) \end{array} \right) > 0 \end{equation} | (3.5) |
is equivalent to R_2(x) > 0 , R_1(x)-S(x) R_2^{-1}(x) S^T(x) > 0 , where R_1(x) = R_1^T(x) and R_2(x) = R_2^T(x) .
Proof. Considering (2.7) and remembering the performance indicator (2.9) in mind, we have
\begin{eqnarray*} &&E\{\sum\limits_{k = 0}^{T} \tilde{x}^{\mathrm{T}}(k) M^{\mathrm{T}} R_{1} M \tilde{x}(k)\}\\ \ \ \ \ = &&E\{\tilde{x}^{\mathrm{T}}(0) P \tilde{x}(0)\}-E\{\tilde{x}^{\mathrm{T}}(T+1) P \tilde{x}(T+1)\}\\ &&\ \ \ \ \ \ \ \ +E\{\sum\limits_{k = 0}^T (\tilde{x}^{\mathrm{T}}(k) M^{\mathrm{T}} R_1 M \tilde{x}(k)+\tilde{x}^{\mathrm{T}}(k+1) P \\ &&\ \ \ \ \ \ \ \ \ \cdot \tilde{x}(k+1) -\tilde{x}^{\mathrm{T}}(k) P \tilde{x}(k))\}\\ &&\ \ \ \ \ \leq E\{\tilde{x}^{\mathrm{T}}(0) P \tilde{x}(0)+\alpha \sum\limits_{k = 0}^T[v(k)^{\mathrm{T}} v(k)]\}\\ &&\ \ \ \ \ \ \ \ +E\{\sum\limits_{k = 0}^T \tilde{x}^{\mathrm{T}}(k) M^{\mathrm{T}} R_1 M \tilde{x}(k) -\tilde{x}^{\mathrm{T}}(k) P \tilde{x}(k)\\ &&\ \ \ \ \ \ \ \ +[(A-K L) \tilde{x}(k)+(B-K G) v(k)\\ &&\ \ \ \ \ \ \ \ +[C\tilde{x}(k)+Dv(k)] \omega(k)]^{\mathrm{T}} P[(A-KL)\tilde{x}(k)\\ &&\ \ \ \ \ \ \ \ +(B-KG)v(k)+[C\tilde{x}(k)+Dv(k)]\omega(k)]\\ &&\ \ \ \ \ \ \ \ -\alpha v(k)^{\mathrm{T}}v(k)\} \\ &&\ \ \ \ = E\{\tilde{x}^{\mathrm{T}}(0)P \tilde{x}(0)\}+\alpha \sum\limits_{k = 0}^T{E[v(k)^{\mathrm{T}} v(k)]}\\ &&\ \ \ \ \ \ \ \ +E\sum\limits_{k = 0}^T \{\tilde{x}^{\mathrm{T}}(k)(M R^{\mathrm{T}} R_{1} M-P)\tilde{x}(k)\\ &&\ \ \ \ \ \ \ \ -\alpha v(k)^{\mathrm{T}}v(k)+[(A-KL) \tilde{x}(k)+(B-K G) v(k)\\ &&\ \ \ \ \ \ \ \ +[C \tilde{x}(k)+Dv(k)] \omega(k)]^{\mathrm{T}}P[(A-K L) \tilde{x}(k)\\ &&\ \ \ \ \ \ \ \ +(B-K G) v(k)+[C \tilde{x}(k)+D v(k)] \omega(k)]\}. \end{eqnarray*} |
Let T\rightarrow \infty in the above inequality, one can infer by Definition 2.3
\begin{eqnarray*} &&E\{\sum\limits_{k = 0}^{{\infty}} [\tilde{x}^{\mathrm{T}}(k)(M^{\mathrm{T}} R_1 M-P) \tilde{x}(k)]-\alpha v(k)^{\mathrm{T}} v(k)\\ &&\ \ \ \ +[(A-K L) \tilde{x}(k)+(B-K G) v(k)+[C \tilde{x}(k) \\ &&\ \ \ \ +D v(k)] \omega(k)]^{\mathrm{T}} P[(A-KL)\tilde{x}(k)+(B-KG)\cdot v(k) \\ &&\ \ \ \ +[C\tilde{x}(k)+Dv(k)] \omega(k)]\} < 0, \end{eqnarray*} |
which is equivalent to the following inequality being true:
\begin{equation} \ \ \ \ \ \ \ \ \ \ \left[\begin{array}{c} \tilde{x}(k) \\ v(k) \\ \tilde{x}(k) \omega(k) \\ \omega(k) \end{array}\right]^{\mathrm{T}}\left\{\left[\begin{array}{c} (A-K L)^{\mathrm{T}} \\ (B-K G)^{\mathrm{T}} \\ C^{\mathrm{T}} \\ D^{\mathrm{T}} \end{array}\right] P\left[\begin{array}{c} (A-K L)^{\mathrm{T}} \\ (B-K G)^{\mathrm{T}} \\ C^{\mathrm{T}} \\ D^{\mathrm{T}} \end{array}\right]^{\mathrm{T}}\right. \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \\ \left.- \left[\begin{array}{cccc} P-M^{\mathrm{T}} R_1 M & 0 & 0 & 0 \\ 0 & \alpha I & 0 & 0 \\ 0 & 0 & I & 0 \\ 0 & 0 & 0 & I \end{array}\right]\right\} \left[\begin{array}{c} \tilde{x}(k) \\ v(k) \\ \tilde{x}(k) \omega(k) \\ \omega(k) \end{array}\right] < 0. \end{equation} | (3.6) |
Furthermore, we have from (3.6)
\begin{equation*} \left[\begin{array}{c} (A-K L)^{\mathrm{T}} \\ (B-K G)^{\mathrm{T}} \\ C^{\mathrm{T}} \\ D^{\mathrm{T}} \end{array}\right] P\left[\begin{array}{c} (A-K L)^{\mathrm{T}} \\ (B-K G)^{\mathrm{T}} \\ C^{\mathrm{T}} \\ D^{\mathrm{T}} \end{array}\right]^{\mathrm{T}} -\left [\begin{array}{cccc} P-M^{\mathrm{T}} R_1 M & 0 & 0 & 0 \\ 0 & \alpha I & 0 & 0 \\ 0 & 0 & I & 0 \\ 0 & 0 & 0 & I \end{array}\right] < 0. \end{equation*} |
Using Schur complement (Lemma 3.1), (3.2) is established. At this point, the H_{\infty} performance index is met, that is
E\left\{\sum\limits_{k = 0}^{\infty} \tilde{x}^{\mathrm{T}}(k) M^{\mathrm{T}} R_1 M \tilde{x}(k)\right\} \leq E\left\{\tilde{x}^{\mathrm{T}}(0) P \tilde{x}(0)+\alpha \sum\limits_{k = 0}^{\infty}v(k)^{\mathrm{T}} v(k)\right\}, |
which is equivalent to saying that if (3.2) is guaranteed, then H_{\infty} performance index has upper bound \alpha .
Next, taking the H_2 performance index (2.5) and (2.3) into account, one gets
\begin{aligned} J_2(K) = &\operatorname{Tr}(E\{M[\tilde{x}(k+1) R_2 \tilde{x}^{\mathrm{T}}(k+1)] M^{\mathrm{T}}\})\\ = &\operatorname{Tr}(M\{E[\tilde{x}(k+1) R_{2} \tilde{x}^{\mathrm{T}}(k+1)]\} M^{\mathrm{T}}) \\ = &\operatorname{Tr}(M\{E[(A-KL) \tilde{x}(k)+(B-K G)v(k)\\ &+[C\tilde{x}(k)+D v(k)] \omega(k)] R_2[(A-KL)\tilde{x}(k)\\ &+(B-K G) v(k)+[C \tilde{x}(k)+D v(k)]\omega(k)]^{\mathrm{T}}\} M^{\mathrm{T}})\\ = &\operatorname{Tr}\{M [(A-K L) E(\tilde{x}(k) \tilde{x}^{\mathrm{T}}(k)) R_2(A-K L)^{\mathrm{T}}\\ &+(B-K G) R_2(B-K G)^{\mathrm{T}}+CE(\tilde{x}(k)\tilde{x}^{\mathrm{T}}(k))R_2 C^{\mathrm{T}}\\ &+DR_2D^{\mathrm{T}}] M^{\mathrm{T}}\}. \end{aligned} |
Letting Q = E\left(\tilde{x}(k) \tilde{x}^{\mathrm{T}}(k)\right) , then the above representation becomes
\begin{aligned} J_2(K) = &\operatorname{Tr}\left\{M \left[(A-K L) Q R_2(A-K L)^{\mathrm{T}}-Q+(B-K G)\right.\right.\\ &\left.\left. \cdot R_2(B-K G)^{\mathrm{T}}+CQR_2C^{\mathrm{T}}+D R_2 D^{\mathrm{T}}\right] M^{\mathrm{T}}\right\}\\&+\operatorname{Tr}\left(M Q M^{\mathrm{T}}\right). \end{aligned} |
From above, it is shown that if the inequality
\begin{equation} \begin{aligned} (A-K L) &Q R_2(A-K L)^{\mathrm{T}}-Q+(B-K G)R_2 \\ & \cdot(B-K G)^{\mathrm{T}}+C QR_2C^{\mathrm{T}}+D R_2 D^{\mathrm{T}} < 0 \end{aligned} \end{equation} | (3.7) |
holds, then the H_2 performance index has upper bound \beta
\begin{equation} J_2(K) < \operatorname{Tr}\left(M Q M^{\mathrm{T}}\right)\triangleq\beta. \end{equation} | (3.8) |
Set P = Q^{-1} . Multiplying by P on both sides of (3.7), it can be derived that
\begin{aligned}P(A-K L)& P^{-1}R_2(A-K L)^{\mathrm{T}} P-P+P(B-K G) R_2 \\ & \cdot(B-K G)^{\mathrm{T}} P+PC QR_2C^{\mathrm{T}}P+PD R_2 D^{\mathrm{T}}P < 0, \end{aligned} |
which is equivalent to the following inequality holding
\begin{equation*} \begin{aligned} \left[\begin{array}{c} \left(P(B-K G) \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P D \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P C \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P(A-K L) \sqrt{R_2}\right)^{\mathrm{T}} \end{array}\right]^{\mathrm{T}} \left[\begin{array}{llll} I & 0 & 0 & 0 \\ 0 & I & 0 & 0 \\ 0 & 0 & P & 0 \\ 0 & 0 & 0 & P \end{array}\right]\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \\ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \ \cdot \left[\begin{array}{c} \left(P(B-K G) \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P D \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P C \sqrt{R_2}\right)^{\mathrm{T}} \\ \left(P(A-K L) \sqrt{R_2}\right)^{\mathrm{T}} \end{array}\right]-P < 0. \end{aligned} \end{equation*} |
Therefore, (3.3) is obtained by the lemma of Schur complement. Moreover, (3.4) can be obtained by (3.8) directly.
Further, if we let Z = P K (or K = P^{-1} Z ), (3.2) and (3.3) are respectively equivalent to the following LMIs (3.9)and (3.10) (These two inequalities are detailed at the top of the next page.) which can be addressed through LMI toolbox in MATLAB .
\begin{equation} \left[ \begin{array}{ccccc} P-M^{\mathrm{T}} R_1 M & 0 & 0 & 0 & A^{\mathrm{T}} P-L Z^{\mathrm{T}} \\ 0 & \alpha I & 0 & 0 & B^{\mathrm{T}} P-G Z^{\mathrm{T}} \\ 0 & 0 & I & 0 & C^{\mathrm{T}} \\ 0 & 0 & 0 & I & D^{\mathrm{T}} \\ P A-Z L & P B-Z G & C & D & P \end{array} \right] > 0 \end{equation} | (3.9) |
\begin{equation} {\left[\begin{array}{ccccc} P & (P B-Z G) \sqrt{R_2} & P D \sqrt{R_2} & P C \sqrt{R_2} & (P A-Z L) \sqrt{R_2} \\ 0 & I & 0 & 0 & 0 \\ 0 & 0 & I & 0 & 0 \\ 0 & 0 & 0 & P & 0 \\ \left((P B-Z G) \sqrt{R_2}\right)^{\mathrm{T}} & \left(P D \sqrt{R_2}\right)^{\mathrm{T}} & \left(P C \sqrt{R_2}\right)^T & \left((P A-Z L) \sqrt{R_2}\right)^{\mathrm{T}} & P \end{array}\right] > 0} \end{equation} | (3.10) |
Therefore, the multi-objective optimization problem (3.1) with limits (3.2), (3.3) and (3.4) is no different to the following one:
\begin{equation} \begin{aligned} &(\alpha^*, \beta^*) = \min _{P > 0, Z}(\alpha, \beta)\\ s.t.&\quad LMIs\; (3.9), (3.10)\; and \; (3.4). \end{aligned} \end{equation} | (3.11) |
Corollary 3.1. (i) When only the H_{\infty} performance is considered, the multi-objective optimization problem (3.11) degenerates into a single-objective optimization problem of H_{\infty} filter design:
\begin{equation*} \begin{aligned} &\alpha^{0} = \min _{P > 0, Z} \alpha\\ &s.t.\quad (3.9). \end{aligned} \end{equation*} |
(ii) When only the H_{2} performance is considered, the multi-objective optimization problem (3.11) degenerates into a single-objective optimization problem of H_{2} filter design:
\begin{equation*} \begin{aligned} &\beta^0 = \min _{P > 0, Z}\beta\\ s.&t.\quad (3.10)\; and\; (3.4). \end{aligned} \end{equation*} |
(iii) When considering the traditional H_{2}/H_{\infty} filter design, we are going to solve a single-objective optimization problem that gives the disturbance attenuation level \alpha of H_{\infty} filter:
\begin{equation*} \begin{aligned} &\beta_{*} = \min _{P > 0, Z}\beta\\ s.t.&\quad (3.9), (3.10)\; and \; (3.4). \end{aligned} \end{equation*} |
Theorem 3.2. The weighting sum method described below can be used to solve the multi-objective H_2/H_{\infty} filter design problem.
\begin{equation} \begin{aligned} &\min _{P > 0, Z} \; \; \eta_1\alpha+\eta_2\beta\\ s.t.\; &LMIs\; (3.9), (3.10)\; and \; (3.4), \end{aligned} \end{equation} | (3.12) |
where \eta_1\geq0 , \eta_2\geq0 , and \eta_1+\eta_2 = 1 .
Proof. By replacing (\alpha, \beta) with the weighted sum \omega_{1}\alpha+\omega_{2}\beta , a conclusion can be drawn from Theorem 3.1.
From above, the multi-objective H_2/H_{\infty} filter design problem can be converted into a weighted sum filter design problem (3.12) which has a single objective. In order to get diverse Pareto optimal solutions, it is necessary to use different weights in (3.12) several times, and different weighted solutions will be obtained.
Remark 3.1. Generally speaking, so as to find a feasible set of \alpha and \beta , it is necessary to introduce the upper bounds \alpha^{1} and \beta^{1} and the lower bounds \alpha^{0} and \beta^{0} of \alpha and \beta respectively, that is, \alpha^{0}\leq\alpha\leq\alpha^{1} and \beta^{0}\leq\beta\leq\beta^{1} .
Assuming {(P, Z)}\in\Omega , where \Omega represents a feasible set of solutions under the constraint, the multi-objective H_2/H_{\infty} filter design problem (3.11) can be expressed in the following form:
\begin{equation*} \begin{aligned} &\min _{{P, Z}\in\Omega} \; \; (\alpha, \beta)\\ s.t.\; &LMIs\; (3.9), (3.10)\; and \; (3.4). \end{aligned} \end{equation*} |
Remark 3.2. So as to obtain the optimal gain matrix K , the most appropriate {P, Z} must be found. Assuming that the corresponding solutions of the target values (\alpha_1, \beta_1) and (\alpha_2, \beta_2) are (P_1, Z_1) and (P_2, Z_2) , respectively, if an inequality in \alpha_1 \leq \alpha_2 , \beta_1 \leq \beta_2 holds, then we can know that the solutions (P_1, Z_1) dominate the solutions (P_2, Z_2) , that is to say, the solutions (P_1, Z_1) are better than the solutions (P_2, Z_2) . For the solutions (P^{*}, Z^{*}) derived from the target values (\alpha^{*}, \beta^{*}) , if there is no other solution (P_1, Z_1) with the target values (\alpha_1, \beta_1) such that the target values (\alpha_1, \beta_1) dominate (\alpha^{*}, \beta^{*}) , then we say (P^{*}, Z^{*}) is the Pareto optimal solution of (3.11). The set of Pareto optimal solutions is the Pareto boundary.
In this section, an example is used to illustrate the effectiveness of our obtained results.
Example 4.1. Consider the following one-dimensional discrete-time linear stochastic systems:
\begin{equation} \left\{ \begin{array}{ll} x(k+1) = -2x(k)+\frac{1}{2}v(k)+[\sqrt2x(k)+\frac{1}{\sqrt2}v(k)]\omega(k), \\ y(k) = -4x(k)+\frac{1}{4}v(k), \\ z(k) = 2x(k).\\ \end{array} \right. \end{equation} | (4.1) |
Taking R_1 = R_2 = \frac{1}{2} , (3.9), (3.10) and (3.4) can be written as follows:
\begin{equation*} \begin{aligned} &\alpha\left[\left(P-M^2 R_1\right)\left(P-D^2-C^2\right)-(PA-ZL)^2\right] \\ &\quad\quad\quad\quad\quad\quad-\left(P-M^2 R_1\right)(PB-ZG)^2 > 0, \\ &P^3-R_2\left(P^2 AB-ZLPB-ZGPA+Z^2GL\right) > 0 , \\ &\beta P-M^2 > 0. \end{aligned} \end{equation*} |
In consideration of the parameters of system (4.1), we get
\begin{equation*} \begin{aligned} &\alpha > \frac{(P-2)(2P-Z)^2}{\left.16[(P-2)\left(P-\frac{5}{4}\right)-(ZP+4Z)^2\right]}, \\ &P^3+\frac{1}{2} P^2-\frac{5}{4}ZP+\frac{1}{2}Z^2 > 0, \\ &\beta > \frac{M^2}{P}. \end{aligned} \end{equation*} |
By calculating, P = \frac{3}{2} , Z = 2 and K = \frac{4}{3} can be derived. That is, we can find the optimality \alpha and \beta meet the constraints.
In the sense of Pareto optimality, the H_2/H_{\infty} filter design problem for stochastic systems with perturbations has been dealt with in this paper. The multi-objective optimization problem with some inequalities constrained was transformed into an optimization problem having some LMIs constraint, which simplifies the filter design as an LMIs -constrained multi-objective optimization problem. Notice that so far few conclusions involve Pareto optimal H_2/H_{\infty} filter design problems for general nonlinear systems with perturbations and multiplicative noises. These challenging issues will be our future research topics.
This research was funded by the National Natural Science Foundation of China under Grant No. 62073204.
The authors declare no conflicts of interest to this work.
[1] | G. Minkler, J. Minkler, Theory and Application of Kalman Filtering, Palm Bay, FL: Magellan Book Company, 1993. |
[2] |
Z. Feng, A robust H_{2} filtering approach and its application to equalizer design for communication systems, IEEE Trans. Signal Process., 53 (2005), 2735–2747. https://doi.org/10.1109/TSP.2005.850353 doi: 10.1109/TSP.2005.850353
![]() |
[3] |
L. Xie, Y. Soh, C. De souza, Robust kalman filtering for uncertain discrete-time systems, IEEE Trans. Autom. Control, 39 (1994), 1310–1314. https://doi.org/10.1109/9.293203 doi: 10.1109/9.293203
![]() |
[4] |
H. Liu, F. Sun, K. He, Z. Sun, Design of reduced-order H_{\infty} filter for Markovian jumping systems with time delay, IEEE Trans. Circuits Syst. II, Exp. Briefs, 51 (2004), 607–612. https://doi.org/10.1109/TCSII.2004.836882 doi: 10.1109/TCSII.2004.836882
![]() |
[5] |
H. Gao, C. Wang, Robust L_{2}-L_{\infty} filtering for uncertain systems with multiple time-varying state delays, IEEE Trans. Circuits Syst. I, -Fundam. Theory Appl., 50 (2003), 594–599. https://doi.org/10.1109/TAC.2003.817012 doi: 10.1109/TAC.2003.817012
![]() |
[6] |
A. Gonçalves, A. Fioravanti, J. Geromel, H_{\infty} filtering of discrete-time Markov jump linear systems through linear matrix inequalities, IEEE Trans. Autom. Control, 54 (2009), 1347–1351. https://doi.org/10.1109/TAC.2009.2015553 doi: 10.1109/TAC.2009.2015553
![]() |
[7] |
B. Chen, W. Zhang, Stochastic H_2/H_{\infty} control with state-dependent noise, IEEE Trans. Autom. Control, 49 (2004), 45–57. https://doi.org/10.1109/TAC.2003.821400 doi: 10.1109/TAC.2003.821400
![]() |
[8] |
H. Gao, J. Lam, L. Xie, C. Wang, New approach to mixed H_2/H_{\infty} filtering for polytopic discrete-time systems, IEEE Trans. Signal Process., 53 (2005), 3183–3192. https://doi.org/10.1109/TSP.2005.851116 doi: 10.1109/TSP.2005.851116
![]() |
[9] |
Z. Wang, B. Huang, Robust H_2/H_{\infty} filtering for linear systems with error variance constraints, IEEE Trans. Signal Process., 48 (2000), 2463–2467. https://doi.org/10.1109/78.852028 doi: 10.1109/78.852028
![]() |
[10] | B. Chen, W. Chen, H. Wu, Robust H_2/H_{\infty} global linearization filter design for nonlinear stochastic systems, IEEE Trans. Circuits Syst. I, Regular Papers, 56 (2009), 1441–1454. https://doi.org/1109/TCSI.2008.2007059 |
[11] | C. Huang, Decentralized fuzzy control of nonlinear interconnected dynamic delay systems via mixed H_2/H_{\infty} optimization with Smith predictor, IEEE T. FUZZY SYST., 19 (2011), 276–290. https://doi.org/1109/TFUZZ.2010.2095860 |
[12] |
W. Zhang, B. Chen, C. Tseng, Robust H_{\infty} filtering for nonlinear stochastic systems, IEEE Trans. Signal Process., 53 (2005), 589–598. https://doi.org/10.1109/TSP.2004.840724 doi: 10.1109/TSP.2004.840724
![]() |
[13] |
J. Engwerda, Necessary and sufficient conditions for Pareto optimal solutions of cooperative differential games, SIAM J. Control Optim., 48 (2010), 3859–3881. https://doi.org/10.1137/080726227 doi: 10.1137/080726227
![]() |
[14] |
P. Reddy, J. Engwerda, Pareto optimality in infinite horizon linear quadratic differential games, Automatica, 49 (2015), 1705–1714. https://doi.org/ 10.1016/j.automatica.2013.03.004 doi: 10.1016/j.automatica.2013.03.004
![]() |
[15] |
P. Reddy, J. Engwerda, Necessary and sufficient conditions for Pareto optimality in infinite horizon cooperative differential games, IEEE Trans. Autom. Control, 59 (2014), 2536–2542. https://doi.org/10.1109/TAC.2014.2305933 doi: 10.1109/TAC.2014.2305933
![]() |
[16] | J. Engwerda, LQ Dynamic Optimization and Differential Games, London: Macsource press, 2005. |
[17] | P. Reddy, Essays on Dynamic Games, Tilburg: Center for Economic Research, 2011. |
[18] |
B. Chen, S. Ho, Multiobjective tracking control design of T-S fuzzy systems: Fuzzy Pareto optimal approach, Fuzzy Sets and Systems, 290 (2016), 39–55. https://doi.org/10.1016/j.fss.2015.06.014 doi: 10.1016/j.fss.2015.06.014
![]() |
[19] |
Y. Lin, X. Jiang, W. Zhang, Necessary and sufficient conditions for Pareto optimality of the stochastic systems in finite horizon, Automatica, 194 (2018), 341–348. https://doi.org/10.1016/j.automatica.2018.04.044 doi: 10.1016/j.automatica.2018.04.044
![]() |
[20] |
Y. Lin, T. Zhang, W. Zhang, Infinite horizon linear quadratic Pareto game of the stochastic singular systems, J. Franklin Inst., 355 (2018), 4436–4452. https://doi.org/10.1016/j.jfranklin.2018.04.025 doi: 10.1016/j.jfranklin.2018.04.025
![]() |
[21] |
R. Andreas, H. Manuel, E. Christian, Pareto optimization of wavelet filter design for partial discharge detection in electrical machines, Measurement, 205 (2022), 112–163. https://doi.org/10.1016/j.measurement.2022.112163 doi: 10.1016/j.measurement.2022.112163
![]() |
[22] |
B. Satyajeet, M. Wannes, N. Philippe, H. Ihab, V. Jan, Ellipsoid based Pareto filter for multiobjective optimisation under parametric uncertainty: A beer study, IFAC-PapersOnLine, 55 (2022), 409–414. https://doi.org/10.1016/j.ifacol.2022.09.129 doi: 10.1016/j.ifacol.2022.09.129
![]() |
[23] |
T. M. Khaled, H. A. Mahmoud, H. H. Eman, A. A. Atef, Fine tuning of a PID controller with inlet derivative filter using Pareto solution for gantry crane systems, Alexandria Engineering Journal, 61 (2022), 6659–6673. https://doi.org/10.1016/j.aej.2021.12.017 doi: 10.1016/j.aej.2021.12.017
![]() |
[24] |
B. Chen, H. Lee, C. Wu, Pareto optimal filter design for nonlinear stochastic fuzzy systems via multiobjective H_2/H_{\infty} optimization, IEEE T. Fuzzy Syst., 23 (2015), 387–399. https://doi.org/10.1109/TFUZZ.2014.2312985. doi: 10.1109/TFUZZ.2014.2312985
![]() |
1. | Zhaoxia Duan, Jinling Liang, Zhengrong Xiang, Filter design for continuous-discrete Takagi-Sugeno fuzzy system with finite frequency specifications, 2023, 3, 2767-8946, 387, 10.3934/mmc.2023031 |