Automated and Cycle Time Optimized Path Planning for Robot-Based Inspection Systems

Abstract Robot-based inspection systems, consisting of a standard industrial robot and an optical 3D sensor, increasingly gain importance within production in order to quantify the quality of products. These systems show advantages in terms of costs, flexibility and in-line capability. Based on the inspection plan of a product, the robot path for the inspection system is currently planned manually which is a very time consuming process. Consequently, an automated path planning algorithm generating a time optimized and collision-free path would improve the flexibility of robot-based inspection systems. The presented approach shows an automated and cycle time optimized path planning algorithm for robot-based inspection systems. This is realized by the probabilistic roadmap method applied on all measurement poses in combination with the A* search algorithm for the determination of weighted paths. Finally, the optimization of the path is reduced to a traveling salesman problem which is solved by the Christofides heuristic.

[1]  R. Bixby,et al.  On the Solution of Traveling Salesman Problems , 1998 .

[2]  Claudia Brückner.  Qualitätsmanagement: Das Praxishandbuch für die Automobilindustrie , 2011 .

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

[4]  Lydia E. Kavraki,et al.  Probabilistic roadmaps for path planning in high-dimensional configuration spaces , 1996, IEEE Trans. Robotics Autom..

[5]  Daniel J. Rosenkrantz,et al.  An analysis of several heuristics for the traveling salesman problem , 2013, Fundamental Problems in Computing.

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

[7]  Sanjeev Arora,et al.  Approximation schemes for NP-hard geometric optimization problems: a survey , 2003, Math. Program..

[8]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[9]  G. Reinelt.  The traveling salesman: computational solutions for TSP applications , 1994 .

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

[11]  Mitul Saha,et al.  Planning multi-goal tours for robot arms , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

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

[13]  Lydia E. Kavraki,et al.  Sampling-based robot motion planning: Towards realistic applications , 2007, Comput. Sci. Rev..

[14]  Liliana Favre,et al.  An Empirical Analysis of Approximation Algorithms for Euclidean TSP , 2009, CSC.

[15]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[16]  S. O. Krumke,et al.  Graphentheoretische Konzepte und Algorithmen , 2005 .

[17]  Narendra Ahuja,et al.  Gross motion planning—a survey , 1992, CSUR.

[18]  Tekouo Moutchiho,et al.  A New Programming Approach for Robot-based Flexible Inspection Systems , 2012 .

[19]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.