A Performance Index for Planar Repetitive Workspace Robots

When large surfaces need to be covered by a robotic system, the most common solution is to design or employ a robot with a comparably large workspace (WS), with high costs and high power requirements. In this paper, we propose a new methodology consisting in an efficient partitioning of the surface, in order to use robotic systems with a workspace of arbitrarily smaller size. These robots are called repetitive workspace robots (RWR). To support this method, we formally define a general index IRWR in order to evaluate the covering efficiency of the workspace. Three algorithms to compute the index are presented, the uniform expansion covering algorithm (UECA), the corrected inertial ellipsoid covering algorithm (CIECA), and the genetic covering algorithm (GCA). The GCA, which delivers a solution in the proximity of the global-best one, is used as a baseline for a comparison between the UECA and the CIECA. Eventually, we present the results of a performance analysis of the three algorithms in terms of computing time. The results show that the CIECA is the best algorithm for the evaluation of the IRWR, almost reaching the global-best solutions of the GCA. Finally, we illustrate a practical application with a comparison between two commercial industrial paint robots: the ABB™ IRB 550 and the CMA® Robotics GR 6100.

[1]  Yong K. Cho,et al.  Conceptual Design and Feasibility Analyses of a Robotic System for Automated Exterior Wall Painting , 2007 .

[2]  Leonhard E. Bernold,et al.  Development of a robotic bridge maintenance system , 1998 .

[3]  P. C. Schuur,et al.  Covering a Rectangle with Six and Seven Circles , 2000, Discret. Appl. Math..

[4]  Satoshi Tadokoro,et al.  A parallel cable-driven motion base for virtual acceleration , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[5]  Sanjiv Singh,et al.  A Robotic Excavator for Autonomous Truck Loading , 1999, Auton. Robots.

[6]  R. Kershner.  The Number of Circles Covering a Set , 1939 .

[7]  D. E. Goldberg,et al.  Genetic Algorithms in Search, Optimization & Machine Learning , 1989 .

[8]  P. C. Schuur,et al.  Improved Coverings of a Square with Six and Eight Equal Circles , 1996, Electron. J. Comb..

[9]  Stephen J. Wright,et al.  Packing Ellipsoids with Overlap , 2012, SIAM Rev..

[10]  P. Toint,et al.  A globally convergent augmented Lagrangian algorithm for optimization with general constraints and simple bounds , 1991 .

[11]  Oliver Sawodny,et al.  An automated gantry crane as a large workspace robot , 2002 .

[12]  A. Heppes,et al.  Covering a Rectangle With Equal Circles , 1997 .

[13]  Robert J. Fowler,et al.  Optimal Packing and Covering in the Plane are NP-Complete , 1981, Inf. Process. Lett..

[14]  L. W. Tsai,et al.  Robot Analysis: The Mechanics of Serial and Parallel Ma-nipulators , 1999 .

[15]  Kari J. Nurmela,et al.  Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles , 2000, Exp. Math..

[16]  Paolo Gallina,et al.  Manipulability of a planar wire driven haptic device , 2002 .

[17]  A. J. Dentsoras,et al.  Optimal Initial Positioning of Excavators in Digging Processes , 2010 .

[18]  Nicholas I. M. Gould,et al.  A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds , 1997, Math. Comput..