Bobrovsky-Zakai Bound for Filtering, Prediction and Smoothing of Nonlinear Dynamic Systems

Date

2018-07-13

Author

Fritsche, Carsten
Orguner, Umut
Gustafsson, Fredrik

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

43
views

0
downloads

In this paper, recursive Bobrovsky-Zakai bounds for filtering, prediction and smoothing of nonlinear dynamic systems are presented. The similarities and differences to an existing Bobrovsky-Zakai bound in the literature for the filtering case are highlighted. The tightness of the derived bounds are illustrated on a simple example where a linear system with non-Gaussian measurement likelihood is considered. The proposed bounds are also compared with the performance of some well-known filters/predictors/smoothers and other Bayesian bounds.

Subject Keywords

Bobrovsky-Zakai bound, State estimation, Nonlinear, Filtering, Smoothing, Prediction

URI

https://hdl.handle.net/11511/38070

DOI

https://doi.org/10.23919/icif.2018.8455541

Collections

Department of Electrical and Electronics Engineering, Conference / Seminar

Suggestions

OpenMETU
Core

An efficient parallel triangular inversion by Gauss elimination with sweeping Kiper, A (1998-01-01) A parallel computation model to invert a lower triangular matrix using Gauss elimination with sweeping technique is presented. Performance characteristics that we obtain are O(n) time and O(n(2)) processors leading to an efficiency of O(1/n). A comparative performance study with the available fastest parallel matrix inversion algorithms is given. We believe that the method presented here is superior over the existing methods in efficiency measure and in processor complexity.
Error analysis for the numerical evaluation of the diagonal forms of the scalar spherical addition theorem Koc, S; Song, JM; Chew, WC (Society for Industrial & Applied Mathematics (SIAM), 1999-04-29) The numerical solution of wave scattering from large objects or from a large cluster of scatterers requires excessive computational resources and it becomes necessary to use approximate-but fast-methods such as the fast multipole method; however, since these methods are only approximate, it is important to have an estimate for the error introduced in such calculations. An analysis of the error for the fast multipole method is presented and estimates for truncation and numerical integration errors are obtain...
A new real-time suboptimum filtering and prediction scheme for general nonlinear discrete dynamic systems with Gaussian or non-Gaussian noise Demirbaş, Kerim (Informa UK Limited, 2011-01-01) A new suboptimum state filtering and prediction scheme is proposed for nonlinear discrete dynamic systems with Gaussian or non-Gaussian disturbance and observation noises. This scheme is an online estimation scheme for real-time applications. Furthermore, this scheme is very suitable for state estimation under either constraints imposed on estimates or missing observations. State and observation models can be any nonlinear functions of the states, disturbance and observation noises as long as noise samples ...
Unstructured grid generation and a simple triangulation algorithm for arbitrary 2-D geometries using object oriented programming Karamete, BK; Tokdemir, Turgut; Ger, M (Wiley, 1997-01-30) This paper describes the logic of a dynamic algorithm for a general 2D Delaunay triangulation of arbitrarily prescribed interior and boundary nodes. The complexity of the geometry is completely arbitrary. The scheme is free of specific restrictions on the input of the geometrical data. The scheme generates triangles whose associated circumcircles contain 'no nodal points except their vertices. There is no predefined limit for the number of points and the boundaries. The direction of generation of the triang...
Online state estimation for discrete nonlinear dynamic systems with nonlinear noise and interference Demirbaş, Kerim (2015-01-01) This paper presents a real-time recursive state filtering and prediction scheme (PR) for discrete nonlinear dynamic systems with nonlinear noise and random interference, such as undesired random jamming or clutter. The PR is based upon discrete noise approximation, state quantization, and a suboptimal implementation of multiple composite hypothesis testing. The PR outperforms both the sampling importance resampling (SIR) particle filter and auxiliary sampling importance resampling (ASIR) particle filter; wh...

Citation Formats

C. Fritsche, U. Orguner, and F. Gustafsson, “Bobrovsky-Zakai Bound for Filtering, Prediction and Smoothing of Nonlinear Dynamic Systems,” 2018, Accessed: 00, 2020. [Online]. Available: https://hdl.handle.net/11511/38070.