Loading…
Filtering, predictive, and smoothing Cramér–Rao bounds for discrete-time nonlinear dynamic systems
Cramér–Rao lower bounds for the discrete-time nonlinear state estimation problem are treated. The Cramér–Rao bound for the mean-square error matrix of a state estimate is particularly important for quality evaluation of nonlinear state estimators as it represents a limit of cognizability of the stat...
Saved in:
Published in: | Automatica (Oxford) 2001-11, Vol.37 (11), p.1703-1716 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | Cramér–Rao lower bounds for the discrete-time nonlinear state estimation problem are treated. The Cramér–Rao bound for the mean-square error matrix of a state estimate is particularly important for quality evaluation of nonlinear state estimators as it represents a limit of cognizability of the state. Recursive relations for filtering, predictive, and smoothing Cramér–Rao bounds are derived to establish a unifying framework for several previously published derivation procedures and results. Lower bounds for systems with unknown parameters are newly provided. Computation of filtering, predictive, and smoothing Cramér–Rao bounds, their mutual comparison and utilization for quality evaluation of some nonlinear filters are shown in numerical examples. |
---|---|
ISSN: | 0005-1098 1873-2836 |
DOI: | 10.1016/S0005-1098(01)00136-4 |