Minimum Divergence Filtering using a Polynomial Chaos Expansion
Abstract
Bayesian filters for discrete-time systems make use of the Chapman-Kolmogorov equation and Bayes' rule to predict and update the uncertainty of a state. For nonlinear filtering problems, the Bayesian recursion is not guaranteed to close. An assumed density framework can be used to force the recursion to close, where one such realization is the minimum divergence filter, which seeks to minimize the Kullback-Leibler divergence of the assumed density with respect to the reference state density. This results in a moment matching problem, where the moments are traditionally approximated using Gauss-Hermite quadrature. An alternative solution is presented by replacing the Gauss-Hermite quadrature with a polynomial chaos expansion to reduce computational cost and provide a method that is more robust to distributional assumptions. The ability of the polynomial chaos expansion to compute the expected value of a random variable that cannot be assumed Gaussian is tested against a Gauss-Hermite quadrature approximation, unscented transform, and Monte Carlo sampling. Another test is preformed isolating the corrector of the minimum divergence filter with varied prior uncertainties. The two methods are then compared in an orbital state estimation problem.
Recommended Citation
C. L. Schmid and K. J. DeMars, "Minimum Divergence Filtering using a Polynomial Chaos Expansion," Advances in the Astronautical Sciences, vol. 162, pp. 1909 - 1928, Springer, Jan 2018.
Department(s)
Mechanical and Aerospace Engineering
International Standard Book Number (ISBN)
978-087703645-6
International Standard Serial Number (ISSN)
0065-3438
Document Type
Article - Conference proceedings
Document Version
Citation
File Type
text
Language(s)
English
Rights
© 2024 Springer, All rights reserved.
Publication Date
01 Jan 2018
