Mathematical Problems in Engineering

Volume 2008, Article ID 583947, 12 pages

http://dx.doi.org/10.1155/2008/583947

## Guaranteed Performance Robust Kalman Filter for Continuous-Time Markovian Jump Nonlinear System with Uncertain Noise

Department of Mechanical Engineering, Hanyang University, 17 Haengdang-dong, Seongdong-gu, Seoul 133-791, South Korea

Received 29 January 2008; Accepted 13 July 2008

Academic Editor: Paulo Gonçalves

Copyright © 2008 Jin Zhu 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

Robust Kalman filtering design for continuous-time Markovian jump nonlinear systems with uncertain noise was investigated. Because of complexity of Markovian jump systems, the statistical characteristics of system noise and observation noise are time-varying or unmeasurable instead of being stationary. In view of robust estimation, maximum admissible upper bound of the uncertainty to noise covariance matrix was given based on system state estimation performance. As long as the noise uncertainty is limited within this bound via noise control, the Kalman filter has robustness against noise uncertainty, and stability of dynamic systems can be ensured. It is proved by game theory that this design is a robust mini-max filter. A numerical example shows the validity of this design.

#### 1. Introduction

Optimal filtering problem has been a hot topic in past decades, within which Kalman filtering is one of the most popular estimation approaches and considerable effort has been devoted to its theory and applications. The applications of Kalman filtering theory may be found in a large spectrum of different fields ranging from various engineering problems to biology, geoscience, economics, and management [1]. For standard Kalman filtering, one of the key assumptions is that system noise and observation noise are Gaussian, whose covariances are known and stationary. However, in many actual problems, the statistical characteristics (covariances) of noise may be time-varying instead of being stationary, and in some cases it is impossible to get the exact measurement values, which means that the noise covariances are uncertain instead of being exactly known; for this reason, the stochastic noise is called “uncertain." Consequently, the standard Kalman filter may not be robust against modeling uncertainty and disturbances. Thus, the study of a robust state estimation approach is of practical importance and has been attracting more interest over the past few years. A useful approach is to use a game-theoretic formulation with which one minimizes the worst performance stimulated by uncertain factors, and some corresponding results of robust filtering for linear systems with uncertain noise have been addressed in [2–4].

On the other hand, Markovian jump systems, which are
convenient tools for representing many real-world systems [5], have aroused much attention
in recent years. In the case of fault detection, fault-tolerant control, and
multimodal control, discrete jumps in the continuous dynamics are used to model
component failures and sudden switch of system dynamics. With further study of
Markovian jump systems, many achievements have been made in the last decade on
stability analysis [6, 7], filtering [8, 9], and controller design [10, 11]. Among the efforts towards
filtering, Shi et al. [12]
and Mahmoud et al. [13] gave
Kalman filtering equations for continuous-time and discrete-time Markovian jump
linear systems with structure uncertainty, respectively. However, in the above-referred contributions, all the research work is facing the same problem as
that of nonjump systems; both the state equation and output measurement are
subjected to *stationary* Gaussian noise so that an optimal filtering gain
is obtained based on the stationary noise covariance matrix. But this is only
an ideal assumption for Markovian jump systems. As we know, Markovian jump
systems are used to represent a class of systems which are usually accompanied
by sudden changes of working environment or system dynamics. For this reason,
noise uncertainty occurs more frequently or with more probability than in
nonjump systems. Moreover, with the uncertainty to noise covariance matrix
increasing, the estimation of system state tends to be inaccurate or false,
which may cause errors in control signals and in worst case may lead to
breakdown of the whole dynamic systems.

To avoid this tragical situation, a direct way dealing with this problem is to redesign Kalman filter for jump systems by using new noise covariance matrix. But as we have pointed out above, it is almost impossible to get the real-time information of noise covariance matrix since it is time-varying or unmeasurable; therefore we could not update Kalman filter gain online. Another feasible way is to give an admissible bound for estimation performance of system state so that the predesigned Kalman filter will remain effective and the system operates in the course of nature as long as the real-time estimation error is within this precision. To achieve this purpose, we perform the following design method. By using the view of robust estimation, a maximum bound of noise covariance matrix uncertainty is obtained through calculation according to admissible bias for estimation performance of system state. If we could ensure the noise uncertainty to be within this bound via technical method such as noise control, the estimation of system state can be within a desired precision, and thus stability of the whole dynamic process can be achieved. It should be noted that in this research work, we do not mean to eliminate the effect of noise entirely because it is almost impossible or highly costly to do so in practical environment. Our work focuses on the upper bound of noise change level; thus it means only that the change to noise covariance matrix is required to be limited within this bound no matter what the stationary covariance matrix is.

In this paper, robust Kalman filtering for continuous-time Markovian jump nonlinear systems with uncertain noise is considered. Firstly, we give some assumptions so that the nonlinear jump systems can be modeled as a linear one by local linearization. Secondly, we seek the maximum upper bound of nonstructural uncertainty to noise covariance matrix such that the deviation of performance can be within a prescribed precision. Then, we discuss the analytical solution of maximum bound using method. Finally, we prove the establishment of saddle inequality, and show that this filter design is a mini-max robust filter using game theory. At the end of the paper, an illustrative example is used to show the validity of our method.

#### 2. Problem Description

Throughout the paper, unless otherwise specified, we denote by a complete probability space with filtration satisfying the usual conditions (i.e., it is right-continuous, and contains all -null sets). Let stand for the usual Euclidean norm for a vector , and let denote the Frobenius norm of a matrix defined by , where is the maximum eigenvalue of matrix and the superscript represents transpose. Operator denotes the matrix trace, and we denote by that matrix is positive definite (semipositive definite). Let be a right-continuous Markov process on the probability space taking values in finite state space with being the chain generator, an matrix. The entries are interpreted as transition rates such that where and . Here, is the transition rate from to . Notice that the total probability axiom imposes and Consider the following continuous-time Markovian jump nonlinear system with uncertain noise: where is state vector, and is measurement output. and are nonlinear vector functions. and are -dimensional and -dimensional white noises and satisfy the following assumption.

*Assumption 2.1. *For any given time ,
there are

(1)(2)(3)(4) In Assumption 2.1, and consist of two parts, where and denote the stationary noise covariance matrix,
whose values are exactly known. and denote the noise uncertainty caused by
time-varying or sudden switch of system dynamics; they are unknown but
norm-bounded. is a function taking values in .
For the deduction of robust Kalman filter, we introduce the following
assumption.

*Assumption 2.2. *For any fixed system mode and vector ,
the nonlinear vector functions are assumed to satisfy and where are Jacobian matrices of ,
and satisfy where ,
and are known constant matrices, and is unknown matrix satisfying .
Establishing Assumption 2.2, the Markovian jump nonlinear system could be
transformed to a nominal linear model via local linearization
technique: For simplification, we denote and by ,
and .

Theorem 2.3. *Consider
stochastically stable Markovian jump system (2.6), and assume that the noise is
stationary, which means that .
Then, one has the following standard Kalman filter
(see [12]): ** where filtering gain is given by the following coupled Riccati
equations: ** Here,
matrices and scalar are chosen so that reaches the minimum.**With the above standard Kalman filter gain adopted, the state estimation error
is *

Define the estimation error performance as According to Theorem 2.3 and the quality of Kalman filtering, if the noise is stationary , the estimation error performance can achieve the minimum value by adopting standard Kalman filtering (2.7).

Now, we consider that the noise is not stationary, which means that and ; thus the new covariance matrix of noise is . If we still adopt the former predesigned standard Kalman filter gain , the new state estimation error should be , which satisfies Therefore, the new estimation error performance is

According to (2.10) and (2.12), the deviation of estimation error performance yielded by noise uncertainty can be written as where is a parameter which is given according to detailed precision request of practical dynamic process.

Our design purpose is shown in Figures 1 and 2. Suppose that the noise is stationary with covariance matrix , and that the system filtering performance is with standard filtering gain adopted as shown in Figure 1. But now noise is with uncertainty ; the former designed Kalman filter gain will no longer be an optimal one. If we still want to get the precise estimation of system state so that the dynamic system could remain stable, there are two choices. One is to update the Kalman filter gain according to new noise covariance matrix , but this way is impossible or highly costly. Another way is to still adopt the former designed filtering gain and take some actions in noise control. Based on this idea, the new estimation performance is with adopted, and a deviation occurs resulting from noise uncertainty (see Figure 2). For the robustness of system, which means that is less than an admissible precision , there must be some limitation to noise uncertainty. Using the view of robust estimation, we are trying to find a maximum upper bound for the uncertainty to noise covariance matrix. As long as the noise uncertainty is controlled to satisfy via noise control, we will achieve deviation of estimation performance to be within the admissible precision , which means that ; thus the general system has robustness to noise uncertainty, and stability of the whole dynamic process can be maintained whatever the original stationary noise covariance matrix is. In the following part of this paper, we seek the solution of maximum upper bound .

#### 3. Upper Bound of Nonstructural Noise Uncertainty

##### 3.1. Mathematical Expression of Upper Bound

According to (2.8) and (2.11), we have where . From the above equation, it is easily seen that is a linear mapping of . Define a compact convex set as ; thus the deviation of performance is a mapping from to , and it has the following facts.

*Fact 1. *For any given noise uncertainty ,
if and ,
one has

*Fact 2. *Define the maximum
admissible deviation of estimation performance as Thus, could be achieved only by maximum noise
uncertainty ,
which means that The purpose of the following work is to construct a
maximal compact convex set ,
as long as the noise uncertainty satisfies , (2.13) is sure to establish. According to the finity of mode , (2.13) is equivalent to Therefore, for each mode ,
there is Define the maximum upper bound
of noise uncertainty as ;
thus Substituting the above
inequalities into (3.1) and (3.6), one has where matrices satisfy the following coupled Riccati
equations: According to the above analysis,
seeking a maximum upper bound of noise uncertainty is equivalent to obtaining the optimal
solution of : Thus, seeking the optimal
solution is transformed to a nonlinear programming
problem with linear inequalities' constraints. Now, we discuss how to find the
analytical solution of such problem.

##### 3.2. Analytical Solution

Since is a compact convex set and the inequalities' constraints in (3.10) compose a compact set on which is defined as a continuous function, thus the nonlinear programming problem must have optimal solution and the existence of solution is proved. Next, we will seek the analytical solution .

Decompose the original nonlinear programming problem (see (3.10)) into subproblems: By using method, we have the optimal analytical solution for each subproblem as Thus, the analytical solution for the original nonlinear programming problem (see (3.10)) is given as

*Remark 3.1. *The analytical solution
of the nonlinear programming problem is given by the above analysis; however,
it is only an optimal solution for each subproblem. This analytical solution in
(3.13) is local optimal, but global suboptimal. For the global optimal solution,
we could only get the numerical solution using “fmincon" function in
MATLAB software. The optimal analytical solution of such nonlinear programming
problem is still an open problem in mathematics for further
exploration.

Theorem 3.2. *Consider Markovian jump system (2.6). If one adopts state estimator (2.7)
and Kalman filter gain (2.8), there exists a maximum admissible compact set .
As long as the uncertainty to noise covariance matrix satisfies ,
the deviation of system state estimation error performance is within a given precision .*

*Remark 3.3. *Take into account the existence of noise
uncertainty, and the new noise covariance matrix is given as .
Thus, the former predesigned optimal Kalman filter gain ,
which is deduced from stationary noise ,
will no longer be optimal and may cause distortion of control signals. But,
this does not mean that we need to redesign Kalman filter. According to the
above analysis, if we can successfully limit noise uncertainty to be within an admissible compact set ,
the predesigned Kalman filter gain can still be effective though it is not
optimal. Moreover, the deviation of estimation performance is ensured to be
within a desirable precision .

#### 4. Mini-Max Robust Filter

Let denote the standard Kalman filtering gain according to new noise covariance matrix pair , which corresponds to the maximum admissible noise uncertainty ; thus satisfy According to the least-square quality of standard Kalman filtering, we have On the other hand, with the establishment of Fact 1, there is Thus, we have the following saddle-point inequality: By game theory, we have This means that the optimal estimation under the worst situation is a mini-max filter. It cannot only minimize the estimation performance under the largest noise uncertainty , but can also ensure the deviation to be within a given precision . For this reason, this Kalman filter design is a robust mini-max filter.

*Remark 4.1. *Traditional Kalman filtering design is
performed on the basis that noise covariance matrix is stationary and exactly
known, and it will fail when the noise covariance matrix is unknown or has
uncertainty. In our method, the filter design could be divided into two steps.
Firstly, we design standard Kalman filter according to the stationary noise
covariance matrix ,
then via some technical methods such as noise control we impose the noise
uncertainty to be within the given bound ,
which could be presented in the form of nonstructural .
In practical dynamic process, when the noise uncertainty reaches the maximum,
the ideal deviation of performance is ,
and this deviation is less than the worst case ,
which ensures the estimation of system states and control signals to be
precise to some extent, and the synthetical system to be
robust and stable. For this reason, the Kalman filter design has robustness to
noise uncertainty, and
according to (4.5), this filter is also a mini-max filter .

#### 5. Simulation

Consider the following two-mode Markovian jump system.

Let the system mode be given by Let the system mode be given by where uncertain state and measurement noise are and ; its stationary covariance matrix is known as ; system mode transition matrix is ; the admissible bound of performance deviation is .

The detailed algorithm is as follows.

(1)By applying Assumption 2.1, we have , . Notice that ; thus (2)Solve (2.8) and get and .(3)Substitute the result to (3.10), using method; the upper bound of noise uncertainty is given as (4)Let the new noise covariance matrix correspond to the maximum uncertainty: (5)Repeat step (2), and we have the correspondent for new noise covariance matrix : (6)Applying the robust Kalman filtering, there is saddle-point inequality: From the above simulation, it is seen that with the noise uncertainty being limited within the upper bound via noise control, the deviation of system estimation performance is less than the admissible precision . Because the analytical solution is global suboptimal, the deviation of system estimation performance (0.2337) is obviously less than admissible precision (0.3), which means that this solution is a conservative one and the global optimal solution of could be a little greater than . Thus, this method allows flexibility to the designer to some extent.

#### 6. Conclusion

In this paper, robust Kalman filter for continuous-time Markovian jump nonlinear systems with uncertain noise is considered. For the stability of dynamic system when statistical information of noise is unavailable, a new design method is given by obtaining the maximum admissible bound of uncertainty to noise covariance matrix. Based on this, the deviation of system estimation performance is thus guaranteed to be within a given precision. Furthermore, the worst performance yielded by noise uncertainty can be minimized by this method since it is a mini-max robust filter. The analytical solution of the bound to noise uncertainty is also discussed in this paper, which is a global, suboptimal, and conservative solution using method. The simulation results show the validity of this design.

#### Acknowledgment

This work has been funded by BK21 research project: Switching Control of Systems with Structure Uncertainty and Noise.

#### References

- B. D. O. Anderson and J. B. Moore,
*Optimal Filtering*, Prentice-Hall, Englehood Cliffs, NJ, USA, 1979. View at Zentralblatt MATH - V. Poor and D. P. Looze, “Minimax state estimation for linear stochastic systems with noise uncertainty,”
*IEEE Transactions on Automatic Control*, vol. 26, no. 4, pp. 902–906, 1981. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - S. Sangsuk-Iam and T. E. Bullock, “Analysis of continuous-time Kalman filtering under incorrect noise covariances,”
*Automatica*, vol. 24, no. 5, pp. 659–669, 1988. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - Y.-L. Chen and B.-S. Chen, “Minimax robust deconvolution filters under stochastic parametric and noise uncertainties,”
*IEEE Transactions on Signal Processing*, vol. 42, no. 1, pp. 32–45, 1994. View at Publisher · View at Google Scholar - M. Mariton,
*Jump Linear Systems in Automatic Control*, Marcel-Dekker, New York, NY, USA, 1990. View at Zentralblatt MATH - Y. Ji and H. J. Chizeck, “Controllability, stabilizability, and continuous-time Markovian jump linear quadratic control,”
*IEEE Transactions on Automatic Control*, vol. 35, no. 7, pp. 777–788, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - X. Feng, K. A. Loparo, Y. Ji, and H. J. Chizeck, “Stochastic stability properties of jump linear systems,”
*IEEE Transactions on Automatic Control*, vol. 37, no. 1, pp. 38–53, 1992. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - F. Dufour and P. Bertrand, “The filtering problem for continuous-time linear systems with Markovian switching coefficients,”
*Systems & Control Letters*, vol. 23, no. 6, pp. 453–461, 1994. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - C. E. de Souza, A. Trofino, and K. A. Barbosa, “Mode-independent ${\text{H}}_{\infty}$ filters for Markovian jump linear systems,”
*IEEE Transactions on Automatic Control*, vol. 51, no. 11, pp. 1837–1841, 2006. View at Publisher · View at Google Scholar · View at MathSciNet - S. K. Nguang and P. Shi, “Robust ${\text{H}}_{\infty}$ output feedback control design for Takagi-Sugeno systems with Markovian jumps: a linear matrix inequality approach,”
*Journal of Dynamic Systems, Measurement and Control*, vol. 128, no. 3, pp. 617–625, 2006. View at Publisher · View at Google Scholar - J. Zhu, H. Xi, H. Ji, and B. Wang, “A robust adaptive controller for Markovian jump uncertain nonlinear systems with Wiener noises of unknown covariance,”
*International Journal of Control, Automation and Systems*, vol. 5, no. 2, pp. 128–137, 2007. View at Google Scholar · View at Zentralblatt MATH - P. Shi, E.-K. Boukas, and R. K. Agarwal, “Kalman filtering for continuous-time uncertain systems with Markovian jumping parameters,”
*IEEE Transactions on Automatic Control*, vol. 44, no. 8, pp. 1592–1597, 1999. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet - M. S. Mahmoud, P. Shi, and A. Ismail, “Robust Kalman filtering for discrete-time Markovian jump systems with parameter uncertainty,”
*Journal of Computational and Applied Mathematics*, vol. 169, no. 1, pp. 53–69, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet