jump to search box

Bayesian estimation and tracking : a practical guide / Anton J. Haug.



At the Library

Other libraries

Haug, Anton J., 1941-
Publication date:
Hoboken, N.J. : Wiley, c2012.
  • Book
  • xxvi, 369 p. : ill ; 25 cm.
Includes bibliographical references and index.
"This book presents a practical approach to estimation methods that are designed to provide a clear path to programming all algorithms. Readers are provided with a firm understanding of Bayesian estimation methods and their interrelatedness. Starting with fundamental principles of Bayesian theory, the book shows how each tracking filter is derived from a slight modification to a previous filter. Such a development gives readers a broader understanding of the hierarchy of Bayesian estimation and tracking. Following the discussions about each tracking filter, the filter is put into block diagram form for ease in future recall and reference. The book presents a completely unified approach to Bayesian estimation and tracking, and this is accomplished by showing that the current posterior density for a state vector can be linked to its previous posterior density through the use of Bayes' Law and the Chapman-Kolmogorov integral. Predictive point estimates are then shown to be density-weighted integrals of nonlinear functions. The book also presents a methodology that makes implementation of the estimation methods simple (or, rather, simpler than they have been in the past). Each algorithm is accompanied by a block diagram that illustrates how all parts of the tracking filter are linked in a never-ending chain, from initialization to the loss of track. These filter block diagrams provide a ready picture for implementing the algorithms into programmable code. In addition, four completely worked out case studies give readers examples of implementation, from simulation models that generate noisy observations to worked-out applications for all tracking algorithms. This book also presents the development and application of track performance metrics, including how to generate error ellipses when implementing in real-world applications, how to calculate RMS errors in simulation environments, and how to calculate Cramer-Rao lower bounds for the RMS errors. These are also illustrated in the case study presentations"-- Provided by publisher.

powered by Blacklight
© Stanford University. Stanford, California 94305. (650) 725-1064. Terms of Use | Copyright Complaints | Opt Out of Analytics
jump to top