A Scan Matching Approach to SLAM with a Dynamic Likelihood Field

This paper presents a fast scan matching approach to online SLAM supported by a dynamic likelihood field. The dynamic likelihood field plays a central role in the approach, as it avoids the necessity to establish direct correspondences, it is the connection link between scan matching and the online SLAM and it has a low computational complexity. Scan matching is formulated as a non-linear least squares problem and solved by the Gauss-Newton method. Furthermore, to reduce the influences of outliers during optimization, a loss function is introduced. The proposed solution was evaluated using an objective benchmark designed to compare SLAM solutions and its execution times were also analyzed. It shows to be a fast and accurate online SLAM approach, suitable for real-time operation.

[1]  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).

[2]  Wolfram Burgard,et al.  Efficient grid-based spatial representations for robot navigation in dynamic environments , 2013, Robotics Auton. Syst..

[3]  Andrea Censi,et al.  An ICP variant using a point-to-line metric , 2008, 2008 IEEE International Conference on Robotics and Automation.

[4]  Sven Behnke,et al.  Sancta simplicitas - on the efficiency and achievable results of SLAM using ICP-based incremental registration , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[6]  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.

[7]  Peter Biber,et al.  The normal distributions transform: a new approach to laser scan matching , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[8]  Wolfram Burgard,et al.  Improved Techniques for Grid Mapping With Rao-Blackwellized Particle Filters , 2007, IEEE Transactions on Robotics.

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

[10]  Daniel P. Huttenlocher,et al.  Distance Transforms of Sampled Functions , 2012, Theory Comput..

[11]  Kaj Madsen,et al.  Methods for Non-Linear Least Squares Problems , 1999 .

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

[13]  Antoni Burguera,et al.  On the use of likelihood fields to perform sonar scan matching localization , 2009, Auton. Robots.

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

[15]  Wolfram Burgard,et al.  A Tree Parameterization for Efficiently Computing Maximum Likelihood Maps using Gradient Descent , 2007, Robotics: Science and Systems.

[16]  Evangelos E. Milios,et al.  Robot Pose Estimation in Unknown Environments by Matching 2D Range Scans , 1994, 1994 Proceedings of IEEE Conference on Computer Vision and Pattern Recognition.

[17]  Hans P. Moravec Sensor Fusion in Certainty Grids for Mobile Robots , 1988, AI Mag..

[18]  Luis Montesano,et al.  Probabilistic scan matching for motion estimation in unstructured environments , 2005, 2005 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Peter Cheeseman,et al.  On the Representation and Estimation of Spatial Uncertainty , 1986 .

[20]  Stergios I. Roumeliotis,et al.  Weighted range sensor matching algorithms for mobile robot displacement estimation , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

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

[22]  Cyrill Stachniss,et al.  Simultaneous Localization and Mapping , 2016, Springer Handbook of Robotics, 2nd Ed..

[23]  Andrew W. Fitzgibbon,et al.  Bundle Adjustment - A Modern Synthesis , 1999, Workshop on Vision Algorithms.