Conference Paper

Efficient Nonlinear Measurement Updating based on Gaussian Mixture Approximation of Conditional Densities

Univ. Karlsruhe, Karlsruhe
DOI: 10.1109/ACC.2007.4282269 Conference: American Control Conference, 2007. ACC '07
Source: IEEE Xplore

ABSTRACT Filtering or measurement updating for nonlinear stochastic dynamic systems requires approximate calculations, since an exact solution is impossible to obtain in general. We propose a Gaussian mixture approximation of the conditional density, which allows performing measurement updating in closed form. The conditional density is a probabilistic representation of the nonlinear system and depends on the random variable of the measurement given the system state. Unlike the likelihood, the conditional density is independent of actual measurements, which permits determining its approximation off-line. By treating the approximation task as an optimization problem, we use progressive processing to achieve high quality results. Once having calculated the conditional density, the likelihood can be determined on-line, which, in turn, offers an efficient approximate filter step. As result, a Gaussian mixture representation of the posterior density is obtained. The exponential growth of Gaussian mixture components resulting from repeated filtering is avoided implicitly by the prediction step using the proposed techniques.

  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: Bayesian estimation for nonlinear systems is still a challenging problem, as in general the type of the true probability density changes and the complexity increases over time. Hence, approximations of the occurring equations and/or of the underlying probability density functions are inevitable. In this paper, we propose an approximation of the conditional densities by wavelet expansions. This kind of representation allows a sparse set of characterizing coefficients, especially for smooth or piecewise smooth density functions. Besides its good approximation properties, fast algorithms operating on sparse vectors are applicable and thus, a good trade-off between approximation quality and run-time can be achieved. Moreover, due to its highly generic nature, it can be applied to a large class of nonlinear systems with a high modeling accuracy. In particular, the noise acting upon the system can be modeled by an arbitrary probability distribution and can influence the system in any way.
    Decision and Control (CDC), 2010 49th IEEE Conference on; 01/2011
  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we present a recursive estimation algorithm for nonlinear non-Gaussian tracking systems based on an adaptive Gaussian mixture technique. This estimation cannot be efficiently performed for nonlinear non-Gaussian systems because of the complex representation of the state density. To alleviate this complexity, approximation techniques based on Gaussian mixtures are used. An adaptive mixture approximation method is used based on optimal minimization of a least squares error function between the true density and the corresponding approximation mixture. The state Gaussian mixture is propagated over time through prediction and update steps. Results in comparison with other methods show the efficiency of the proposed algorithm.
    Information Fusion (FUSION), 2010 13th Conference on; 01/2010
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: A probabilistic sensor management framework is introduced, which maximizes the utility of sensor systems with many different sensing modalities by dynamically configuring the sensor system in the most beneficial way. For this purpose, techniques from stochastic control and Bayesian estimation are combined such that long-term effects of possible sensor configurations and stochastic uncertainties resulting from noisy measurements can be incorporated into the sensor management decisions.
    Ph.D. thesis. 04/2009;

Full-text (2 Sources)

Available from
May 28, 2014