Parallelism of Pick-and-Place operations by multi-gripper robotic arms

被引:31
作者
Moghaddam, Mohsen [1 ]
Nof, Shimon Y.
机构
[1] Purdue Univ, PRISM Ctr, 315 N Grant St, W Lafayette, IN 47907 USA
基金
美国国家科学基金会;
关键词
Swarm intelligence; Cubic Assignment Problem; Clustered Double Traveling Salesman Problem; Bio-Inspired Robotics; TRAVELING SALESMAN PROBLEM; COMPONENT PLACEMENT; FEEDER ASSIGNMENT; OPTIMIZATION; MACHINES; ALGORITHMS; SEQUENCE;
D O I
10.1016/j.rcim.2016.06.004
中图分类号
TP39 [计算机的应用];
学科分类号
081203 ; 0835 ;
摘要
This article defines the Parallel Pick-and-Place (PPNP) problem and develops a framework for optimization of its operations performed by multi-gripper robotic arms. The motivation lies in the lack of analytical methods for the parallelism of structured/unstructured Pick-and-Place (PNP) operations by robotic arms. Although the PPNP operations are mostly attributed to printed circuit board assembly, their applications span various other processes such as palletizing, packaging, warehousing, sorting, loading/unloading of machines, machine tending, inspection, remote maintenance, and robotic nurse assistance. Parallelism of the PNP operation is enabled by facilitating the robot's end effector with multiple grippers and magazines in order to perform simultaneous pickups and placements of items. Two different formulations of the PPNP process are developed regarding two cases: (1) Optimal routing while the pickup and placement positions are fixed; (2) Optimal routing and configuration of pickup and placement positions at the same time. An efficient swarm intelligence algorithm based on Ant System and Tabu Search is developed for handling the complexity of the PPNP problem. Through a reinforcement learning mechanism, the robot is provided with a certain level of intelligence to adapt to changes in its working environment and find the shortest route automatically, after relatively few computational iterations. Results of several experiments indicate superiority of the developed framework for the PPNP operation to conventional approaches in terms of cycle time, as an indicator of the overall movement distance and energy consumption. Published by Elsevier Ltd.
引用
收藏
页码:135 / 146
页数:12
相关论文
共 21 条
[1]   COMPONENT FIXTURE POSITIONING/SEQUENCING FOR PRINTED-CIRCUIT BOARD ASSEMBLY WITH CONCURRENT OPERATIONS [J].
AHMADI, J ;
AHMADI, R ;
MATSUO, H ;
TIRUPATI, D .
OPERATIONS RESEARCH, 1995, 43 (03) :444-457
[2]   Optimization of printed circuit board manufacturing:: Integrated modeling and algorithms [J].
Altinkemer, K ;
Kazaz, B ;
Köksalan, M ;
Moskowitz, H .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2000, 124 (02) :409-421
[3]  
[Anonymous], SPRINGER SERIES ACES
[4]   The multiple traveling salesman problem: an overview of formulations and solution procedures [J].
Bektas, T .
OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE, 2006, 34 (03) :209-219
[5]   Multirobot coordination in pick-and-place tasks on a moving conveyor [J].
Bozma, H. Isil ;
Kalalioglu, M. E. .
ROBOTICS AND COMPUTER-INTEGRATED MANUFACTURING, 2012, 28 (04) :530-538
[6]   Developing a varietal GA with ESMA strategy for solving the pick and place problem in printed circuit board assembly line [J].
Chang, Pei-Chann ;
Huang, Wei-Hsiu ;
Ting, Ching-Jung .
JOURNAL OF INTELLIGENT MANUFACTURING, 2012, 23 (05) :1589-1602
[7]   A particle swarm optimization approach to optimize component placement in printed circuit board assembly [J].
Chen, Yee-Ming ;
Lin, Chun-Ta .
INTERNATIONAL JOURNAL OF ADVANCED MANUFACTURING TECHNOLOGY, 2007, 35 (5-6) :610-620
[8]  
Chisman J.A., 1975, COMPUT OPER RES, P115
[9]   Ant colonies for the travelling salesman problem [J].
Dorigo, M ;
Gambardella, LM .
BIOSYSTEMS, 1997, 43 (02) :73-81
[10]   Ant system: Optimization by a colony of cooperating agents [J].
Dorigo, M ;
Maniezzo, V ;
Colorni, A .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 1996, 26 (01) :29-41