Abstract

The classical recursive three-step filter can be used to estimate the state and unknown input when the system is affected by unknown input, but the recursive three-step filter cannot be applied when the unknown input distribution matrix is not of full column rank. In order to solve the above problem, this paper proposes two novel filters according to the linear minimum-variance unbiased estimation criterion. Firstly, while the unknown input distribution matrix in the output equation is not of full column rank, a novel recursive three-step filter with direct feedthrough was proposed. Then, a novel recursive three-step filter was developed when the unknown input distribution matrix in the system equation is not of full column rank. Finally, the specific recursive steps of the corresponding filters are summarized. And the simulation results show that the proposed filters can effectively estimate the system state and unknown input.

1. Introduction

The traditional Kalman filter [1] and its extension can recursively estimate the state of the linear system with process noise and measurement noise. The time-domain recursive filter brings greater convenience for continuously processing input data, so it can play a more important role in control theory and engineering. The Kalman filter requires the noise to be stationary white noise, but this supposition is sometimes not feasible because unknown input may not be white noise and cannot be measured.

In the fields of environmental monitoring [2] and disturbance suppression [3, 4], the system equation or output equation contains unknown input owing to environmental impacts and improper selection of model parameters. In recent decades, the problem of state estimation with unknown input has received extensive attention.

For continuous-time systems, the necessary and sufficient conditions for the existence of optimal state filters have been established [57]. Furthermore, the steps to reconstruct unknown input are also quite complete [8, 9]. For the state estimation problem of discrete-time systems, an early solution was to add an unknown input vector to the system state vector. Then, the Kalman filter was used to estimate the augmented state. However, the scenarios of using this solution are limited to that the dynamical evolution of unknown input is known [10, 11]. In order to reduce computation costs of the augmented state filter, Friedland [11] proposed the two-stage Kalman filter in which the state estimation and unknown input estimation are decoupled. Although this filter has been successfully applied in some instances, it is still limited to the requirement that the dynamic evolution of unknown input is available. When the unknown input only affects the system equation, Kitanidis [5] developed an optimal recursive state filter which can estimate the system state without prior knowledge of the unknown input. And the stability and convergence conditions of the above filter were raised by Darouach and Zasadzinski [12]. Further, Darouachet al. [13] extended this filter. So, the filter is valid when unknown input is directly feedthrough to the output equation; that is, the unknown input affects both the system equation and output equation.

Although the above methods can get the estimation value of the system state, they all ignore obtaining the estimation value of unknown input, which is necessary in some practical applications.

Hsieh [14] established a robust two-stage Kalman filter (RTSKF). For systems without direct feedthrough of unknown input to output, it can give the joint state and unknown input estimation. But the optimality of the unknown input estimation has not been proven. Furthermore, Gillijns and De Moor [15] proposed a recursive three-step filter (RTSF), which gave a proof that the unknown input estimation is optimal. And the form of the unknown input estimation obtained by RTSF is consistent with that of RTSKF. On the other hand, Gillijns and De Moor [16] extended RTSF so that it is still valid for linear discrete-time systems with direct feedthrough.

Despite the fact that the above filters can solve the problem of simultaneously estimating system state and unknown input, they are based on a precondition: the distribution matrix of unknown input must be of full column rank.

For systems with direct feedthrough, if the distribution matrix of unknown input in output equation is not of full column rank, Cheng et al. [17] presented an unbiased minimum-variance state estimation (UMVSE). This method transforms the output equation by singular value decomposition of the distribution matrix. Then UMVSE is applied to address the problem of state estimation for the new system. However, this method omitted the estimation of unknown input. Hsieh [18] used an extension of RTSF (ERTSF) to estimate the unknown input and state under the assumption that the distribution matrix is not of full column rank, but some parameters in ERTSF were obtained by experience. This paper put forward the novel recursive three-step filter with direct feedthrough (NRTSF-DF) which can give estimation value of the state and unknown input under the same assumption. And compared with ERTSF, the parameter of NRTSF-DF can be exactly obtained. For systems without direct feedthrough, the problem of filter design with unknown input still exists though there are few related literature studies about it. Similar to NRTSF-DF, the novel recursive three-step filter (NRTSF) is proposed in this paper. The novel filters can achieve a simultaneous estimation of the system state and unknown input under the condition that the unknown input distribution matrix is not of full column rank.

In recent years, the research of estimating system state with unknown input is concentrated on nonlinear systems. Based on the EKF structure, the filters estimating the state of the nonlinear system were designed in [19, 20]. Furthermore, by making some improvements on UKF [21], study [22] obtained the filter with RTSF form. And the filter can estimate the state and unknown input simultaneously.

This paper is organized as follows: in Section 2, the problem is formulated. Section 3 deals with the design of the optimal filter for the system with direct feedthrough, and the specific structure of NRTSF-DF is summarized. Next, the optimal filter for the system without feedthrough is established in Section 4. The structure of NRTSF is also obtained. Finally, Section 5 demonstrates the effectiveness of the proposed filters through simulation.

2. Problem Formulation

Consider the linear discrete-time-varying system:where is the state vector, is an unknown input vector, and is the measurement. The process noise and the measurement noise are assumed to be mutually uncorrelated, zero-mean, white random signals with known covariance matrices, , and , respectively. The time-varying matrices , and are known with an appropriate dimension. Throughout the paper, the conditions that is observable and that is independent of and are satisfied. And the unbiased estimate with is known.

The optimal filtering problem of the above system is to obtain the unbiased optimal filtering sequence of unknown input and state recursively based on the initial estimate , the covariance matrix , and the sequence of measurement . If , the system is transformed into a linear discrete-time-varying system without direct feedthrough of unknown input to output. Then, the corresponding optimal filtering problem is transformed to obtain the unbiased optimal filtering sequence of unknown input and state under the corresponding conditions.

3. NRTSF-DF

The RTSF proposed by Steven Gilljins in [16] can solve the state and unknown input estimation problem of linear system (1)-(2) while . When the unknown input distribution matrix in the output equation is not of full column rank, that is, , we consider a NRTSF-DF design method. The following is the derivation process.

If , perform full rank decomposition:where , and . The full rank decomposition steps are given in Appendix.

Defining the virtual unknown input by , then . If the estimation value of is expressed as , the minimal norm estimation value of unknown input iswhere is the Moore–Penrose inverse of . Then, original output equation (2) is rewritten aswhere is the virtual unknown input vector.

Based on the system state equation (1) and output equation (5), we consider NRTSF-DF of the formwhere the matrices and still have to be determined.

3.1. Time Update

Let and denote the optimal unbiased estimates of and given measurement sequence ; then, the time update is

The error in the estimate is given bywhere and . Consequently, the covariance matrix of is given bywith .

3.2. Virtual Unknown Input Estimation

In this section, the estimation of the virtual unknown input is considered.

3.2.1. Unbiased Virtual Unknown Input Estimation

Defining the innovation , it follows from (5) thatwhere is given by

Owing to is unbiased, and . So, we can obtain an unbiased estimate of the virtual unknown input from .

Theorem 1. Suppose is unbiased; then, (6) and (7) calculate the unbiased value of if and only if satisfies .

Proof. This process is similar to the proof of Theorem 1 in [16], so it is omitted.
From Theorem 1, is a necessary and sufficient condition for an unbiased virtual unknown input estimator of form (7). The matrix corresponding to the least-squares (LS) solution of (12) satisfies Theorem 1. But from the Gauss–Markov theorem, the LS solution is not necessarily minimum-variance as a result ofwhere c is a positive real number.

3.2.2. MVU Virtual Unknown Input Estimation

An MVU estimate of is calculated by weighted LS (WLS) estimation.

Theorem 2. Let be unbiased, and let and be nonsingular; then, for(4) is the MVU estimator of . The variance of the optimal virtual unknown input estimate is

Proof. This process is similar to the proof of Theorem 2 in [16], so it is omitted.
We use to express the optimal virtual unknown input estimate corresponding to and let . Then, is given by

3.3. Measurement Update

In the last step, we use measurement to update . Using (8) and (12), we find that

Consequently, (8) is unbiased for all if and only if contents

Suppose satisfy (19), from (18):

So, we can calculate by minimizing the trace of (20) under the unbiasedness constraint of (19).

Theorem 3. is given bywhere minimizes the trace of (20) under the constraint of (19).

Proof. This process is similar to the proof of Theorem 3 in [16], so it is omitted.
We use to express the state estimate corresponding to . From (7) and (21),Then, we consider the expressions of and , whereFrom (20) and (21), we obtainUsing (23) and (17), it follows thatFurthermore, by , we can get

3.4. Summary of NRTSF-DF Equations

In order to reflect NRTSF-DF clearly, summarize it as follows:

3.4.1. Time Update

Based on the unbiased estimates and , the state estimates and corresponding variance matrix from the time instant k−1 to k are obtained:

3.4.2. Estimation of Virtual Unknown Input

Calculate the rank of , make full rank decomposition of , and calculate the virtual unknown input estimates and corresponding variance matrix at time instant k:

3.4.3. Measurement Update

Calculate the state estimate and corresponding variance matrix at time instant k:

Also, note that if is of full column rank, letting and , RTSF is obtained.

4. NRTSF

If , systems (1) and (2) are transformed into a linear discrete-time-varying system without direct feedthrough of unknown input to output. It can be expressed as

The classical filter proposed by Gilljins and De Moor in [15] can solve the state estimation problem when , but the application conditions to use this filter are that the unknown input distribution matrix in the system equation must meet .

When the unknown input distribution matrix is not of full column rank, that is, , then the classical filter cannot be used. Similar to Section 3, we can also consider an NRTSF design method. The following is the NRTSF derivation process.

If , perform full rank decomposition:where , and . The full rank decomposition steps are given in Appendix.

Defining the virtual unknown input by , then . Because the unknown input is estimated with one step delay, the estimation value of is expressed as and the minimal norm estimation value of the unknown input iswhere is the Moore–Penrose inverse of . Then, original system equation (30) is rewritten aswhere is the virtual unknown input vector.

Based on the system state equation (34) and output equation (31), we consider NRTSF of the formwhere the matrices and still have to be determined. Compared with the previous section, the obvious difference is that the second step in NRTSF calculates the value of virtual unknown input , while the previous filter yields an estimate of virtual unknown input .

4.1. Time Update

Let express the optimal unbiased estimates of given measurement sequence ; then, the time update is

Similarly, the covariance matrix of is given bywith .

4.2. Virtual Unknown Input Estimation

The derivation idea in this section is the same as Section 3.2 except that the time index of unknown input is different.

4.2.1. Unbiased Virtual Unknown Input Estimation

Defining the innovation , it follows from (31), (34), and (35) thatwhere is given by

Due to the fact that is unbiased, we can obtain an unbiased estimate of the virtual unknown input from .

Theorem 4. Suppose is unbiased; then, (35) and (36) calculate the unbiased value of if and only if satisfies .

Proof. This process is similar to the proof of Theorem 1, so it is omitted.
The matrix corresponding to the LS solution of (40) satisfies Theorem 4. But from the Gauss–Markov theorem, it is not necessarily minimum-variance as a result ofwhere c is a positive real number.

4.2.2. MVU Virtual Unknown Input Estimation

Through weighted LS estimation, we obtain an MVU estimate of .

Theorem 5. Let be unbiased and let and be positive definite; then, forwhere , (33) is the MVU estimator of . The variance of the corresponding input estimate is

Proof. This process is similar to the proof of Theorem 2, so it is omitted.

4.3. Measurement Update

First, the estimator must satisfy , which can be expressed as

Consequently, (37) is unbiased for all possible if and only if satisfies

Let satisfy (46); then, is given by

So, we can calculate by minimizing the trace of (47) under the unbiasedness constraint of (46).

Theorem 6. is given bywhere minimizes the trace of (47) under the constraint of (46).

Proof. This process is similar to the proof of Theorem 3, so it is omitted.
Substituting (48) in (37) yields the equivalent state update:Form (47) and (48),

4.4. Summary of NRTSF Equations
4.4.1. Time Update

Based on the unbiased estimates , the state estimates and corresponding variance matrix from time instant k−1 to k are obtained:

4.4.2. Estimation of Virtual Unknown Input

Calculate the rank of , make full rank decomposition of , and calculate the virtual unknown input estimates and corresponding variance matrix at time instant k:

4.4.3. Measurement Update

Calculate the state estimate and corresponding variance matrix at time instant k:

5. Example

In this section, we consider the state and unknown input estimation problem when the system is interfered by as well as zero-mean Gaussian white noise. Specifically, the estimation problem we consider were given in Du [23]. The parameters for the linear system are given by

The unknown input used in this example is given in Figure 1.

The results of using NRTSF-DF to estimate the unknown input are presented in Figure 2. From Figure 2, NERTSF-DF can estimate the unknown inputs but has no effect on . The reason is that the direct feedthrough matrix is not of full column rank and, therefore, there is no information about the unknown input in the measurement.

Since the unknown input only affects the first three elements of the system state, we only plot the true value and estimated value of the first, second, and third element of state vector in Figure 3. And the estimation errors of , and are shown in Figure 4. It can be seen from the figure that the state estimation value can track the true value.

For the linear system without direct feedthrough of unknown input to output, let and ; then, the system is transformed into a linear discrete system without direct feedthrough.

The results of using NRTSF to estimate the unknown input are shown in Figure 5. The NRTSF has no effect on because is not of full column rank. And there is no information about the unknown input in the system state. Furthermore, there is no information about the in measurement.

Figures 6 and 7 show the true value, estimation value, and the estimation error of the first three elements of the state vector, respectively. From the figure, NRTSF is effective.

6. Conclusion

This paper discusses the problem of joint state and unknown input estimation for linear systems with an unknown input and proposes two novel filters, respectively, in accordance with the linear minimum-variance unbiased estimation criterion. For systems with direct feedthrough, a novel recursive three-step filter with direct feedthrough is proposed. This filter can solve the problem that the classical recursive three-step filter cannot be used when the unknown input distribution matrix is not of full column rank. For the situation that unknown input only affects system equation and the distribution matrix is not of full column rank, a novel recursive three-step filter is proposed. The simulation results show that both of the proposed filters can effectively estimate the unknown input and system state.

Appendix

There is a known matrix . If , then there is order subformula in , and the determinant of the subformula is nonzero. By swapping rows and columns of the matrix , the subformula is located at the subblock of , while the rank of is equal to the rank of . Since the order subblock is nonsingular, the matrix can be expressed as

In other words, there are nonsingular matrices and satisfying

And then,where and are nonsingular matrices of rank .

Data Availability

The data used to support the findings of this study are given in [23].

Conflicts of Interest

The authors declare that they have no conflicts of interest.

Acknowledgments

This research was supported by the National Natural Science Foundation of China (61703221) and the Shandong Provincial Natural Science Foundation Project (ZR2016FP10).