Multi-station test scheduling optimization method for industrial robot servo system

被引:10
作者
Tang, Shaomin [1 ]
Liu, Guixiong [1 ]
Lin, Zhiyu [1 ]
Li, Xiaobing [2 ]
机构
[1] South China Univ Technol, Sch Mech & Automot Engn, Guangzhou 510640, Peoples R China
[2] CEPREI, Guangzhou 510610, Peoples R China
关键词
Industrial robot; Servo system; Performance testing; Scheduling model; Scheduling optimization; KNAPSACK-PROBLEM; ALGORITHM;
D O I
10.1007/s12652-020-02577-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This study examined the test scheduling optimization problem of industrial robot servo system (IRSS) samples with unequal numbers of different types of test items on the multiple IRSS comprehensive test platforms with the same function. In order to improve IRSS performance test efficiency, a multi-station test scheduling optimization method, which combines IRSS sample-level scheduling and test item-level scheduling, was proposed. First, the IRSS sample-level scheduling was carried out, and a model was established with reference to the identical parallel machine problem (IPMP). The optimal result of IRSS sample-level multi-station scheduling was obtained by solving the model. Second, based on the result of IRSS sample-level multi-station scheduling, and taking the ideal optimal test completion time of IRSS multi-station scheduling as the target, the test items at the stations were reallocated to obtain the optimal scheduling result. Finally, an application example was used to verify the efficiency of the proposed method, and the experiment result showed that the proposed method can effectively fulfill the optimal allocation of different IRSS test items of multiple IRSS samples on multiple IRSS comprehensive test platforms. The test time was 247 min shorter than the conventional sequential parallel test and only one min longer than the ideal optimal test completion time.
引用
收藏
页码:1321 / 1337
页数:17
相关论文
共 41 条
[1]   A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph [J].
Bettinelli, Andrea ;
Cacchiani, Valentina ;
Malaguti, Enrico .
INFORMS JOURNAL ON COMPUTING, 2017, 29 (03) :457-473
[2]   Robot Control Overview: An Industrial Perspective [J].
Brogardh, Torgny .
MODELING IDENTIFICATION AND CONTROL, 2009, 30 (03) :167-180
[3]   Minimization of test time in system on chip using artificial intelligence-based test scheduling techniques [J].
Chandrasekaran, Gokul ;
Periyasamy, Sakthivel ;
Rajamanickam, Karthikeyan Panjappagounder' .
NEURAL COMPUTING & APPLICATIONS, 2020, 32 (09) :5303-5312
[4]   Artificial Bee Colony Algorithm for the Parallel Test Tasks Scheduling [J].
Chen Li'an ;
Xiao Mingqing ;
Yu Hang ;
Zhao Liangliang .
MANUFACTURING ENGINEERING AND AUTOMATION II, PTS 1-3, 2012, 591-593 :2478-2481
[5]   Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem [J].
Clautiaux, Francois ;
Sadykov, Ruslan ;
Vanderbeck, Francois ;
Viaud, Quentin .
DISCRETE OPTIMIZATION, 2018, 29 :18-44
[6]  
COFFMAN EG, 1978, SIAM J COMPUT, V7, P1, DOI 10.1137/0207001
[7]  
CONNOLLY D, 1991, J OPER RES SOC, V42, P513
[8]   An ILS heuristic for the ship scheduling problem: application in the oil industry [J].
Cunha, Victor ;
Santos, Iuri ;
Pessoa, Luciana ;
Hamacher, Silvio .
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2020, 27 (01) :197-218
[9]   A swarm optimization-based search algorithm for the quadratic knapsack problem with conflict Graphs [J].
Dahmani, Isma ;
Hifi, Mhand ;
Saadi, Toufik ;
Yousef, Labib .
EXPERT SYSTEMS WITH APPLICATIONS, 2020, 148
[10]   The design, simulation, and experiment of high-accuracy multi-axle electro-hydraulic control servo steering system [J].
Du, Heng ;
Wei, JianHua ;
Fang, JinHui .
ADVANCES IN MECHANICAL ENGINEERING, 2016, 8 (10) :1-15