930 research outputs found

    On Approximate Nonlinear Gaussian Message Passing On Factor Graphs

    Full text link
    Factor graphs have recently gained increasing attention as a unified framework for representing and constructing algorithms for signal processing, estimation, and control. One capability that does not seem to be well explored within the factor graph tool kit is the ability to handle deterministic nonlinear transformations, such as those occurring in nonlinear filtering and smoothing problems, using tabulated message passing rules. In this contribution, we provide general forward (filtering) and backward (smoothing) approximate Gaussian message passing rules for deterministic nonlinear transformation nodes in arbitrary factor graphs fulfilling a Markov property, based on numerical quadrature procedures for the forward pass and a Rauch-Tung-Striebel-type approximation of the backward pass. These message passing rules can be employed for deriving many algorithms for solving nonlinear problems using factor graphs, as is illustrated by the proposition of a nonlinear modified Bryson-Frazier (MBF) smoother based on the presented message passing rules

    The Sparse-grid based Nonlinear Filter: Theory and Applications

    Get PDF
    Filtering or estimation is of great importance to virtually all disciplines of engineering and science that need inference, learning, information fusion, and knowledge discovery of dynamical systems. The filtering problem is to recursively determine the states and/or parameters of a dynamical system from a sequence of noisy measurements made on the system. The theory and practice of optimal estimation of linear Gaussian dynamical systems have been well established and successful, but optimal estimation of nonlinear and non-Gaussian dynamical systems is much more challenging and in general requires solving partial differential equations and intractable high-dimensional integrations. Hence, Gaussian approximation filters are widely used. In this dissertation, three innovative point-based Gaussian approximation filters including sparse Gauss-Hermite quadrature filter, sparse-grid quadrature filter, and the anisotropic sparse-grid quadrature filter are proposed. The relationship between the proposed filters and conventional Gaussian approximation filters is analyzed. In particular, it is proven that the popular unscented Kalman filter and the cubature Kalman filter are subset of the proposed sparse-grid filters. The sparse-grid filters are employed in three aerospace applications including spacecraft attitude estimation, orbit determination, and relative navigation. The results show that the proposed filters can achieve better estimation accuracy than the conventional Gaussian approximation filters, such as the extended Kalman filter, the cubature Kalman filter, the unscented Kalman filter, and is computationally more efficient than the Gauss-Hermite quadrature filter

    Adaptive Sparse-grid Gauss-Hermite Filter

    Get PDF
    In this paper, a new nonlinear filter based on sparse-grid quadrature method has been proposed. The proposed filter is named as adaptive sparse-grid Gauss–Hermite filter (ASGHF). Ordinary sparse-grid technique treats all the dimensions equally, whereas the ASGHF assigns a fewer number of points along the dimensions with lower nonlinearity. It uses adaptive tensor product to construct multidimensional points until a predefined error tolerance level is reached. The performance of the proposed filter is illustrated with two nonlinear filtering problems. Simulation results demonstrate that the new algorithm achieves a similar accuracy as compared to sparse-grid Gauss–Hermite filter (SGHF) and Gauss–Hermite filter (GHF) with a considerable reduction in computational load. Further, in the conventional GHF and SGHF, any increase in the accuracy level may result in an unacceptably high increase in the computational burden. However, in ASGHF, a little increase in estimation accuracy is possible with a limited increase in computational burden by varying the error tolerance level and the error weighting parameter. This enables the online estimator to operate near full efficiency with a predefined computational budget

    Approximate Gaussian conjugacy: parametric recursive filtering under nonlinearity, multimodality, uncertainty, and constraint, and beyond

    Get PDF
    Since the landmark work of R. E. Kalman in the 1960s, considerable efforts have been devoted to time series state space models for a large variety of dynamic estimation problems. In particular, parametric filters that seek analytical estimates based on a closed-form Markov–Bayes recursion, e.g., recursion from a Gaussian or Gaussian mixture (GM) prior to a Gaussian/GM posterior (termed ‘Gaussian conjugacy’ in this paper), form the backbone for a general time series filter design. Due to challenges arising from nonlinearity, multimodality (including target maneuver), intractable uncertainties (such as unknown inputs and/or non-Gaussian noises) and constraints (including circular quantities), etc., new theories, algorithms, and technologies have been developed continuously to maintain such a conjugacy, or to approximate it as close as possible. They had contributed in large part to the prospective developments of time series parametric filters in the last six decades. In this paper, we review the state of the art in distinctive categories and highlight some insights that may otherwise be easily overlooked. In particular, specific attention is paid to nonlinear systems with an informative observation, multimodal systems including Gaussian mixture posterior and maneuvers, and intractable unknown inputs and constraints, to fill some gaps in existing reviews and surveys. In addition, we provide some new thoughts on alternatives to the first-order Markov transition model and on filter evaluation with regard to computing complexity
    • …
    corecore