arXiv · 1902.09293
A Robust Unscented Transformation for Uncertain Moments
Abstract
This paper proposes a robust version of the unscented transform (UT) for one-dimensional random variables. It is assumed that the moments are not exactly known, but are known to lie in intervals. In this scenario, the moment matching equations are reformulated as a system of polynomial equations and inequalities, and it is proposed to use the Chebychev center of the solution set as a robust UT. This method yields a parametrized polynomial optimization problem, which in spite of being NP-Hard, can be relaxed by some algorithms that are proposed in this paper.
Explore related subjects
Keep this discovery
Hugo T. M. Kussaba, João Y. Ishihara, Leonardo R. A. X. Menezes. 2019-02-25. A Robust Unscented Transformation for Uncertain Moments. https://doi.org/10.1016/j.jfranklin.2019.02.018
Cite the original work for its findings. Save a collection to share your selection of sources.