Allocating Multiple Types of Tasks to Heterogeneous Agents Based on the Theory of Comparative Advantage

Author:

Morisawa Toma1,Hayashi Kotaro1ORCID,Mizuuchi Ikuo1

Affiliation:

1. Department of Mechanical Systems Engineering, Tokyo University of Agriculture & Technology, 2-24-16 Nakacho, Koganei, Tokyo 184-8588, Japan

Abstract

We present a method to allocate multiple tasks with uncertainty to heterogeneous robots using the theory of comparative advantage: an economic theory that maximizes the benefit of specialization. In real applications, robots often must execute various tasks with uncertainty and future multirobot system will have to work effectively with people as a team. As an example, it may be necessary to explore an unknown environment while executing a main task with people, such as carrying, rescue, military, or construction. The proposed task allocation method is expected to reduce the total makespan (total length of task-execution time) compared with conventional methods in robotic exploration missions. We expect that our method is also effective in terms of calculation time compared with the time-extended allocation method (based on the solution of job-shop scheduling problems). We simulated carrying tasks and exploratory tasks, which include uncertainty conditions such as unknown work environments (2 tasks and 2 robots, multiple tasks and 2 robots, 2 robots and multiple tasks, and multiple tasks and multiple robots). In addition, we compared our method with full searching and methods that maximize the sum of efficiency in these simulations by several conditions: first, 2 tasks (carrying and exploring) in the four uncertain conditions (later time, new objects appearing, disobedient robots, and shorter carrying time) and second, many types of tasks to many types of robots in the three uncertain conditions (unknown carrying time, new objects appearing, and some reasonable agents). The proposed method is also effective in three terms: the task-execution time with an increasing number of objects, uncertain increase in the number of tasks during task execution, and uncertainty agents who are disobedient to allocation orders compared to full searching and methods that maximize the sum of efficiency. Additionally, we performed two real-world experiments with uncertainty.

Publisher

Hindawi Limited

Subject

General Computer Science,Control and Systems Engineering

Cited by 3 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3