DP-SLAM: Fast, Robust Simultaneous Localization and Mapping Without Predetermined Landmarks

We present a novel, laser range finder based algorithm for simultaneous localization and mapping (SLAM) for mobile robots. SLAM addresses the problem of constructing an accurate map in real time despite imperfect information about the robot's trajectory through the environment. Unlike other approaches that assume predetermined landmarks (and must deal with a resulting dataassociation problem) our algorithm is purely laser based. Our algorithm uses a particle filter to represent both robot poses and possible map configurations. By using a new map representation, which we call distributed particle (DP) mapping, we are able to maintain and update hundreds of candidate maps and robot poses efficiently. The worst-case complexity of our algorithm per laser sweep is log-quadratic in the number of particles we maintain and linear in the area swept out by the laser. However, in practice our run time is usually much less than that. Our technique contains essentially no assumptions about the environment yet it is accurate enough to close loops of 60m in length with crisp, perpendicular edges on corridors and minimal or no misalignment errors.

[1]  Evangelos E. Milios,et al.  Globally Consistent Range Scan Alignment for Environment Mapping , 1997, Auton. Robots.

[2]  Kevin P. Murphy,et al.  Bayesian Map Learning in Dynamic Environments , 1999, NIPS.

[3]  Wolfram Burgard,et al.  Sonar-Based Mapping of Large-Scale Mobile Robot Environments using EM , 1999, ICML.

[4]  D. Fox,et al.  Sonar-Based Mapping With Mobile Robots Using EM , 1999 .

[5]  Wolfram Burgard,et al.  Monte Carlo Localization: Efficient Position Estimation for Mobile Robots , 1999, AAAI/IAAI.

[6]  Kurt Konolige,et al.  Incremental mapping of large cyclic environments , 1999, Proceedings 1999 IEEE International Symposium on Computational Intelligence in Robotics and Automation. CIRA'99 (Cat. No.99EX375).

[7]  Ronen I. Brafman,et al.  Reasoning With Conditional Ceteris Paribus Preference Statements , 1999, UAI.

[8]  Sebastian Thrun,et al.  Probabilistic Algorithms in Robotics , 2000, AI Mag..

[9]  Ronen I. Brafman,et al.  UCP-Networks: A Directed Graphical Representation of Conditional Utilities , 2001, UAI.

[10]  Sebastian Thrun,et al.  A Probabilistic On-Line Mapping Algorithm for Teams of Mobile Robots , 2001, Int. J. Robotics Res..

[11]  Nando de Freitas,et al.  Sequential Monte Carlo Methods in Practice , 2001, Statistics for Engineering and Information Science.

[12]  Ronen I. Brafman,et al.  Introducing Variable Importance Tradeoffs into CP-Nets , 2002, UAI.

[13]  Sebastian Thrun,et al.  FastSLAM: a factored solution to the simultaneous localization and mapping problem , 2002, AAAI/IAAI.

[14]  C. Domshlak,et al.  Reasoning about soft constraints and conditional preferences: complexity results and approximation techniques , 2003, IJCAI.

[15]  Sebastian Thrun,et al.  Simultaneous localization and mapping with unknown data association using FastSLAM , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[16]  Ronen I. Brafman,et al.  Extended Semantics and Optimization Algorithms for CP‐Networks , 2004, Comput. Intell..

[17]  Nic Wilson,et al.  Consistency and Constrained Optimisation for Conditional Preferences , 2004, ECAI.

[18]  Jon Doyle,et al.  Utility Functions for Ceteris Paribus Preferences , 2004, Comput. Intell..

[19]  Jérôme Lang,et al.  Logical Preference Representation and Combinatorial Vote , 2004, Annals of Mathematics and Artificial Intelligence.

[20]  Nic Wilson,et al.  Extending CP-Nets with Stronger Conditional Preference Statements , 2004, AAAI.

[21]  Miroslaw Truszczynski,et al.  The computational complexity of dominance and consistency in CP-nets , 2005, IJCAI.