Receding horizon filtering for a class of discrete time-varying nonlinear systems with multiple missing measurements

This paper is concerned with the receding horizon filtering problem for a class of discrete time-varying nonlinear systems with multiple missing measurements. The phenomenon of missing measurements occurs in a random way and the missing probability is governed by a set of stochastic variables obeying the given Bernoulli distribution. By exploiting the projection theory combined with stochastic analysis techniques, a Kalman-type receding horizon filter is put forward to facilitate the online applications. Furthermore, by utilizing the conditional expectation, a novel estimation scheme of state covariance matrices is proposed to guarantee the implementation of the filtering algorithm. Finally, a simulation example is provided to illustrate the effectiveness of the established filtering scheme.This work was supported in part by the Deanship of Scientific Research (DSR) at King Abdulaziz University in Saudi Arabia [grant number 16-135-35-HiCi], the National Natural Science Foundation of China [grant number 61329301], [grant number 61203139], [grant number 61134009], and [grant number 61104125], Royal Society of the U.K., the Shanghai Rising-Star Program of China [grant number 13QA1400100], the Shu Guang project of Shanghai Municipal Education Commission and Shanghai Education Development Foundation [grant number 13SG34], the Fundamental Research Funds for the Central Universities, DHU Distinguished Young Professor Program, and the Alexander von Humboldt Foundation of Germany

Review of Unbiased FIR Filters, Smoothers, and Predictors for Polynomial Signals

Extracting an estimate of a slowly varying signal corrupted by noise is a common task. Examples can be found in industrial, scientific and biomedical instrumentation. Depending on the nature of the application the signal estimate is allowed to be a delayed estimate of the original signal or, in the other extreme, no delay is tolerated. These cases are commonly referred to as filtering, prediction, and smoothing depending on the amount of advance or lag between the input data set and the output data set. In this review paper we provide a comprehensive set of design and analysis tools for designing unbiased FIR filters, predictors, and smoothers for slowly varying signals, i.e. signals that can be modeled by low order polynomials. Explicit expressions of parameters needed in practical implementations are given. Real life examples are provided including cases where the method is extended to signals that are piecewise slowly varying. A critical view on recursive implementations of the algorithms is provided

Effect of embedded unbiasedness on discrete-time optimal FIR filtering estimates

Unbiased estimation is an efficient alternative to optimal estimation when the noise statistics are not fully known and/or the model undergoes temporary uncertainties. In this paper, we investigate the effect of embedded unbiasedness (EU) on optimal finite impulse response (OFIR) filtering estimates of linear discrete time-invariant state-space models. A new OFIR-EU filter is derived by minimizing the mean square error (MSE) subject to the unbiasedness constraint. We show that the OFIR-UE filter is equivalent to the minimum variance unbiased FIR (UFIR) filter. Unlike the OFIR filter, the OFIR-EU filter does not require the initial conditions. In terms of accuracy, the OFIR-EU filter occupies an intermediate place between the UFIR and OFIR filters. Contrary to the UFIR filter which MSE is minimized by the optimal horizon of N opt points, the MSEs in the OFIR-EU and OFIR filters diminish with N and these filters are thus full-horizon. Based upon several examples, we show that the OFIR-UE filter has higher immunity against errors in the noise statistics and better robustness against temporary model uncertainties than the OFIR and Kalman filters

Improved Receding Horizon Fourier Analysis for Quasi-periodic Signals

In this paper, an efficient short-time Fourier analysis method for the quasi-periodic signals is proposed via an optimal fixed-lag finite impulse response (FIR) smoother approach using a receding horizon scheme. In order to deal with time-varying Fourier coefficients (FCs) of quasi-periodic signals, a state space model including FCs as state variables is augmented with the variants of FCs. Through an optimal fixed-lag FIR smoother, FCs and their increments are estimated simultaneously and combined to produce final estimates. A lag size of the optimal fixed-lag FIR smoother is chosen to minimize the estimation error. Since the proposed estimation scheme carries out the correction process with the estimated variants of FCs, it is highly probable that the smaller estimation error is achieved compared with existing approaches not making use of such a process. It is shown through numerical simulation that the proposed scheme has better tracking ability for estimating time-varying FCs compared with existing ones.111Ysciescopuskc

Improving state estimates over finite data using optimal FIR filtering with embedded unbiasedness

In this paper, the optimal finite impulse response (OFIR) with embedded unbiasedness (EU) filter is derived by minimizing the mean square error (MSE) subject to the unbiasedness constraint for discrete time-invariant state-space models. Un like the OFIR filter, the OFIR-EU filter does not require the initial conditions. In terms of accuracy, the OFIR-EU filter occupies an intermediate place between the UFIR and OFIR filters. With a two-state harmonic model, we show that the OFIR-UE filter has higher immunity against errors in the noise statistics and better robustness against temporary model uncertainties than the OFIR and Kalman filters

Finite Impulse Response Filtering Algorithm with Adaptive Horizon Size Selection and Its Applications

It is known, that unlike the Kalman filter (KF) finite impulse response (FIR) filters allow to avoid the divergence and unsatisfactory object tracking connected with temporary perturbations and abrupt object changes. The main challenge is to provide the appropriate choice of a sliding window size for them. In this paper, the new finite impulse response (FIR) filtering algorithm with the adaptive horizon size selection is proposed. The algorithm uses the receding horizon optimal (RHOFIR) filter which receives estimates, an abrupt change detector and an adaptive recurrent mechanism for choosing the window size. Monotonicity and asymptotic properties of the estimation error covariance matrix and the RHOFIR filter gain are established. These results form a solid foundation for justifying the principal possibility to tune the filter gain using them and the developed adaptation mechanism. The proposed algorithm (the ARHOFIR filter) allows reducing the impact of disturbances by varying adaptively the sliding window size. The possibility of this follows from the fact that the window size affects the filter characteristics in different ways. The ARHOFIR filter chooses a large horizon size in the absence of abrupt disturbances and a little during the time intervals of their action. Due to this, it has better transient characteristics compared to the KF and RHOFIR filter at intervals where there is temporary uncertainty and may provide the same accuracy of estimates as the KF in their absence. By simulation, it is shown that the ARHOFIR filter is more robust than the KF and RHOFIR filter for the temporarily uncertain systems

Fast bias-constrained optimal FIR filtering for time-invariant state space models

This paper combines the finite impulse response filtering with the Kalman structure (predictor/corrector) and proposes a fast iterative bias-constrained optimal finite impulse response filtering algorithm for linear discrete time-invariant models. In order to provide filtering without any requirement of the initial state, the property of unbiasedness is employed. We first derive the optimal finite impulse response filter constrained by unbiasedness in the batch form and then find its fast iterative form for finite-horizon and full-horizon computations. The corresponding mean square error is also given in the batch and iterative forms. Extensive simulations are provided to investigate the trade-off with the Kalman filter. We show that the proposed algorithm has much higher immunity against errors in the noise covariances and better robustness against temporary model uncertainties. The full-horizon filter operates almost as fast as the Kalman filter, and its estimate converges with time to the Kalman estimate

Unbiased, optimal, and in-betweens: the trade-off in discrete finite impulse response filtering

In this survey, the authors examine the trade-off between the unbiased, optimal, and in-between solutions in finite impulse response (FIR) filtering. Specifically, they refer to linear discrete real-time invariant state-space models with zero mean noise sources having arbitrary covariances (not obligatorily delta shaped) and distributions (not obligatorily Gaussian). They systematically analyse the following batch filtering algorithms: unbiased FIR (UFIR) subject to the unbiasedness condition, optimal FIR (OFIR) which minimises the mean square error (MSE), OFIR with embedded unbiasedness (EU) which minimises the MSE subject to the unbiasedness constraint, and optimal UFIR (OUFIR) which minimises the MSE in the UFIR estimate. Based on extensive investigations of the polynomial and harmonic models, the authors show that the OFIR-EU and OUFIR filters have higher immunity against errors in the noise statistics and better robustness against temporary model uncertainties than the OFIR and Kalman filters

Iterative Unbiased FIR State Estimation: A Review of Algorithms

In this paper, we develop in part and review various iterative unbiased finite impulse response (UFIR) algorithms (both direct and two-stage) for the filtering, smoothing, and prediction of time-varying and time-invariant discrete state-space models in white Gaussian noise environments. The distinctive property of UFIR algorithms is that noise statistics are completely ignored. Instead, an optimal window size is required for optimal performance. We show that the optimal window size can be determined via measurements with no reference. UFIR algorithms are computationally more demanding than Kalman filters, but this extra computational effort can be alleviated with parallel computing, and the extra memory that is required is not a problem for modern computers. Under real-world operating conditions with uncertainties, non-Gaussian noise, and unknown noise statistics, the UFIR estimator generally demonstrates better robustness than the Kalman filter, even with suboptimal window size. In applications requiring large window size, the UFIR estimator is also superior to the best previously known optimal FIR estimators