scispace - formally typeset
Search or ask a question
Topic

Invariant extended Kalman filter

About: Invariant extended Kalman filter is a research topic. Over the lifetime, 7079 publications have been published within this topic receiving 187702 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: It is shown that the use of the extended Kalman filter results in better learning than conventional RBF networks and faster learning than gradient descent.

154 citations

Journal ArticleDOI
TL;DR: The conclusion is that with an algebraic reformulation of the correction part, the reformulated UKF shows strong performance on the selection of nonlinear constrained process systems.

154 citations

Journal ArticleDOI
TL;DR: It is shown that the truncated Kalman filter may provide a more accurate way of incorporating inequality constraints than other constrained filters (e.g. the projection approach to constrained filtering).
Abstract: Kalman filters are often used to estimate the state variables of a dynamic system. However, in the application of Kalman filters some known signal information is often either ignored or dealt with heuristically. For instance, state variable constraints (which may be based on physical considerations) are often neglected because they do not fit easily into the structure of the Kalman filter. This article develops an analytic method of incorporating state variable inequality constraints in the Kalman filter. The resultant filter truncates the probability density function (PDF) of the Kalman filter estimate at the known constraints and then computes the constrained filter estimate as the mean of the truncated PDF. The incorporation of state variable constraints increases the computational effort of the filter but also improves its estimation accuracy. The improvement is demonstrated via simulation results obtained from a turbofan engine model. It is also shown that the truncated Kalman filter may provide a more accurate way of incorporating inequality constraints than other constrained filters (e.g. the projection approach to constrained filtering).

152 citations

Journal ArticleDOI
TL;DR: The authors propose to combine the two algorithms and to use a reduced-rank approximation of the covariance matrix as a variance reductor for the ensemble Kalman filter.
Abstract: A number of algorithms to solve large-scale Kalman filtering problems have been introduced recently. The ensemble Kalman filter represents the probability density of the state estimate by a finite number of randomly generated system states. Another algorithm uses a singular value decomposition to select the leading eigenvectors of the covariance matrix of the state estimate and to approximate the full covariance matrix by a reduced-rank matrix. Both algorithms, however, still require a huge amount of computer resources. In this paper the authors propose to combine the two algorithms and to use a reduced-rank approximation of the covariance matrix as a variance reductor for the ensemble Kalman filter. If the leading eigenvectors explain most of the variance, which is the case for most applications, the computational burden to solve the filtering problem can be reduced significantly (up to an order of magnitude).

151 citations

Journal ArticleDOI
TL;DR: The results show that the proposed approach to adaptive estimation of multiple fading factors in the Kalman filter for navigation applications can significantly improve the filter performance and has the ability to restrain the filtering divergence even when system noise attributes are inaccurate.
Abstract: Kalman filter is the most frequently used algorithm in navigation applications. A conventional Kalman filter (CKF) assumes that the statistics of the system noise are given. As long as the noise characteristics are correctly known, the filter will produce optimal estimates for system states. However, the system noise characteristics are not always exactly known, leading to degradation in filter performance. Under some extreme conditions, incorrectly specified system noise characteristics may even cause instability and divergence. Many researchers have proposed to introduce a fading factor into the Kalman filtering to keep the filter stable. Accordingly various adaptive Kalman filters are developed to estimate the fading factor. However, the estimation of multiple fading factors is a very complicated, and yet still open problem. A new approach to adaptive estimation of multiple fading factors in the Kalman filter for navigation applications is presented in this paper. The proposed approach is based on the assumption that, under optimal estimation conditions, the residuals of the Kalman filter are Gaussian white noises with a zero mean. The fading factors are computed and then applied to the predicted covariance matrix, along with the statistical evaluation of the filter residuals using a Chi-square test. The approach is tested using both GPS standalone and integrated GPS/INS navigation systems. The results show that the proposed approach can significantly improve the filter performance and has the ability to restrain the filtering divergence even when system noise attributes are inaccurate.

151 citations


Network Information
Related Topics (5)
Control theory
299.6K papers, 3.1M citations
91% related
Robustness (computer science)
94.7K papers, 1.6M citations
89% related
Artificial neural network
207K papers, 4.5M citations
85% related
Support vector machine
73.6K papers, 1.7M citations
84% related
Optimization problem
96.4K papers, 2.1M citations
84% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202348
2022162
202120
20208
201914
201851