Introduction, discussion and evaluation of recursive Bayesian filters for linear and nonlinear filtering problems in indoor localization

Mathias Pelka, Horst Hellbrück

Abstract

Linear and nonlinear filtering for state estimation (e.g. position estimation or sensor fusion) for indoor positioning and navigation applications is a challenging task. Sensor fusion becomes more important with cost-effective sensors being readily available. However, state estimation with recursive Bayesian filters for sensor fusion and filtering are difficult to apply. We present an overview for the general Bayesian filter and derive the most commonly used recursive Bayesian filters, namely the Kalman, extended Kalman and the unscented Kalman filter along with the particle filter. The later Kalman filters are extension of the original Kalman filter, which are able to solve nonlinear filtering problems. The particle filter is also able to solve nonlinear filtering problems.We evaluate the recursive Bayesian filters for linear and nonlinear filtering problems for sensor fusion from relative dead reckoning positioning data and absolute positioning data from an UWB positioning system. We discuss and evaluate performance and computational complexity and provide recommendations for the use case of the recursive Bayesian filters.

Original languageEnglish
Title of host publication2016 International Conference on Indoor Positioning and Indoor Navigation (IPIN)
PublisherIEEE
Publication date14.11.2016
Article number7743663
ISBN (Print)978-1-5090-2426-1, 978-1-5090-2424-7
ISBN (Electronic)978-1-5090-2425-4
DOIs
Publication statusPublished - 14.11.2016
Event2016 International Conference on Indoor Positioning and Indoor Navigation - Alcala de Henares, Madrid, Spain
Duration: 04.10.201607.10.2016
Conference number: 124865

Fingerprint

Dive into the research topics of 'Introduction, discussion and evaluation of recursive Bayesian filters for linear and nonlinear filtering problems in indoor localization'. Together they form a unique fingerprint.

Cite this