Robust multi-robot coordination in pick-and-place tasks based on part-dispatching rules

This paper addresses the problem of realizing multi-robot coordination that is robust against pattern variation in a pick-and-place task. To improve productivity and reduce the number of parts remaining on the conveyor, a robust and appropriate part flow and multi-robot coordinate strategy are needed. We therefore propose combining part-dispatching rules to coordinate robots, by integrating a greedy randomized adaptive search procedure (GRASP) and a Monte Carlo strategy (MCS). GRASP is used to search for the appropriate combination of part-dispatching rules, and MCS is used to estimate the minimum-maximal part flow for one combination of part-dispatching rules. The part-dispatching rule of first-in-first-out is used to control the final robot in the multi-robot system to pick up parts left by other robots, and the part-dispatching rule of shortest processing time is used to make the other robots pick up as many parts as possible. By comparing it with non-cooperative game theory, we verify that the appropriate combination of part-dispatching rules is effective in improving the productivity of a multi-robot system. By comparing it with a genetic algorithm, we also verify that MCS is effective in estimating minimum-maximal part flow. The task-completion success rate derived via the proposed method reached 99.4% for 10,000 patterns. Propose combination of part-dispatching rules to coordinate multi-robot system.Pattern variation in a pick-and-place task is taken into account.Achieve an appropriate part flow and combination of part-dispatching rules.Integrate a greedy randomized adaptive search procedure with a Monte Carlo strategy.

[1]  Jun S. Liu,et al.  Monte Carlo strategies in scientific computing , 2001 .

[2]  Archie C. Chapman,et al.  A unifying framework for iterative approximate best-response algorithms for distributed constraint optimization problems1 , 2011, The Knowledge Engineering Review.

[3]  Jun Ota,et al.  Flow Path Network Design for Robust AGV Systems Against Tasks Using Competitive Coevolution , 2010, J. Robotics Mechatronics.

[4]  F. Pukelsheim.  The Three Sigma Rule , 1994 .

[5]  H. Scheffé,et al.  The Analysis of Variance , 1960 .

[6]  Bernhard Sendhoff,et al.  Robust Optimization - A Comprehensive Survey , 2007 .

[7]  James H. Steiger,et al.  Point Estimation, Hypothesis Testing, and Interval Estimation Using the RMSEA: Some Comments and a Reply to Hayduk and Glaser , 2000 .

[8]  Roger D. Quinn,et al.  Testing and analysis of a flexible feeding system , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[9]  Talal M. Alkhamis,et al.  A comparison between simulated annealing, genetic algorithm and tabu search methods for the unconstrained quadratic Pseudo-Boolean function , 2000 .

[10]  Vijay Kumar,et al.  A Framework and Architecture for Multi-Robot Coordination , 2000, ISER.

[11]  Charles H. Bennett,et al.  Efficient estimation of free energy differences from Monte Carlo data , 1976 .

[12]  Randall S. Sexton,et al.  Optimization of neural networks: A comparative analysis of the genetic algorithm and simulated annealing , 1999, Eur. J. Oper. Res..

[13]  Jun Ota,et al.  Part dispatching rule-based multi-robot coordination in pick-and-place task , 2012, 2012 IEEE International Conference on Robotics and Biomimetics (ROBIO).

[14]  Michael N. Vrahatis,et al.  Particle swarm optimization for minimax problems , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[15]  Lynne E. Parker,et al.  ALLIANCE: an architecture for fault tolerant multirobot cooperation , 1998, IEEE Trans. Robotics Autom..

[16]  Fabrice R. Noreils,et al.  Toward a Robot Architecture Integrating Cooperation between Mobile Robots: Application to Indoor Environment , 1993, Int. J. Robotics Res..

[17]  Li Lin,et al.  Optimization of cycle time and kinematic energy in a robot/conveyor system with variable pick-up locations , 1993 .

[18]  Jianhui Li,et al.  Modelling robotic palletising process with two robots using queuing theory , 2008 .

[19]  Beno Benhabib,et al.  Motion planning for multi-robot assembly systems , 2000, Int. J. Comput. Integr. Manuf..

[20]  Giacomo Maria Galante,et al.  Minimizing the cycle time in serial manufacturing systems with multiple dual-gripper robots , 2006 .

[21]  Daniel Vanderpooten,et al.  Min-max and min-max regret versions of combinatorial optimization problems: A survey , 2009, Eur. J. Oper. Res..

[22]  Kazuhiro Kosuge,et al.  Task-oriented control of single-master multi-slave manipulator system , 1994, Robotics Auton. Syst..

[23]  S. S. Panwalkar,et al.  A Survey of Scheduling Rules , 1977, Oper. Res..

[24]  Mauricio G. C. Resende,et al.  Greedy Randomized Adaptive Search Procedures , 1995, J. Glob. Optim..

[25]  Shimon Y. Nof,et al.  Operational characteristics of multi-robot systems with cooperation , 1989 .

[26]  Hulya Yalcin,et al.  Visual processing and classification of items on a moving conveyor: a selective perception approach , 2002 .

[27]  R. Mattone,et al.  Sorting of items on a moving conveyor belt. Part 2: performance evaluation and optimization of pick-and-place operations , 2000 .

[28]  Xiaoping Du,et al.  The use of metamodeling techniques for optimization under uncertainty , 2001 .

[29]  B. Muthén,et al.  How to Use a Monte Carlo Study to Decide on Sample Size and Determine Power , 2002 .

[30]  H. I. Bozma,et al.  Multirobot coordination in pick-and-place tasks on a moving conveyor , 2012 .

[31]  Christodoulos A. Floudas,et al.  A new robust optimization approach for scheduling under uncertainty: II. Uncertainty with known probability distribution , 2007, Comput. Chem. Eng..

[32]  J. Teugels,et al.  Statistics of Extremes , 2004 .

[33]  Wolfram Burgard,et al.  Monte Carlo Localization: Efficient Position Estimation for Mobile Robots , 1999, AAAI/IAAI.

[34]  Celso C. Ribeiro,et al.  Greedy Randomized Adaptive Search Procedures , 2003, Handbook of Metaheuristics.

[35]  J. Ota,et al.  Nursing Care Scheduling Problem: Analysis of Inpatient Nursing , 2009 .

[36]  Jean-Claude Latombe,et al.  On-Line Manipulation Planning for Two Robot Arms in a Dynamic Environment , 1997, Int. J. Robotics Res..

[37]  Enrico Pagello,et al.  Cooperative behaviors in multi-robot systems through implicit communication , 1999, Robotics Auton. Syst..

[38]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[39]  S. A. Mahmoud,et al.  Control and communications for multiple, cooperating robots , 1989 .

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