Computationally-Efficient Roadmap-based Inspection Planning via Incremental Lazy Search

The inspection-planning problem calls for computing motions for a robot that allow it to inspect a set of points of interest (POIs) while considering plan quality (e.g., plan length). This problem has applications across many domains where robots can help with inspection, including infrastructure maintenance, construction, and surgery. Incremental Random Inspection-roadmap Search (IRIS) is an asymptotically-optimal inspection planner that was shown to compute higher-quality inspection plans orders of magnitudes faster than the prior state-of-the-art method. In this paper, we significantly accelerate the performance of IRIS to broaden its applicability to more challenging real-world applications. A key computational challenge that IRIS faces is effectively searching roadmaps for inspection plans—a procedure that dominates its running time. In this work, we show how to incorporate lazy edge-evaluation techniques into IRIS’s search algorithm and how to reuse search efforts when a roadmap undergoes local changes. These enhancements, which do not compromise IRIS’s asymptotic optimality, enable us to compute inspection plans much faster than the original IRIS. We apply IRIS with the enhancements to simulated bridge inspection and surgical inspection tasks and show that our new algorithm for some scenarios can compute similar-quality inspection plans 570× faster than prior work.

[1]  Geoffrey A. Hollinger,et al.  Uncertainty-driven view planning for underwater inspection , 2012, 2012 IEEE International Conference on Robotics and Automation.

[2]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[3]  Kris Hauser,et al.  Lazy collision checking in asymptotically-optimal motion planning , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[4]  Siddhartha S. Srinivasa,et al.  Lazy Receding Horizon A* for Efficient Path Planning in Graphs with Expensive-to-Evaluate Edges , 2018, ICAPS.

[5]  Hanumant Singh,et al.  Robotic tools for deep water archaeology: Surveying an ancient shipwreck with an autonomous underwater vehicle , 2010, J. Field Robotics.

[6]  Robert J. Webster,et al.  Kinematic Design Optimization of a Parallel Surgical Robot to Maximize Anatomical Visibility via Motion Planning , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[7]  Franz S. Hover,et al.  Sampling-Based Coverage Path Planning for Inspection of Complex Structures , 2012, ICAPS.

[8]  Jan Faigl,et al.  Random Inspection Tree Algorithm in visual inspection with a realistic sensing model and differential constraints , 2016, 2016 IEEE International Conference on Robotics and Automation (ICRA).

[9]  Dana R. Yoerger,et al.  Autonomous underwater vehicle maps seafloor , 1997 .

[10]  Rudi Penne,et al.  A Gradient-Based Inspection Path Optimization Approach , 2018, IEEE Robotics and Automation Letters.

[11]  Nicholas M. Patrikalakis,et al.  Asymptotically optimal inspection planning using systems with differential constraints , 2013, 2013 IEEE International Conference on Robotics and Automation.

[12]  Micha Sharir,et al.  Algorithmic motion planning , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[13]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[14]  Stefan Edelkamp,et al.  Multiregion Inspection by Combining Clustered Traveling Salesman Tours With Sampling-Based Motion Planning , 2017, IEEE Robotics and Automation Letters.

[15]  David Wilkinson.  Iris , 2002, BMJ : British Medical Journal.

[16]  Robert J. Webster,et al.  Reconfigurable parallel continuum robots for incisionless surgery , 2016, 2016 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[17]  Wei Lin,et al.  Sampling-based coverage motion planning for industrial inspection application with redundant robotic system , 2017, 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[18]  Alan Kuntz,et al.  Toward Asymptotically-Optimal Inspection Planning via Efficient Near-Optimal Graph Search , 2019, Robotics: Science and Systems.

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

[20]  S. LaValle.  Rapidly-exploring random trees : a new tool for path planning , 1998 .

[21]  Maxim Likhachev,et al.  Planning Single-Arm Manipulations with N-Arm Robots , 2014, SOCS.

[22]  Roland Siegwart,et al.  Three-dimensional coverage path planning via viewpoint resampling and tour optimization for aerial robots , 2015, Autonomous Robots.

[23]  Siddhartha S. Srinivasa,et al.  Informed Sampling for Asymptotically Optimal Path Planning , 2018, IEEE Transactions on Robotics.

[24]  Siddhartha S. Srinivasa,et al.  Batch Informed Trees (BIT*): Sampling-based optimal planning via the heuristically guided search of implicit random geometric graphs , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

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

[26]  Roland Siegwart,et al.  An incremental sampling-based approach to inspection planning: the rapidly exploring random tree of trees , 2016, Robotica.

[27]  Michele Germani,et al.  Off-line view planning for the inspection of mechanical parts , 2013 .

[28]  Siddhartha S. Srinivasa,et al.  A Unifying Formalism for Shortest Path Problems with Expensive Edge Evaluations via Lazy Best-First Search over Paths with Edge Selectors , 2016, ICAPS.

[29]  Han-Lim Choi,et al.  Optimal control-based UAV path planning with dynamically-constrained TSP with neighborhoods , 2016, 2017 17th International Conference on Control, Automation and Systems (ICCAS).

[30]  Pankaj K. Agarwal,et al.  Sparsification of motion-planning roadmaps by edge contraction , 2013, 2013 IEEE International Conference on Robotics and Automation.

[31]  Stefan B. Williams,et al.  Generation and visualization of large‐scale three‐dimensional reconstructions from underwater robotic surveys , 2010, J. Field Robotics.

[32]  David Furcy,et al.  Lifelong Planning A , 2004, Artif. Intell..

[33]  Jonathan D. Gammell,et al.  A Survey of Asymptotically Optimal Sampling-based Motion Planning Methods , 2020, ArXiv.

[34]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[36]  Roland Siegwart,et al.  Structural inspection path planning via iterative viewpoint resampling with application to aerial robotics , 2015, 2015 IEEE International Conference on Robotics and Automation (ICRA).

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

[38]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2013, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[39]  Dongming Gan,et al.  Coverage Path Planning with Adaptive Viewpoint Sampling to Construct 3D Models of Complex Structures for the Purpose of Inspection , 2018, 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS).

[40]  Dan Halperin,et al.  Asymptotically-optimal Motion Planning using lower bounds on cost , 2014, 2015 IEEE International Conference on Robotics and Automation (ICRA).

[41]  Marco Pavone,et al.  Fast marching tree: A fast marching sampling-based method for optimal motion planning in many dimensions , 2013, ISRR.

[42]  Siddhartha S. Srinivasa,et al.  Generalized Lazy Search for Robot Motion Planning: Interleaving Search and Edge Evaluation via Event-based Toggles , 2019, ICAPS.

[43]  Kenji Shimada,et al.  Cycle time based multi-goal path optimization for redundant robotic systems , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[44]  Siddhartha S. Srinivasa,et al.  Generalizing Informed Sampling for Asymptotically-Optimal Sampling-Based Kinodynamic Planning via Markov Chain Monte Carlo , 2018, 2018 IEEE International Conference on Robotics and Automation (ICRA).

[45]  Arthur W. Mahoney,et al.  Continuum Reconfigurable Parallel Robots for Surgery: Shape Sensing and State Estimation With Uncertainty , 2017, IEEE Robotics and Automation Letters.

[46]  Lakmal Seneviratne,et al.  GPU accelerated coverage path planning optimized for accuracy in robotic inspection applications , 2016, 2016 IEEE 59th International Midwest Symposium on Circuits and Systems (MWSCAS).

[47]  Lakmal Seneviratne,et al.  A survey on inspecting structures using robotic systems , 2016 .

[48]  Franz S. Hover,et al.  Three-dimensional coverage planning for an underwater inspection robot , 2013, Int. J. Robotics Res..

[49]  Siddhartha S. Srinivasa,et al.  The Provable Virtue of Laziness in Motion Planning , 2017, ICAPS.

[50]  Kostas E. Bekris,et al.  Sparse roadmap spanners for asymptotically near-optimal motion planning , 2014, Int. J. Robotics Res..

[51]  M. Carreras,et al.  Mapping the Moon: Using a lightweight AUV to survey the site of the 17th century ship ‘La Lune’ , 2013, 2013 MTS/IEEE OCEANS - Bergen.

[52]  Geoffrey A. Hollinger,et al.  Active planning for underwater inspection and the benefit of adaptivity , 2012, Int. J. Robotics Res..

[53]  Thomas W. Reps,et al.  On the Computational Complexity of Dynamic Graph Problems , 1996, Theor. Comput. Sci..

[54]  Daniele Frigioni,et al.  Fully Dynamic Algorithms for Maintaining Shortest Paths Trees , 2000, J. Algorithms.