Probabilistic Topological Mapping for Mobile Robots using Urn Models

We present an application of Bayesian modeling and inference to topological mapping in robotics. This is a potentially difficult problem due to (a) the combinatorial nature of the state space, and (b) perceptual aliasing by which two different landmarks in the environment can appear similar to the robot’s sensors. Hence, this presents a challenging approximate inference problem, complicated by the fact that the form of the prior on topologies is far from obvious. We deal with the latter problem by introducing the use of urn models, which very naturally encode prior assumptions in the domain of topological mapping. Secondly, we advance simulated tempering as the basis of two rapidly mixing approximate inference algorithms, based on Markov chain Monte Carlo (MCMC) and Sequential Importance Sampling (SIS), respectively. These algorithms converge quickly even though the posterior being estimated is highly peaked and multimodal. Experiments on real robots and in simulation demonstrate the efficiency and robustness of our technique.

[1]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

[2]  S. Donadio,et al.  Herding and Clustering in Economics: The Yule-Zipf-Simon Model , 2006 .

[3]  W. Ewens The sampling theory of selectively neutral alleles. , 1972, Theoretical population biology.

[4]  Jun S. Liu,et al.  Sequential importance sampling for nonparametric Bayes models: The next generation , 1999 .

[5]  Neil J. Gordon,et al.  Editors: Sequential Monte Carlo Methods in Practice , 2001 .

[6]  J. Pitman Some developments of the Blackwell-MacQueen urn scheme , 1996 .

[7]  C. Geyer,et al.  Annealing Markov chain Monte Carlo with applications to ancestral inference , 1995 .

[8]  Emanuele Menegatti,et al.  Image-based Monte Carlo localisation with omnidirectional images , 2004, Robotics Auton. Syst..

[9]  F. Dellaert,et al.  Dirichlet Process based Bayesian Partition Models for Robot Topological Mapping , 2004 .

[10]  Frank Dellaert,et al.  Inference in the space of topological maps: an MCMC-based approach , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[11]  Kurt Konolige,et al.  The Revisiting Problem in Mobile Robot Map Building: A Hierarchical Bayesian Approach , 2002, UAI.

[12]  S. Chib,et al.  Understanding the Metropolis-Hastings Algorithm , 1995 .

[13]  Timothy J. Robinson,et al.  Sequential Monte Carlo Methods in Practice , 2003 .

[14]  Yukito Iba EXTENDED ENSEMBLE MONTE CARLO , 2001 .

[15]  Juan D. Tardós,et al.  Data association in stochastic mapping using the joint compatibility test , 2001, IEEE Trans. Robotics Autom..

[16]  Sebastian Thrun,et al.  Integrating Grid-Based and Topological Maps for Mobile Robot Navigation , 1996, AAAI/IAAI, Vol. 2.

[17]  Sebastian Thrun,et al.  Robotic mapping: a survey , 2003 .

[18]  Hiroshi Ishiguro,et al.  Image-based memory of environment , 1996, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems. IROS '96.

[19]  Bin Yu,et al.  Regeneration in Markov chain samplers , 1995 .

[20]  Norman L. Johnson,et al.  Urn models and their application , 1977 .

[21]  Jun S. Liu,et al.  Sequential Imputations and Bayesian Missing Data Problems , 1994 .

[22]  Radford M. Neal Sampling from multimodal distributions using tempered transitions , 1996, Stat. Comput..