Abstract

The extend kalman filter provides an stability solution to the approximate nonlinear-Gaussian filter problem. Due to the limitation of the word length of the processor, the rounding errors is easy to occur in the calculation, which causes the covariance matrix to lose its positive definite and convergence. In order to solve this problem, The proposed stable extended kalman filter (SEKF) method is applied to the problem of non-positive and divergence in recursive filter. This method introduces the matrix decomposition and constructs a covariance square root adaptive filter which is used to solve the numerical stability problem of the extend kalman filter. Experimental results show that SEKF can effectively guarantee symmetric positive definite in recursive calculation, and perform remarkably better than EKF algorithm.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call