A scan matching method based on the area overlap of star-shaped polygons

We illustrate a method that performs scan matching by maximizing the intersection area of the scans. The intersection area is a robust parameter that is less prone to measurement errors with respect to alternative techniques. Furthermore, such technique does not require to associate each point of one scan to a point of the other one like in some popular algorithms. The relative pose that maximizes the overlap is estimated iteratively. Since the scans are represented by star-shaped polygons due to visibility properties, their intersection can be computed using an efficient linear-time traversal of the vertices. Then, the relative pose is updated under the hypothesis that the combinatorics of intersection is left unchanged and the procedure is repeated until the scans are aligned with sufficient precision.

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

[2]  David M. Mount,et al.  On the Area of Overlap of Translated Polygons , 1996, Comput. Vis. Image Underst..

[3]  Lindsay Kleeman,et al.  Fast Laser Scan Matching using Polar Coordinates , 2007, Int. J. Robotics Res..

[4]  Paul J. Besl,et al.  A Method for Registration of 3-D Shapes , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[6]  Antoine Vigneron.  Geometric optimization and sums of algebraic functions , 2014, TALG.

[7]  Wolfram Burgard,et al.  Fast and accurate SLAM with Rao-Blackwellized particle filters , 2007, Robotics Auton. Syst..

[8]  Chan-Su Shin,et al.  Maximizing the overlap of two planar convex sets under rigid motions , 2005, Symposium on Computational Geometry.

[9]  Hamid D. Taghirad,et al.  Feature-Based Laser Scan Matching For Accurate and High Speed Mobile Robot Localization , 2007, EMCR.

[10]  Florent Lamiraux,et al.  Metric-Based Scan Matching Algorithms for Mobile Robot Displacement Estimation , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[11]  JOSEPH O’ROURKE,et al.  A new linear algorithm for intersecting convex polygons , 1982, Comput. Graph. Image Process..

[12]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[13]  Ingemar J. Cox,et al.  Blanche-an experiment in guidance and navigation of an autonomous robot vehicle , 1991, IEEE Trans. Robotics Autom..

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

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

[16]  Tom Duckett,et al.  Mobile robot self-localisation using occupancy histograms and a mixture of Gaussian location hypotheses , 2001, Robotics Auton. Syst..

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

[18]  Luca Iocchi,et al.  Scan Matching in the Hough Domain , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

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

[20]  Joachim Hertzberg,et al.  High-speed laser localization for mobile robots , 2005, Robotics Auton. Syst..

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