arrow
返回

A Novel Maximin-Based Multi-Objective Evolutionary Algorithm Using One-by-One Update Scheme for Multi-Robot Scheduling Optimization

delete2021-01-01
delete11
delete
OA
AI
S
Shujun Yang
Y
Yichuan Zhang
L
Lianbo Ma *
Y
Yan Song *
P
Ping Zhou
G
Gang Shi
H
Hanning Chen *
DOI:10.1109/ACCESS.2021.3105102delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
With the continuous development of E-commerce, warehouse logistics is also facing emerging challenges, including more batches of orders and shorter order processing cycles. When more orders need to be processed simultaneously, some existing task scheduling methods may not be able to give a suitable plan, which delays order processing and reduces the efficiency of the warehouse. Therefore, the intelligent warehouse system that uses autonomous robots for automated storage and intelligent order scheduling is becoming mainstream. Based on this concept, we propose a multi-robot cooperative scheduling system in the intelligent warehouse. The aim of the multi-robot cooperative scheduling system of the intelligent storage is to drive many robots in an intelligent warehouse to perform the distributed tasks in an optimal (e.g., time-saving and energy-conserved) way. In this paper, we propose a multi-robot cooperative task scheduling model in the intelligent warehouse. For this model, we design a maximin-based multi-objective algorithm, which uses a one-by-one update scheme to select individuals. In this algorithm, two indicators are devised to discriminate the equivalent individuals with the same maximin fitness value in the environmental selection process. The results on benchmark test suite show that our algorithm is indeed a useful optimizer. Then it is applied to settle the multi-robot scheduling problem in the intelligence warehouse. Simulation experiment results demonstrate the efficiency of the proposed algorithm on the real-world scheduling problem.
Keyword:
Task analysis
Robots
Robot kinematics
Optimization
Job shop scheduling
Warehousing
Evolutionary computation
Many-objective optimization
multi-objective optimization
maximin fitness function
one-by-one update scheme
multi-robot scheduling optimization
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

L
liaoning university
学者数:
5.7K
论文数: 3.5K
被引数: 2
S
shenyang institute of automation, cas
学者数:
400
论文数: 367
被引数: 1
N
northeastern university - china
学者数:
3.2W
论文数: 2.7W
被引数: 37
C
chinese academy of sciences
学者数:
56.7W
论文数: 45.0W
被引数: 704
学者 查看更多机构
引用论文

引用论文

A mechanism for scheduling multi robot intelligent warehouse system face with dynamic demand
err2018-12-14
err60
PREAI
errLi, Zhi; Barenji, Ali Vatankhah; Jiang, Jiazhi; Zhong, Ray Y.; Xu, Gangyan
err分享
err收藏
err分享
err收藏
TCDA: Truthful Combinatorial Double Auctions for Mobile Edge Computing in Industrial Internet of Things
err2021-01-01
err111
PREAI
errMa, Lianbo; Wang, Xueyi; Wang, Xingwei; Wang, Liang; Shi, Ying; Huang, Min
err分享
err收藏
学者 查看更多内容