On the iterated forms of Kalman filters using statistical linearization

The extended Kalman filter (EKF) is a suboptimal estimator of the conditional mean and covariance for nonlinear state estimation. It is based on first order Taylor series approximation of nonlinear state functions. The unscented Kalman filter (UKF) and the ensemble Kalman filter (EnKF) are suboptimal estimators that are termed as Jacobian free because they do not require the existence of the Jacobian of the nonlinearity. The iterated form of EKF is an estimator of the conditional mode that employs an approximate Newton–Raphson iterative scheme to solve the maximization of the conditional probability density function. In this paper, the iterated forms of UKF and EnKF are presented that perform Newton–Raphson iteration without explicitly differentiating the nonlinear functions. The use of statistical linearization in iterated UKF and EnKF is a nondifferentiable optimization method when the measurement function is nonsmooth or discontinuous. All three iterated forms can be shown to be conditional mean estimators after the first iteration. A simple numerical example involving continuous and discontinuous measurment functions is included to evaluate the performance of the algorithms for the estimation of conditional mean, covariance and mode. A batch reactor simulation is shown for estimating both the states and unknown parameters.     

Multi-rate distributed fusion estimation for sensor networks with packet losses

This paper presents a distributed fusion estimation method for estimating states of a dynamical process observed by wireless sensor networks (WSNs) with random packet losses. It is assumed that the dynamical process is not changing too rapidly, and a multi-rate scheme by which the sensors estimate states at a faster time scale and exchange information with neighbors at a slower time scale is proposed to reduce communication costs. The estimation is performed by taking into account the random packet losses in two stages. At the first stage, every sensor in the WSN collects measurements from its neighbors to generate a local estimate, then local estimates in the neighbors are further collected at the second stage to form a fused estimate to improve estimation performance and reduce disagreements among local estimates at different sensors. Local optimal linear estimators are designed by using the orthogonal projection principle, and the fusion estimators are designed by using a fusion rule weighted by matrices in the linear minimum variance sense. Simulations of a target tracking system are given to show that the time scale of information exchange among sensors can be slower while still maintaining satisfactory estimation performance by using the developed estimation method.     

两种最优观测融合方法的功能等价性

对于基于K alm an滤波的多传感器数据融合,有两种最优观测融合方法:第一种是集中式观测融合方法,它是通过增加观测向量的维数合并多传感器数据,而第二种是分布式观测融合方法,它是在线性最小方差准则下,通过加权合并多传感器数据,但观测向量维数不变.在数据融合所用的传感器带有相同观测阵的情形下,本文用K alm an证明了两种观测融合方法是完全功能等价的,即用两种方法得到的K alm an估值器(滤波器,预报器,平滑器),信号估值器和白噪声估值器分别在数值上是相等的.在这种情形下,第二种方法不仅可给出像第一种方法一样的全局最优融合估计,而且可明显减小计算负担,便于实时应用.一个数值例子说明了其正确性.     

Linear estimation for random delay systems

This paper is concerned with the linear estimation problems for discrete-time systems with random delayed observations. When the random delay is known online, i.e., time-stamped, the random delayed system is reconstructed as an equivalent delay-free one by using measurement reorganization technique, and then an optimal linear filter is presented based on the Kalman filtering technique. However, the optimal filter is time-varying, stochastic, and does not converge to a steady state in general. Then an alternative suboptimal filter with deterministic gains is developed under a new criteria. The estimator performance in terms of their error covariances is provided, and its mean square stability is established. Finally, a numerical example is presented to illustrate the efficiency of proposed estimators.     

A mixture-of-experts framework for adaptive Kalman filtering

This paper proposes a modular and flexible approach to adaptive Kalman filtering using the framework of a mixture-of-experts regulated by a gating network. Each expert is a Kalman filter modeled with a different realization of the unknown system parameters such as process and measurement noise. The gating network performs on-line adaptation of the weights given to individual filter estimates based on performance. This scheme compares very favorably with the classical Magill filter bank, which is based on a Bayesian technique, in terms of: estimation accuracy; quicker response to changing environments; and numerical stability and computational demands. The proposed filter bank is further enhanced by periodically using a search algorithm in a feedback loop. Two search algorithms are considered. The first algorithm uses a recursive quadratic programming approach which extremizes a modified maximum likelihood function to update the parameters of the best performing filter in the bank. This particular approach to parameter adaptation allows a real-time implementation. The second algorithm uses a genetic algorithm to search for the parameter vector and is suited for post-processed data type applications. The workings and power of the overall filter bank and the suggested adaptation schemes are illustrated by a number of examples.     

非线性间歇过程的迭代学习状态估计

在间歇过程的状态估计中,如何充分利用多批次重复特性信息是一个挑战。迭代学习卡尔曼滤波方法利用卡尔曼滤波沿时间方向估计相邻两批次之间的状态误差,并沿批次方向迭代更新当前状态估计,兼顾了时间和批次两维特性。但是,这种方法只适用于线性系统。针对非线性间歇过程,提出一种迭代学习拟线性卡尔曼滤波器(ILQKF)方法。ILQKF基于间歇过程的标称模型,将实际状态与标称状态之间的误差作为新状态,建立了与误差相关的线性化模型。然后,根据迭代学习卡尔曼滤波方法,对状态误差进行估计,而状态轨迹为误差轨迹与标称轨迹之和,从而估计出非线性间歇过程的状态。啤酒发酵过程的应用仿真验证了ILQKF方法的优越性。     

A novel real-time adaptive suboptimal recursive state estimation scheme for nonlinear discrete dynamic systems with non-Gaussian noise

A real-time state filtering and prediction scheme which is adaptive, recursive, and suboptimal is proposed for discrete time nonlinear dynamic systems with either Gaussian or non-Gaussian noise. The proposed scheme (PR) estimates states adaptively whenever both the observation is available and there exists a non-zero and finite number of real state roots of the observation model, otherwise the PR estimates states non-adaptively. The PR state transition and observation functions are as general as the state transition and observation functions for particle filters. The PR is based upon discrete noise approximation, state quantization, and a suboptimal implementation of multiple hypothesis testing. The PR first detects state estimate divergence points along the time axis, and then state estimate divergences are prevented by introducing new admissible state quantization levels; whereas the extended Kalman filter (EKF), sampling importance resampling (SIR) particle filter (bootstrap filter), and auxiliary sampling importance resampling (ASIR) particle filter produce diverging state estimates from actual state values for many dynamic models. The PR uses state transition functions in order to calculate transition probabilities from gates to gates. If these transition probabilities are somehow available, then state transition functions are not needed for state estimation with the PR; whereas state transition functions are necessary for state estimation with both particle filters and the EKF. The PR is very suitable for state estimation with either constraints imposed on state estimates or missing observations. The PR is more general than grid-based estimation approaches. Monte Carlo simulations have shown the effectiveness of the PR, that is, the PR performance is better than the performances of the EKF, SIR, and ASIR particle filters for many nonlinear models with white Gaussian noise, four examples of which are presented in the paper.     

Robust l1 estimation using the Popov-Tsypkin multiplier with application to robust fault detection

This paper considers the design of robust l₁ estimators based on multiplier theory (which is intimately related to mixed structured singular value theory) and the application of robust l₁ estimators to robust fault detection. The key to estimator-based, robust fault detection is to generate residuals which are robust against plant uncertainties and external disturbance inputs, which in turn requires the design of robust estimators. Specifically, the Popov-Tsypkin multiplier is used to develop an upper bound on an l₁ cost function over an uncertainty set. The robust l₁ estimation problem is formulated as a parameter optimization problem in which the upper bound is minimized subject to a Riccati equation constraint. A continuation algorithm that uses quasi-Newton BFGS (the algorithm of Broyden, Fletcher, Goldfab and Shanno) corrections is developed to solve the minimization problem. The estimation algorithm has two stages. The first stage solves a mixed-norm H₂/l₁ estimation problem. In particular, it is initialized with a steady-state Kalman filter and, by varying a design parameter from 0 to 1, the Kalman filter is deformed to an l₁ estimator. In the second stage the l₁ estimator is made robust. The robust l₁ estimation framework is then applied to the robust fault detection of dynamic systems. The results are applied to a simplified longitudinal flight control system. It is shown that the robust fault detection procedure based on the robust l₁ estimation methodology proposed in this paper can reduce false alarm rates.     

On the identification of variances and adaptive Kalman filtering

A Kalman filter requires an exact knowledge of the process noise covariance matrixQand the measurement noise covariance matrixR. Here we consider the case in which the true values ofQandRare unknown. The system is assumed to be constant, and the random inputs are stationary. First, a correlation test is given which checks whether a particular Kalman filter is working optimally or not. If the filter is suboptimal, a technique is given to obtain asymptotically normal, unbiased, and consistent estimates ofQandR. This technique works only for the case in which the form ofQis known and the number of unknown elements inQis less thann times rwherenis the dimension of the state vector andris the dimension of the measurement vector. For other cases, the optimal steady-state gain Kopis obtained directly by an iterative procedure without identifyingQ. As a corollary, it is shown that the steady-state optimal Kalman filter gain Kopdepends only onn times rlinear functionals ofQ. The results are first derived for discrete systems. They are then extended to continuous systems. A numerical example is given to show the usefulness of the approach.     

Multi-level state estimation†

This paper discusses certain aspects of multi-level state estimation. In the first part, the multi-level state estimator of Pearson is considered and it is shown why such filters cannot be used for the practical state estimation of large systems. Then a computationally efficient suboptimal filter formulated by Shah is described and which is then extended to systems with time lags between the subsystems. For large serially connected systems, an even simpler state estimator could be used. A number of numerical studies are given comparing the performance of the two sub-optimal estimators and the overall optimal solution.     

Robust state estimator design for uncertain linear systems using optimization techniques

The estimation of state variables of dynamic systems in noisy environments has been an active research field in recent decades. In this way, Kalman filtering approach may not be robust in the presence of modeling uncertainties. So, several methods have been proposed to design robust estimators for the systems with uncertain parameters. In this paper, an optimized filter is proposed for this problem considering an uncertain discrete-time linear system. After converting the subject to an optimization problem, three algorithms are used for optimizing the state estimator parameters: particle swarm optimization (PSO) algorithm, modified genetic algorithm (MGA) and learning automata (LA). Experimental results show that, in comparison with the standard Kalman filter and some related researches, using the proposed optimization methods results in robust performance in the presence of uncertainties. However, MGA-based estimation method shows better performance in the range of uncertain parameter than other optimization methods.     

非高斯环境下基于最大相关熵的平滑估计器设计

针对Kalman平滑估计器在非高斯噪声环境下性能衰退问题, 本文提出了一种基于最大相关熵准则作为最优估计标准的平滑估计方法, 将其应用于固定滞后问题的状态估计, 称之为固定滞后最大相关熵平滑估计器(FLMCS). 首先, 使用矩阵变换, 给出最大相关熵Kalman滤波器的另一种形式; 然后, 以此为基础, 通过引入新的状态变量来增广系统, 并推导出所提平滑估计器的在线迭代方程; 进一步比较平滑前后状态估计误差协方差, 从理论上分析算法性能改进效果; 最后, 通过算例仿真验证所提平滑估计器在非高斯噪声干扰下的有效性和优越性.     

一种改进中心差分卡尔曼滤波方法

针对中心差分卡尔曼滤波（CDKF）跟踪时估计精度较低这一不足,提出了一种基于迭代测量更新的中心差分卡尔曼滤波（ICDKF）方法。本文将迭代滤波理论引入到中心差分卡尔曼滤波算法中,重复利用观测信息,采用经典的非线性非高斯模型进行仿真实验,给出了该算法与扩展卡尔曼滤波（EKF）、中心差分卡尔曼滤波（CDKF）的仿真结果,并分析了其跟踪性能和均方根误差。实验结果表明,迭代中心差分卡尔曼滤波（ICDKF）算法不仅具有无需计算Jacobian矩阵的优点,而且具有更高的估计精度。     

Estimation using a multirate filter

This note presents both optimal and suboptimal filtering algorithms for estimating state variables based on measurements sampled at two different data rates. The optimal algorithm consists of two parallel Kalman filters; one processes the fast rate measurement and is of reduced-order, and the other processes the residuals from the first filter along with the slow rate measurement. This algorithm is used to design a suboptimal algorithm that has decreased computational requirements with only a small performance penalty.     

Smoothing properties of discrete-time zero-lag Kalman filter

In this paper it is shown than an estimate generated in a discrete time Kalman filter can, under certain circumstances, give better performance if some delay is allowed in the system. This fact is utilized to construct three simple suboptimal smoothers, all based on the structure of a Kalman filter. These smoothers are of low complexity as compared with the optimal ones. The conditions are given under which the performance of these suboptimal smoothers is better than that of a zero-lag Kalman filter. The methods of suboptimal smoothing considered give, in many cases, a possibility of obtaining results close to the optimal smoother. Several examples are presented.     

有观测噪声的时变系统的参数估计

本文给出了有观测噪声、线性离散时变系统的参数估计新方法。它由两段互耦的自适应状态估计器和自适应参数估计器组成。通过引入虚拟时变噪声,我们结合在互耦算法中产生的模型误差到虚拟噪声统计,使模型误差得到有效地补偿和克服滤波发散。模拟例子说明了本文方法的有效性。     

Kalman filtering approach to multi-rate information fusion in the presence of irregular sampling rate and variable measurement delay

State estimation for a system with irregular rate and delayed measurements is studied using fusion Kalman filter. Lab data in process plants is usually more accurate compared to other measurements. However, it is often slow rate and subject to variable delay and irregularity in sampling time. Fast rate state estimation can be conducted using fast rate measurement, while the slow rate lab data can be used to improve the accuracy of estimation whenever it is available. For this purpose, two Kalman filters are used to estimate the states based on each type of measurement. The estimates are fused in the next step by considering the correlation between them. An iterative algorithm to obtain the cross-covariance matrix between the estimation errors of the two Kalman filters is presented and employed in the fusion process. The improvement on the accuracy of estimation and comparison with other optimal fusion state estimation techniques are discussed through a simulation example, a pilot-scale experiment and an industrial case study.     

A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise

A new suboptimum state filtering and prediction scheme is proposed for nonlinear discrete dynamic systems with Gaussian or non-Gaussian disturbance and observation noises. This scheme is an online estimation scheme for real-time applications. Furthermore, this scheme is very suitable for state estimation under either constraints imposed on estimates or missing observations. State and observation models can be any nonlinear functions of the states, disturbance and observation noises as long as noise samples are independent, and the density functions of noise samples and conditional density functions of the observations given the states are available. State models are used to calculate transition probabilities from gates to gates. If these transition probabilities are known or can be estimated, state models are not needed for estimation. The proposed scheme (PR) is based upon state quantisation and multiple hypothesis testing. Monte Carlo simulations have shown that the performance of the PR, sampling importance resampling (SIR) particle filter and extended Kalman (EK) filter are all model-dependent, and that the performance of the PR is better than both the SIR particle filter and EK filter for some nonlinear models, simulation results of three of which are given in this article.     

New approach to information fusion steady-state Kalman filtering

By the modern time series analysis method, based on the autoregressive moving average (ARMA) innovation model, a unified and general information fusion steady-state Kalman filtering approach is presented for the general multisensor systems with different local dynamic models and correlated noises. It can handle the filtering, smoothing, and prediction fusion problems for state or signal. The optimal fusion rule weighted by matrices is re-derived as a weighted least squares (WLS) fuser, and is reviewed. An optimal fusion rule weighted by diagonal matrices is presented, which is equivalent to the optimal fusion rule weighted by scalars for components, and it realizes a decoupled fusion. The new algorithms of the steady-state Kalman estimator gains are presented. In order to compute the optimal weights, the formulas of computing the cross-covariances among local estimation errors by Lyapunov equations are presented. The exponential convergence of the iterative solution of Lyapunov equation is proved. It is proved that the optimal fusion estimators under three weighted fusion rules are locally optimal, but are globally suboptimal. The proposed steady-state Kalman fusers can reduce the on-line computational burden, and are suitable for real-time applications. A simulation example for the 3-sensor steady-state Kalman tracking fusion estimators shows their effectiveness and correctness, and gives the accuracy comparison of the fusion rules.