Mathematical Problems in Engineering

Volume 2013 (2013), Article ID 579137, 9 pages

http://dx.doi.org/10.1155/2013/579137

*ℋ*_{∞} Filter Design with Minimum Entropy for Continuous-Time Linear Systems

^{1}School of Automation, Nanjing University of Science and Technology, Nanjing 210094, China^{2}Department of Engineering, Faculty of Engineering and Science, University of Agder, 4898 Grimstad, Norway^{3}Space Control and Inertial Technology Research Center, Harbin Institute of Technology, Harbin, 150001, China^{4}Information Overall Department, North Information Control Group Co., Ltd., Nanjing 211153, China

Received 1 August 2013; Revised 8 October 2013; Accepted 21 October 2013

Academic Editor: Zhiguang Feng

Copyright © 2013 Jie Zhang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

#### Abstract

We deal with the design problem of minimum entropy *ℋ*_{∞} filter in terms of linear matrix inequality (LMI) approach for linear continuous-time systems with a state-space model subject to parameter uncertainty that belongs to a given convex bounded polyhedral domain. Given a stable uncertain linear system, our attention is focused on the design of full-order and reduced-order robust minimum entropy *ℋ*_{∞} filters, which guarantee the filtering error system to be asymptotically stable and are required to minimize the filtering error system entropy (at ) and to satisfy a prescribed *ℋ*_{∞} disturbance attenuation performance. Sufficient conditions for the existence of desired full-order and reduced-order filters are established in terms of LMIs, respectively, and the corresponding filter synthesis is cast into a convex optimization problem which can be efficiently handled by using standard numerical software. Finally, an illustrative example is provided to show the usefulness and effectiveness of the proposed design method.

#### 1. Introduction

Estimation is the process of inferring the value of a quantity of interests from indirect, inaccurate, and uncertain observations [1]. State estimation of dynamic systems with both process and measurement noise inputs is a very important and challenging problem in engineering applications. In the past decades, quite a few attention has been devoted to estimation methods that are based on the minimization of the variance of the estimation error, that is, the well-known Kalman filtering approach [2, 3]. Unfortunately, it is recognized soon that the performance of Kalman filter can deteriorate significantly when the process parameters are subjected to relatively small modeling errors. In order to cope with this problem, over the past few years interest has been devoted to the design of robust estimators. There are essentially two approaches to the robust estimation problem. The first is robust filtering, which minimizes the upper bound of the estimation error variance for all possible parametric uncertainties under the assumption that the noise processes have known power spectral densities [4, 5]. In many practical situations, however, we may not be able to have exactly known information on the spectral densities of the noise processes. In such cases, an alternative is to reformulate the estimation problem in an filtering framework, which has been well recognized to be most appropriate for systems with noise input whose stochastic information is not precisely known. It minimizes the worst-case energy gain from the noise inputs to the estimation error [6–8]. There are many results reported on the problem of filtering; for example, it has been addressed for linear systems [9], linear systems with uncertain parameters [10, 11], delay systems [6, 12], and stochastic systems [8]. Although the filter is known to be less sensitive to modeling errors than filter, it is generally so conservative as to lead to a large intolerable estimation error variance when the system is driven by white noise signals.

Similar to control problem, in the filtering problem [13–17], the family of filters that satisfy a filtering error system with an -norm bound is characterized by a linear fractional transformation of a “ball in ,” and then a natural question is which element of this ball to choose. One choice that has been considered in a closely related problem in mathematics is to choose that which minimizes an entropy integral; that is, the filter is well selected such that not only the filtering error system is asymptotically stable and the -norm of its transfer function is below a prescribed level, but also the entropy of the filtering error system at infinity is minimized. This kind of optimal filters is referred to as minimum entropy filters in the present paper. In fact, minimum entropy filtering provides a means of trading off some of the features of other filtering problems, namely, filtering and filtering. As for the minimum entropy control problem, there are many important results that have been reported in the literature; for example, controllers which minimize the entropy of the closed-loop transfer function have been studied extensively for linear time-invariant (LTI) systems, both in the continuous and discrete-time cases [18–20]. Minimum entropy control for time-varying systems has been investigated in [21]. To the best of our knowledge, however, there is not any result reported on minimum entropy filtering problem in the literature; research in this area should be important and challenging; this motivates us to carry out the present study.

In this paper, we make an attempt to investigate the design of minimum entropy filters by using linear matrix inequality (LMI) approach for linear continuous-time systems with a state-space model subject to parameter uncertainty that belongs to a given convex bounded polyhedral domain. Given a stable uncertain linear system, our attention is focused on the design of full-order and reduced-order robust minimum entropy filters, which guarantee the filtering error system to be asymptotically stable and are required to minimize the filtering error system entropy (at ) as well as to satisfy a prescribed disturbance attenuation performance. Sufficient conditions for the existence of desired full-order and reduced-order filters are established in terms of LMIs, respectively, and the corresponding filter synthesis is cast into a convex optimization problem which can be efficiently handled by using the well-known interior-point algorithms [22]. A numerical simulation example is provided to show the usefulness and effectiveness of the proposed design method.

The rest of this paper is organized as follows. In Section 2, the minimum entropy filtering problem is formulated. Section 3 presents our main results of the full-order and reduced-order minimum entropy filters design. Section 4 provides an illustrative example. Finally, conclusions are drawn in Section 5.

*Notations*. The notation used here is fairly standard except where otherwise stated. represents the transpose of ; and denote, respectively, the dimensional Euclidean space and the set of all real matrices. the notation means that is a real symmetric and positive definite matrix; represents the trace of ; stands for a block-diagonal matrix whose diagonal blocks are given by . and represent identity matrix and zero matrix; refers to the Euclidean vector norm and denotes the norm of a differential signal; The signals that are square integrable over are denoted by with the norm ; the symbol in a matrix means that the corresponding term of the matrix can be obtained by symmetric property.

#### 2. Problem Formulation

Consider the following linear time-invariant (LTI) system (): where is the state vector; is the measured output; is a linear combination of the state variables to be estimated; is the disturbance input which belongs to ; , , , , and are constant real matrices of appropriate dimensions, where is a known matrix and , , , are unknown matrices such that the system matrix belongs to a given polytope described by that is, any admissible system matrix can be written as an unknown convex combination of vertices , , given by where , , , and , , are given matrices. Clearly, corresponds to the case where the system () is perfectly known.

Before formulating the problem of this paper, we first give some definitions and existing results of the minimum entropy problem. Consider the following LTI system (): where is the output; the other notations are defined as in (1), and let denote its transfer function.

*Definition 1 (entropy at ). *Let and be a real scalar such that . Then the entropy of at is defined by

When , we obtain the entropy at infinity of the system, which has the following definition.

*Definition 2 (entropy at infinity). *Let and be a real scalar such that . Then the entropy of at infinity is defined by

It is well known that for LTI system () in (5), we have the following results for the optimization problem: where is the solution to the Lyapunov equation In fact, is just the controllability Gramian.

Now, considering the optimization problem of LTI system, we knew that if there exists a stabilizing solution to the algebraic Riccati equation and it is easy to prove that any solving (10) overbounds the controllability Gramian ; that is, . To evaluate the entropy cost, we define the following auxiliary cost.

*Definition 3 (auxiliary cost). *Let and be a real scalar such that . Then the auxiliary cost with is defined by
where is a positive symmetric matrix with the smallest possible maximum singular value among all solutions of the algebraic Riccati equality (10).

The following lemma gives the equivalence between the auxiliary cost and the entropy defined in (7) and (11), respectively, which plays a key role in deriving our main results subsequently.

Lemma 4 (see [20]). *Let and be a real scalar such that . Then the entropy equals the auxiliary cost; that is,
*

Moreover, according to the result in [22], the minimum entropy optimization problem for the LTI system () can be formulated as follows: subject to

The objective of this paper is to design a full-order (or reduced-order) minimum entropy filter the system () in (1) of the following form: where is the filter state vector, , , and are filter parameters to be determined later. In the case where , the filter will be referred to as a full-order filter and as a reduced-order filter when .

Augmenting the model of (1) to include the state of the filter (), we obtain the filtering error system as where , and

Our aim in this paper is to determine the matrices , , and of the full-order (or reduced-order) minimum entropy filter () in (15) such that the filtering error system () in (16) is asymptotically stable with a prescribed disturbance attenuation level and a guaranteed minimum entropy at infinity; that is, is minimized for a given scalar (where is defined as the transfer function of the filtering error system () in (16)).

#### 3. Main Results

##### 3.1. Full-Order Robust Filter Design

In this section, we will first study the design of a full-order filter. In order to pave the way for deriving the robust filter, initially we consider the case where the system matrix is perfectly known; that is, . We first give the following result which will play a key role in deriving our subsequent results. Since the result can be easily obtained according to the analysis in Section 2, we omit the proof.

Theorem 5. *The filtering error system () in (16) is asymptotically stable with an disturbance attenuation level and a guaranteed minimum entropy, if there exist matrices and such that the following optimization problem has feasible solution:
**
subject to*

Notice that the inequalities constraints of (19)-(20) are not convex on the decision variables , , , and . In what follows, we will present the design method of the minimum entropy filter, and give the following result.

Theorem 6. *Consider the system () with perfectly known system matrix . There exists a full-order minimum entropy filter of the form of (15) such that the filtering error system () in (16) is asymptotically stable with an disturbance attenuation level and a guaranteed minimum entropy, if there exist matrices and and matrices , , and such that the following optimization problem has feasible solution:
**
subject to
**
Moreover, a desired full-order minimum entropy filter can be computed from
*

*Proof. *According to Theorem 5, is nonsingular if the optimization problem of (18)–(20) has feasible solutions since . Now, partition as
where and are symmetric positive definite matrices. Without loss of generality, we assume that is nonsingular. To see this, let the matrix , where is a positive scalar and
Observe that, since , we have for in a neighborhood of the origin. Thus, it can be easily verified that there exists an arbitrarily small such that is nonsingular and inequalities (19)-(20) are feasible with replaced by and such that the objective function of (18) will be increased only by an arbitrarily small quantity. Since is nonsingular, we thus conclude that there is no loss of generality to assume the matrix to be nonsingular.

Define the following matrices which are all nonsingular:

Performing congruence transformations to (19)-(20) by and , respectively, we have
Considering (17) and (25)–(28), we have

Substituting (31) into (29)-(30) yields (22)-(23), respectively.

On the other hand, (28) is equivalent to

Note that the filter matrices of (15) can be written as (32), which implies that can be viewed as a similarity transformation on the state-space realization of the filter and, as such, has no effect on the filter mapping from to . Without loss of generality, we can set and thus obtain (24). This completes the proof.

Now, we will consider the design of a full-order robust filter. To this end, consider the system () in (1) and the uncertainty domain in (3). According to the previous arguments, we have the following result.

Theorem 7. *Consider the system () with system matrix . There exists a full-order minimum entropy filter of the form of (15) such that the filtering error system () in (16) is asymptotically stable with an disturbance attenuation level and a guaranteed minimum entropy, if there exist matrices and and matrices , , and such that, for , the following optimization problem has a feasible solution:
**
subject to**Moreover, a desired full-order minimum entropy filter can be computed from (24).*

*Proof. *Employing the same arguments as in the proof of Theorem 6, it follows that the optimization problem of (33)-(34) is equivalent to
subject to ,
where and are as in (17) with , , , and replaced by , , , and , respectively.

Now, in view of the convexity of the uncertainty domain and considering that the inequalities (36) are affine in the matrices , , , and , we have the result that the optimization problem of (35)–(36) is equivalent to that of (18)–(20) with system matrix . This completes the proof.

##### 3.2. Reduced-Order Robust Filter Design

In this section, we will consider the design of reduced-order robust filter, that is, the case where the order of the filter is smaller than the order of the original system model. As the former, we first consider the case where the system matrix is perfectly known, that is, , which have the following result.

Theorem 8. *Consider system () with perfectly known system matrix . There exists a reduced-order minimum entropy filter of the form of (15) such that the filtering error system () in (16) is asymptotically stable with an disturbance attenuation level and a guaranteed minimum entropy, if there exist matrices and and matrices , , and such that the following optimization problem has feasible solution:
**
subject to
**
where and . Moreover, a desired reduced-order minimum entropy filter can be computed from
*

*Proof. *The proof is along the same lines as in the proof of Theorem 6. According to Theorem 5, is nonsingular if the optimization problem of (18)–(20) has feasible solutions since . Now, partition as
where and are symmetric positive definite matrices and . Without loss of generality, we assume that is nonsingular; to see this, let the matrix , where is a positive scalar and
With the same principle as in the proof of Theorem 6, it can be seen that there exists an arbitrarily small such that is nonsingular and (18)–(20) have feasible solutions with replaced by ; thus, we can conclude that there is no loss of generality to assume the matrix to be nonsingular.

Define the following matrices:
Performing congruence transformations to (19) and (20) by and , respectively, we have
Considering (17) and (41)–(44), we have
Substituting (47) into (45)-(46), we obtain (38)-(39), respectively.

The remainder of the proof follows along the same lines as in the proof of Theorem 6.

Now, considering the design of reduced-order robust filter, we give the following result without proof, which can be obtained by employing the same techniques used as those in Theorems 7 and 8.

Theorem 9. *Consider the system () with system matrix . There exists a reduced-order minimum entropy filter of the form of (15) such that the filtering error system () in (16) is asymptotically stable with an disturbance attenuation level and a guaranteed minimum entropy, if there exist matrices and and matrices , , and such that, for , the following optimization problem has feasible solution:
**
subject to
**
where and is defined in (38). Moreover, a desired reduced-order minimum entropy filter can be computed from (40).*

#### 4. Numerical Example

In this section, we present an illustrative example to demonstrate the effectiveness of the proposed algorithm. Consider the linear continuous-time system () in (1) with parameter matrix belonging to polyhedral domain , and assume , then the system data , are given as follows: First, we consider the full-order filter design; solving the LMIs condition in Theorem 7 by applying the well-developed LMI Toolbox in the MATLAB environment directly, we obtain that the minimum is , the minimum entropy of the filtering error system is (where denotes the transfer function of filtering error system), and With , , and in (3), the states of the full-order designed filter are given in Figure 1, where the initial condition is , and the exogenous disturbance input is given as , . Figure 2 shows the error response of .

Now, we consider the reduced-order filter design, and two cases of such filters are considered.

*Case 1. *Set ; that is, the order of the reduced filter is ; solving the LMIs condition in Theorem 9, we obtain that the minimum is , the minimum entropy of the filtering error system is , and
Under the same conditions as in the full-order filter design, the states of the designed reduced-order filter are given in Figure 3. Figure 4 shows the error response of .

*Case 2. *Set ; that is, the order of the reduced filter is ; by solving the LMIs condition in Theorem 9, we obtain that the minimum is , the minimum entropy of the filtering error system is , and
The states and the filtering error of the designed reduced-order filter are given in Figures 5 and 6, respectively.

#### 5. Conclusion

In this paper, the robust minimum entropy filter has been designed for linear continuous-time systems with polytopic parameter uncertainty. Sufficient conditions have been established for the existence of general full- and reduced-order minimum entropy filters in terms of LMIs, which guarantee the filtering error system to be robustly asymptotically stable and to have a prescribed performance as well as a guaranteed minimum entropy. The filler design could be cast into a convex optimization problem and a numerical example has been provided to demonstrate the effectiveness of the proposed design method.

#### Conflict of Interests

The authors declare that there is no conflict of interests regarding the publication of this paper.

#### Acknowledgments

This work has been supported by the National Natural Science Foundation of China (Grant no. 61104109), the Natural Science Foundation of Jiangsu Province of China (Grant no. BK2011703), the Support of Science and Technology and Independent Innovation Foundation of Jiangsu Province of China (Grant no. BE2012178), and the Doctoral Fund of Ministry of Education of China (Grant no. 20113219110027).

#### References

- L. Wu, P. Shi, and H. Gao, “State estimation and sliding-mode control of Markovian jump singular systems,”
*IEEE Transactions on Automatic Control*, vol. 55, no. 5, pp. 1213–1219, 2010. View at Publisher · View at Google Scholar · View at MathSciNet - I. R. Petersen and A. V. Savkin,
*Robust Kalman Filtering for Signals and Systems with Large Uncertainties*, Control Engineering, Birkhäuser, Boston, Mass, USA, 1999. View at Publisher · View at Google Scholar · View at MathSciNet - P. Shi, “Robust Kalman filtering for continuous-time systems with discrete-time measurements,”
*IMA Journal of Mathematical Control and Information*, vol. 16, no. 3, pp. 221–232, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. E. de Souza and A. Trofino,
*An LMI Approach to the Design of Robust*, SIAM, Philadelphia, Pa, USA, 1999.*ℋ*_{2}fiLters - J. C. Geromel and M. C. de Oliveira, “
*ℋ*_{2}and*ℋ*_{∞}robust filtering for convex bounded uncertain systems,”*IEEE Transactions on Automatic Control*, vol. 46, no. 1, pp. 100–107, 2001. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - H. Gao and C. Wang, “Delay-dependent robust
*ℋ*_{∞}and*ℒ*_{2}-*ℒ*_{∞}filtering for a class of uncertain nonlinear time-delay systems,”*IEEE Transactions on Automatic Control*, vol. 48, no. 9, pp. 1661–1666, 2003. View at Publisher · View at Google Scholar · View at MathSciNet - S. Xu, “Robust
*ℋ*_{∞}filtering for a class of discrete-time uncertain nonlinear systems with state delay,”*IEEE Transactions on Circuits and Systems I*, vol. 49, no. 12, pp. 1853–1859, 2002. View at Publisher · View at Google Scholar · View at Scopus - S. Xu and T. Chen, “Reduced-order
*ℋ*_{∞}filtering for stochastic systems,”*IEEE Transactions on Signal Processing*, vol. 50, no. 12, pp. 2998–3007, 2002. View at Publisher · View at Google Scholar · View at MathSciNet - A. Elsayed and M. J. Grimble, “A new approach to the
*ℋ*_{∞}design of optimal digital linear filters,”*IMA Journal of Mathematical Control and Information*, vol. 6, no. 2, pp. 233–251, 1989. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. H. Jin and J. B. Park, “Robust
*ℋ*_{∞}filtering for polytopic uncertain systems via convex optimisation,”*IEE Proceedings*, vol. 148, no. 1, pp. 55–59, 2001. View at Publisher · View at Google Scholar · View at Scopus - H. Li and M. Fu, “Linear matrix inequality approach to robust
*ℋ*_{∞}filtering,”*IEEE Transactions on Signal Processing*, vol. 45, no. 9, pp. 2338–2350, 1997. View at Publisher · View at Google Scholar · View at Scopus - H. Gao and C. Wang, “Robust
*ℒ*_{2}-*ℒ*_{∞}filtering for uncertain systems with multiple time-varying state delays,”*IEEE Transactions on Circuits and Systems. I*, vol. 50, no. 4, pp. 594–599, 2003. View at Publisher · View at Google Scholar · View at MathSciNet - L. Wu, P. Shi, H. Gao, and C. Wang, “
*ℋ*_{∞}filtering for 2D Markovian jump systems,”*Automatica*, vol. 44, no. 7, pp. 1849–1858, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Wu, J. Lam, W. Paszke, K. Galkowski, and E. Rogers, “Robust
*ℋ*_{∞}filtering for uncertain differential linear repetitive processes,”*International Journal of Adaptive Control and Signal Processing*, vol. 22, no. 3, pp. 243–265, 2008. View at Publisher · View at Google Scholar · View at MathSciNet - L. Wu and J. Lam, “Weighted
*ℋ*_{∞}filtering of switched systems with time-varying delay: average dwell time approach,”*Circuits, Systems, and Signal Processing*, vol. 28, no. 6, pp. 1017–1036, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Wu, P. Shi, H. Gao, and C. Wang, “A new approach to robust
*ℋ*_{∞}filtering for uncertain systems with both discrete and distributed delays,”*Circuits, Systems, and Signal Processing*, vol. 26, no. 2, pp. 229–248, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - L. Wu, P. Shi, C. Wang, and H. Gao, “Delay-dependent robust
*ℋ*_{∞}and*ℒ*_{2}-*ℒ*_{∞}filtering for LPV systems with both discrete and distributed delays,”*IEE Proceedings*, vol. 153, no. 4, pp. 483–492, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - P. A. Iglesias and D. Mustafa, “State-space solution of the discrete-time minimum entropy control problem via separation,”
*IEEE Transactions on Automatic Control*, vol. 38, no. 10, pp. 1525–1530, 1993. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - P. A. Iglesias, D. Mustafa, and K. Glover, “Discrete time
*ℋ*_{∞}controllers satisfying a minimum entropy criterion,”*Systems & Control Letters*, vol. 14, no. 4, pp. 275–286, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - D. Mustafa and K. Glover,
*Minimum Entropy*, vol. 146 of*ℋ*_{∞}Control*Lecture Notes in Control and Information Sciences*, Springer, Berlin, Germany, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. A. Peters and P. A. Iglesias,
*Minimum Entropy Control for Time-Varying Systems*, Systems & Control: Foundations & Applications, Birkhäuser, Boston, Mass, USA, 1997. View at Publisher · View at Google Scholar · View at MathSciNet - S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan,
*Linear Matrix Inequalities in System and Control Theory*, vol. 15 of*SIAM Studies in Applied Mathematics*, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, Pa, USA, 1994. View at Publisher · View at Google Scholar · View at MathSciNet