In this last chapter of the second section, the authors present probabilistic solutions to mobile robot localization that bring together the recursive filters introduced in chapter 4 and all the components and models already discussed in the preceding chapters. It presents the general, Bayesian framework for a probabilistic solution to localization and mapping. The problem is formally described as a graphical model (in particular a dynamic Bayesian network), and the characteristics that can be exploited to approach it efficiently are elaborated. Among parametric Bayesian estimators, the family of the Kalman filters is introduced with examples and practical applications. Then, the more modern non-parametric filters, mainly particle filters, are explained. Due to the diversity of filters available for localization, comparative tables are included.
Michał ZającDariusz UcińskiRalf Stetter
Dieter FoxSebastian ThrunWolfram BurgardFrank Dellaert
Guanghui CenNobuto MatsuhiraJunko HirokawaHideki OgawaIchiro Hagiwara
Guillermo Duenas AranaOsama Abdul HafezMathieu JoergerMatthew Spenko