Real-time loop closure in 2D LIDAR SLAM

Portable laser range-finders, further referred to as LIDAR, and simultaneous localization and mapping (SLAM) are an efficient method of acquiring as-built floor plans. Generating and visualizing floor plans in real-time helps the operator assess the quality and coverage of capture data. Building a portable capture platform necessitates operating under limited computational resources. We present the approach used in our backpack mapping platform which achieves real-time mapping and loop closure at a 5 cm resolution. To achieve realtime loop closure, we use a branch-and-bound approach for computing scan-to-submap matches as constraints. We provide experimental results and comparisons to other well known approaches which show that, in terms of quality, our approach is competitive with established techniques.

[1]  Michael Bosse,et al.  Map Matching and Data Association for Large-Scale Two-dimensional Laser Scan-based SLAM , 2008, Int. J. Robotics Res..

[2]  Edwin Olson,et al.  M3RSM: Many-to-many multi-resolution scan matching , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[3]  Roland Siegwart,et al.  Two different tools for three-dimensional mapping: DE-based scan matching and feature-based loop detection , 2013, Robotica.

[4]  Edwin Olson,et al.  Occupancy grid rasterization in large environments for teams of robots , 2011, 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  Stefan Kohlbrecher,et al.  A flexible and scalable SLAM system with full 3D motion estimation , 2011, 2011 IEEE International Symposium on Safety, Security, and Rescue Robotics.

[6]  Sven Hellbach,et al.  Large scale place recognition in 2D LIDAR scans using Geometrical Landmark Relations , 2014, 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[7]  Cyrill Stachniss,et al.  On measuring the accuracy of SLAM algorithms , 2009, Auton. Robots.

[8]  Kurt Konolige,et al.  A low-cost laser distance sensor , 2008, 2008 IEEE International Conference on Robotics and Automation.

[9]  J. Clausen,et al.  Branch and Bound Algorithms-Principles and Examples , 2003 .

[10]  Thomas B. Schön,et al.  Learning to close loops from range data , 2011, Int. J. Robotics Res..

[11]  Kai Oliver Arras,et al.  FLIRT: Interest Regions for 2D Range Data with Applications to Robot Navigation , 2010, ISER.

[12]  Wolfram Burgard,et al.  Efficient Sparse Pose Adjustment for 2D mapping , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[13]  Edwin Olson,et al.  Real-time correlative scan matching , 2009, 2009 IEEE International Conference on Robotics and Automation.

[14]  Wolfram Burgard,et al.  G2o: A general framework for graph optimization , 2011, 2011 IEEE International Conference on Robotics and Automation.

[15]  Ailsa H. Land,et al.  An Automatic Method of Solving Discrete Programming Problems , 1960 .

[16]  Basilio Bona,et al.  A fast and accurate approximation for planar pose graph optimization , 2014, Int. J. Robotics Res..

[17]  Wolfram Burgard,et al.  Improving Grid-based SLAM with Rao-Blackwellized Particle Filters by Adaptive Proposals and Selective Resampling , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[18]  Wolfram Burgard,et al.  Robust map optimization using dynamic covariance scaling , 2013, 2013 IEEE International Conference on Robotics and Automation.

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