SLAM-Assisted Coverage Path Planning for Indoor LiDAR Mapping Systems

Applications involving autonomous navigation and planning of mobile agents can benefit greatly by employing online Simultaneous Localization and Mapping (SLAM) techniques, however, their proper implementation still warrants an efficient amalgamation with any offline path planning method that may be used for the particular application. In this paper, such a case of amalgamation is considered for a LiDAR-based indoor mapping system which presents itself as a 2D coverage path planning problem implemented along with online SLAM. This paper shows how classic offline Coverage Path Planning (CPP) can be altered for use with online SLAM by proposing two modifications: (i) performing convex decomposition of the polygonal coverage area to allow for an arbitrary choice of an initial point while still tracing the shortest coverage path and (ii) using a new approach to stitch together the different cells within the polygonal area to form a continuous coverage path. Furthermore, an alteration to the SLAM operation to suit the coverage path planning strategy is also made that evaluates navigation errors in terms of an area coverage cost function. The implementation results show how the combination of the two modified offline and online planning strategies allow for an improvement in the total area coverage by the mapping system - the modification thus presents an approach for modifying offline and online navigation strategies for robust operation.

[1]  Pere Ridao,et al.  Coverage path planning with realtime replanning for inspection of 3D underwater structures , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[2]  Marc Levoy,et al.  Efficient variants of the ICP algorithm , 2001, Proceedings Third International Conference on 3-D Digital Imaging and Modeling.

[3]  Ernest L. Hall,et al.  Region filling operations with random obstacle avoidance for mobile robots , 1988, J. Field Robotics.

[4]  Howie Choset,et al.  Path Planning for Robotic Demining and Development of a Test Platform , 2001 .

[5]  Hugh F. Durrant-Whyte,et al.  A solution to the simultaneous localization and map building (SLAM) problem , 2001, IEEE Trans. Robotics Autom..

[6]  Howie Choset,et al.  Exact cellular decompositions in terms of critical points of Morse functions , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[7]  Jian Jin,et al.  Optimal Coverage Path Planning for Arable Farming on 2D Surfaces , 2010 .

[8]  Cheng Fang,et al.  Coverage path planning for harbour seabed surveys using an autonomous underwater vehicle , 2010, OCEANS'10 IEEE SYDNEY.

[9]  Sebastian Thrun,et al.  FastSLAM: A Scalable Method for the Simultaneous Localization and Mapping Problem in Robotics , 2007 .

[10]  Shiqiang Zhu,et al.  Combined coverage path planning for autonomous cleaning robots in unstructured environments , 2008, 2008 7th World Congress on Intelligent Control and Automation.

[11]  Wesley H. Huang.  The Minimal Sum of Altitudes Decomposition for Coverage Algorithms , 2000 .

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

[13]  Ryan M. Eustice,et al.  Perception-driven navigation: Active visual SLAM for robotic area coverage , 2013, 2013 IEEE International Conference on Robotics and Automation.

[14]  François Michaud,et al.  Long-term online multi-session graph-based SPLAM with memory management , 2017, Autonomous Robots.

[15]  Esther M. Arkin,et al.  Approximation Algorithms for the Geometric Covering Salesman Problem , 1994, Discret. Appl. Math..

[16]  Howie Choset,et al.  Coverage for robotics – A survey of recent results , 2001, Annals of Mathematics and Artificial Intelligence.

[17]  Marc Carreras,et al.  A survey on coverage path planning for robotics , 2013, Robotics Auton. Syst..

[18]  G. Swaminathan.  Robot Motion Planning , 2006 .

[19]  Tiow Seng Tan,et al.  An O(n2 log n) Time Algorithm for the Minmax Angle Triangulation , 1992, SIAM J. Sci. Comput..

[20]  Richard Bellman,et al.  Dynamic Programming Treatment of the Travelling Salesman Problem , 1962, JACM.

[21]  M. Er,et al.  Coverage path planning for UAVs based on enhanced exact cellular decomposition method , 2011 .

[22]  A. Saalfeld.  Topologically Consistent Line Simplification with the Douglas-Peucker Algorithm , 1999 .

[23]  Darcy Bullock,et al.  Comparative Analysis of Potential Calibration Alternatives for a Multi-Unit LiDAR System , .