Coupled task scheduling for heterogeneous multi-robot system of two robot types performing complex-schedule order fulfillment tasks

被引:39
作者
Wang, Hanfu [1 ,2 ,3 ]
Chen, Weidong [1 ,2 ,3 ]
Wang, Jingchuan [1 ,2 ,3 ]
机构
[1] Shanghai Jiao Tong Univ, Inst Med Robot, Shanghai 200240, Peoples R China
[2] Shanghai Jiao Tong Univ, Dept Automat, Shanghai 200240, Peoples R China
[3] Minist Educ, Key Lab Syst Control & Informat Proc, Shanghai 200240, Peoples R China
基金
中国国家自然科学基金;
关键词
Task scheduling; Heterogeneous multi-robot system; Complex-schedule constraints; Block sequence graph; OPEN-SHOP PROBLEM; SERVICE AGENT; ALGORITHMS; ALLOCATION; TAXONOMY; TIME;
D O I
10.1016/j.robot.2020.103560
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
This paper addresses multi-robot task scheduling for two robot types arising from heterogeneous robotic order fulfillment systems. The heterogeneous multi-robot system comprises two types of robots with specialized and complementary capabilities to achieve long-cycle and multi-station order fulfillment tasks on a logistic network. This problem is extremely challenging because of innate complex-schedule constraints of tasks and coupled temporal-spatial relations between all robots. After set-theoretic and mixed integer linear programming problem formulations, we use coupled approach, instead of decoupled approaches to explore the synergy between heterogeneous robots, which is different from most existing similar works. To model the structural (complex-schedule) and quantitative (temporal-spatial) coupledness of robots' time-extended task schedules, an edge-weighted and vertex-weighted block sequence graph is introduced. Based on this model, time-extended task scheduling is achieved using rank-minimal heuristic and genetic algorithm metaheuristic. Theoretically, this model is complete and non-redundant. Empirically, compared with decoupled approach, optimality and efficiency of the proposed methods are evaluated on designed instances. The results demonstrate that coupled methods can achieve near-optimal solutions with higher performance ratio than decoupled methods in moderate time. At the same time, coupled methods can leverage spatial and temporal properties of miscellaneous tasks, and balance instantaneous and time-extended decisions to achieve tight collective synergy in the long run. (C) 2020 Elsevier B.V. All rights reserved.
引用
收藏
页数:16
相关论文
共 38 条
[1]  
Anand E., 2015, Intelligent Information Management, V7, P33, DOI DOI 10.4236/IIM.2015.71004
[2]   Simulated annealing and genetic algorithms for minimizing mean flow time in an open shop [J].
Andresen, Michael ;
Braesel, Heidemarie ;
Moerig, Marc ;
Tusch, Jan ;
Werner, Frank ;
Willenius, Per .
MATHEMATICAL AND COMPUTER MODELLING, 2008, 48 (7-8) :1279-1293
[3]  
[Anonymous], 2008, IEEE SPECTRUM, V45, P27
[4]  
[Anonymous], 2006, THESIS
[5]   The routing open-shop problem on a network: Complexity and approximation [J].
Averbakh, Igor ;
Berman, Oded ;
Chernykh, Ilya .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 173 (02) :531-539
[6]   Flexible open shop scheduling problem to minimize makespan [J].
Bai, Danyu ;
Zhang, Zhi-Hai ;
Zhang, Qiang .
COMPUTERS & OPERATIONS RESEARCH, 2016, 67 :207-215
[7]   Partially-Decoupled Service Agent - Transport Agent Task Allocation and Scheduling [J].
Bays, Matthew J. ;
Wettergren, Thomas A. .
JOURNAL OF INTELLIGENT & ROBOTIC SYSTEMS, 2019, 94 (02) :423-437
[8]   Service agent-transport agent task planning incorporating robust scheduling techniques [J].
Bays, Matthew J. ;
Wettergren, Thomas A. .
ROBOTICS AND AUTONOMOUS SYSTEMS, 2017, 89 :15-26
[9]  
Beck J. C., 2003, Proceedings, Thirteenth International Conference on Automated Planning and Scheduling, P267
[10]  
Beck J. Christopher, VEHICLE ROUTING JOB