Lightweight Marginalized Particle Filtering With Enhanced Consistency for Terrain Referenced Navigation

• Published in: IEEE transactions on aerospace and electronic systems Vol. 58; no. 3; pp. 2493 - 2504
• Main Authors: Choe, Yeongkwon, Song, Jin Woo, Park, Chan Gook
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.06.2022; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Aerodynamics; Algorithms; Complexity; Complexity theory; Consistency; Dynamic models; Filtering; Filtering algorithms; Importance sampling (IS); Kalman filters; Lightweight; marginalized particle filter (MPF); Navigation; nonlinear filtering; Nonlinear filters; Numerical methods; Particle filters; Rao–Blackwellization; Simplification; State space models; Terrain referenced navigation; terrain referenced navigation (TRN)
• ISSN: 0018-9251; 1557-9603
• DOI: 10.1109/TAES.2021.3135233

This article proposes a computationally lightweight marginalized particle filtering (MPF) algorithm with improved filter consistency. For mixed linear/nonlinear state-space models such as terrain referenced navigation (TRN) models, an MPF can improve the convergence and efficiency of the filters by separately applying a Kalman filter (KF) and a particle filter (PF) to each state space rather than using only one type of filter. However, an MPF still has a high degree of complexity because it requires the same number of KFs as the number of particles in the PF. To address this issue, our method simplifies the MPF through Gaussian approximation to use only one KF and improves the filter consistency compared to other MPF simplification methods. The proposed method further reduces the complexity by considering the dynamic model of a TRN system. This article presents a complexity analysis between the original MPF and other MPF simplification methods and numerical experiments for a range/bearing example and a TRN system. The results show that the proposed algorithm has better filter consistency than the existing simplification algorithms and can achieve performance comparable to an MPF with less computation.