Planning Complex Inspection Tasks Using Redundant Roadmaps

The aim of this work is fast, automated planning of robotic inspections involving complex 3D structures. A model comprised of discrete geometric primitives is provided as input, and a feasible robot inspection path is produced as output. Our algorithm is intended for tasks in which 2.5D algorithms, which divide an inspection into multiple 2D slices, and segmentation-based approaches, which divide a structure into simpler components, are unsuitable. This degree of 3D complexity has been introduced by the application of autonomous in-water ship hull inspection; protruding structures at the stern (propellers, shafts, and rudders) are positioned in close proximity to one another and to the hull, and clearance is an issue for a mobile robot. A global, sampling-based approach is adopted, in which all the structures are simultaneously considered in planning a path. First, the state space of the robot is discretized by constructing a roadmap of feasible states; construction ceases when each primitive is observed by a specified number of states. Once a roadmap is produced, the set cover problem and traveling salesman problem are approximated in sequence to build a feasible inspection tour. We analyze the performance of this procedure in solving one of the most complex inspection planning tasks to date, covering the stern of a large naval ship, using an a priori triangle mesh model obtained from real sonar data and comprised of 100,000 primitives. Our algorithm generates paths on a par with dual sampling, with reduced computational effort.

[1]  Tim Roughgarden,et al.  Planning Tours of Robotic Arms among Partitioned Goals , 2006, Int. J. Robotics Res..

[2]  Ramesh Krishnamurti,et al.  View Planning Problem with Combined View and Traveling Cost , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[3]  G. Roth,et al.  View planning for automated three-dimensional object reconstruction and inspection , 2003, CSUR.

[4]  Michel Gendreau,et al.  The Covering Tour Problem , 1997, Oper. Res..

[5]  John R. Current,et al.  The Covering Salesman Problem , 1989, Transp. Sci..

[6]  Howie Choset,et al.  Coverage Path Planning: The Boustrophedon Cellular Decomposition , 1998 .

[7]  Jean-Claude Latombe,et al.  On Delaying Collision Checking in PRM Planning: Application to Multi-Robot Coordination , 2002, Int. J. Robotics Res..

[8]  Brian W. Kernighan,et al.  An Effective Heuristic Algorithm for the Traveling-Salesman Problem , 1973, Oper. Res..

[9]  Héctor H. González-Baños,et al.  A randomized art-gallery algorithm for sensor placement , 2001, SCG '01.

[10]  T. Shermer.  Recent Results in Art Galleries , 1992 .

[11]  Jean-Claude Latombe,et al.  Planning Robot Motions for Range-Image Acquisition and Automatic 3D Model Construction , 1998 .

[12]  Michael M. Kazhdan,et al.  Poisson surface reconstruction , 2006, SGP '06.

[13]  Benjamin W. Wah,et al.  Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem , 1993, Inf. Sci..

[14]  Simon Parsons,et al.  Principles of Robot Motion: Theory, Algorithms and Implementations by Howie Choset, Kevin M. Lynch, Seth Hutchinson, George Kantor, Wolfram Burgard, Lydia E. Kavraki and Sebastian Thrun, 603 pp., $60.00, ISBN 0-262-033275 , 2007, The Knowledge Engineering Review.

[15]  Esther M. Arkin,et al.  Approximating the Tree and Tour Covers of a Graph , 1993, Inf. Process. Lett..

[16]  Peter K. Allen,et al.  View planning and automated data acquisition for three-dimensional modeling of complex sites , 2009 .

[17]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[18]  Philippe Pasquier,et al.  Complete and robust cooperative robot area coverage with limited range , 2010, 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[19]  Howie Choset,et al.  Hierarchical Segmentation of Surfaces Embedded in R3 for Auto-Body Painting , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[20]  Franz S. Hover,et al.  A Vehicle System for Autonomous Relative Survey of In-Water Ships , 2007 .

[21]  William J. Cook,et al.  The Traveling Salesman Problem: A Computational Study , 2007 .

[22]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[23]  Vijay Kumar,et al.  Time-optimal UAV trajectory planning for 3D urban structure coverage , 2008, 2008 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[24]  William J. Cook,et al.  Chained Lin-Kernighan for Large Traveling Salesman Problems , 2003, INFORMS Journal on Computing.

[25]  Adrian Zafiu,et al.  Theory, Algorithms and Applications for Solar Panel MPP Tracking , 2010 .

[26]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[27]  Joel W. Burdick,et al.  A Coverage Algorithm for Multi-robot Boundary Inspection , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[28]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[29]  Lydia E. Kavraki,et al.  Randomized planning for short inspection paths , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[30]  Nicos Christofides.  Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem , 1976, Operations Research Forum.

[31]  Dirk C. Mattfeld,et al.  A Computational Study , 1996 .

[32]  C. Johnson.  Progress and Prospects , 1991 .

[33]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

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

[35]  Joel W. Burdick,et al.  Multi-robot boundary coverage with plan revision , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[36]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[37]  Howie Choset,et al.  Uniform Coverage of Automotive Surface Patches , 2005, Int. J. Robotics Res..

[38]  Paul H. Gobster,et al.  Editorial: Progress and prospects , 2012 .

[39]  Matteo Fischetti,et al.  A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem , 1997, Oper. Res..

[40]  Steven M. LaValle,et al.  Rapidly-Exploring Random Trees: Progress and Prospects , 2000 .