Market-based task allocation by using assignment problem

IF 8.6 1区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS IEEE Transactions on Systems Man Cybernetics-Systems Pub Date : 2010-11-22 DOI:10.1109/ICSMC.2010.5642222
B. Kaleci, O. Parlaktuna, M. Ozkan, G. Kirlik
{"title":"Market-based task allocation by using assignment problem","authors":"B. Kaleci, O. Parlaktuna, M. Ozkan, G. Kirlik","doi":"10.1109/ICSMC.2010.5642222","DOIUrl":null,"url":null,"abstract":"In this study, a market-based task allocation method is proposed. In the trading process, the energy model of a robot platform is used to calculate the price and cost for a task. In order to determine the winner robot(s), two auction clearing algorithms, which are named as Iterative and Highest-Bid Task for Robots (HBTR), are proposed. Additionally, assignment problem is used to determine instantaneous optimal task-robot matching. The Hungarian algorithm is implemented to solve optimal assignment problem. In the implementation of the algorithms, three types of tasks are used: cleaning, carrying and monitoring. The tasks consist of three important features: delicacy, priority, and the task completion time. These tasks are assigned to the members of a heterogeneous robot team, according to the proposed task allocation method.","PeriodicalId":48915,"journal":{"name":"IEEE Transactions on Systems Man Cybernetics-Systems","volume":null,"pages":null},"PeriodicalIF":8.6000,"publicationDate":"2010-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Systems Man Cybernetics-Systems","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1109/ICSMC.2010.5642222","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"AUTOMATION & CONTROL SYSTEMS","Score":null,"Total":0}
引用次数: 20

Abstract

In this study, a market-based task allocation method is proposed. In the trading process, the energy model of a robot platform is used to calculate the price and cost for a task. In order to determine the winner robot(s), two auction clearing algorithms, which are named as Iterative and Highest-Bid Task for Robots (HBTR), are proposed. Additionally, assignment problem is used to determine instantaneous optimal task-robot matching. The Hungarian algorithm is implemented to solve optimal assignment problem. In the implementation of the algorithms, three types of tasks are used: cleaning, carrying and monitoring. The tasks consist of three important features: delicacy, priority, and the task completion time. These tasks are assigned to the members of a heterogeneous robot team, according to the proposed task allocation method.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于分配问题的市场任务分配
本文提出了一种基于市场的任务分配方法。在交易过程中,利用机器人平台的能量模型计算任务的价格和成本。为了确定赢家机器人,提出了迭代和最高出价任务机器人(HBTR)两种拍卖清算算法。另外,利用分配问题确定瞬时最优任务-机器人匹配。采用匈牙利算法求解最优分配问题。在算法的实现中,使用了三种类型的任务:清洁、搬运和监控。任务有三个重要特征:精致性、优先性和任务完成时间。根据提出的任务分配方法,将这些任务分配给异构机器人团队的成员。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
IEEE Transactions on Systems Man Cybernetics-Systems
IEEE Transactions on Systems Man Cybernetics-Systems AUTOMATION & CONTROL SYSTEMS-COMPUTER SCIENCE, CYBERNETICS
CiteScore
18.50
自引率
11.50%
发文量
812
审稿时长
6 months
期刊介绍: The IEEE Transactions on Systems, Man, and Cybernetics: Systems encompasses the fields of systems engineering, covering issue formulation, analysis, and modeling throughout the systems engineering lifecycle phases. It addresses decision-making, issue interpretation, systems management, processes, and various methods such as optimization, modeling, and simulation in the development and deployment of large systems.
期刊最新文献
Table of Contents Table of Contents Guest Editorial Enabling Technologies and Systems for Industry 5.0: From Foundation Models to Foundation Intelligence IEEE Transactions on Systems, Man, and Cybernetics publication information IEEE Transactions on Systems, Man, and Cybernetics publication information
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1