TY - JOUR
T1 - Robust multi-objective multi-humanoid robots task allocation based on novel hybrid metaheuristic algorithm
AU - Saeedvand, Saeed
AU - Aghdasi, Hadi S.
AU - Baltes, Jacky
N1 - Publisher Copyright:
© 2019, Springer Science+Business Media, LLC, part of Springer Nature.
PY - 2019/12/1
Y1 - 2019/12/1
N2 - Nowadays humanoid robots have generally made dramatic progress, which can form a coalition replacing human work in dangerous environments such as rescue, defense, exploration, etc. In contrast to other types of robots, humanoid robots’ similarity to human make them more suitable for performing such a wide range of tasks. Rescue applications for robots, especially for humanoid robots are exciting. In rescue operating conditions, tasks’ dependencies, tasks’ repetitive accomplishment requirements, robots’ energy consumption, and total tasks’ accomplishment time are key factors. This paper investigates a practical variant of the Multi-Robots Task Allocation (MRTA) problem for humanoid robots as multi-humanoid robots’ task allocation (MHTA) problem. In order to evaluate relevant aspects of the MHTA problem, we proposed a robust Multi-Objective Multi-Humanoid Robots Task allocation (MO-MHTA) algorithm with four objectives, namely energy consumption, total tasks’ accomplishment time, robot’s idle time and fairness were optimized simultaneously in an evolutionary framework in MO-MHTA, which address for the first time. MO-MHTA exhibits multi-objective properties in real-world applications for humanoid robots in two phases. In the first phase, the tasks are partitioned in a fair manner with a proposed constraint k-medoid (CKM) algorithm. In the second phase, a new non-dominated sorting genetic algorithm with special genetic operators is applied. Evaluations based on extensive experiments on the newly proposed benchmark instances with three robust multi-objective evolutionary algorithms (MOEAs) are applied. The proposed algorithm achieves favorable results in comparison to six other algorithms. Besides, the proposed algorithm can be seen as benchmark algorithms for real-world MO-MHTA instances.
AB - Nowadays humanoid robots have generally made dramatic progress, which can form a coalition replacing human work in dangerous environments such as rescue, defense, exploration, etc. In contrast to other types of robots, humanoid robots’ similarity to human make them more suitable for performing such a wide range of tasks. Rescue applications for robots, especially for humanoid robots are exciting. In rescue operating conditions, tasks’ dependencies, tasks’ repetitive accomplishment requirements, robots’ energy consumption, and total tasks’ accomplishment time are key factors. This paper investigates a practical variant of the Multi-Robots Task Allocation (MRTA) problem for humanoid robots as multi-humanoid robots’ task allocation (MHTA) problem. In order to evaluate relevant aspects of the MHTA problem, we proposed a robust Multi-Objective Multi-Humanoid Robots Task allocation (MO-MHTA) algorithm with four objectives, namely energy consumption, total tasks’ accomplishment time, robot’s idle time and fairness were optimized simultaneously in an evolutionary framework in MO-MHTA, which address for the first time. MO-MHTA exhibits multi-objective properties in real-world applications for humanoid robots in two phases. In the first phase, the tasks are partitioned in a fair manner with a proposed constraint k-medoid (CKM) algorithm. In the second phase, a new non-dominated sorting genetic algorithm with special genetic operators is applied. Evaluations based on extensive experiments on the newly proposed benchmark instances with three robust multi-objective evolutionary algorithms (MOEAs) are applied. The proposed algorithm achieves favorable results in comparison to six other algorithms. Besides, the proposed algorithm can be seen as benchmark algorithms for real-world MO-MHTA instances.
KW - Energy efficient algorithm
KW - Multi-humanoid robots
KW - Multi-objective problem
KW - Task allocation
UR - http://www.scopus.com/inward/record.url?scp=85066899175&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85066899175&partnerID=8YFLogxK
U2 - 10.1007/s10489-019-01475-8
DO - 10.1007/s10489-019-01475-8
M3 - Article
AN - SCOPUS:85066899175
SN - 0924-669X
VL - 49
SP - 4097
EP - 4127
JO - Applied Intelligence
JF - Applied Intelligence
IS - 12
ER -