A mixed capability-based and optimization methodology for human-robot task allocation and scheduling

Andrea Monguzzi, Mahmoud Badawi, A. Zanchettin, P. Rocco
{"title":"A mixed capability-based and optimization methodology for human-robot task allocation and scheduling","authors":"Andrea Monguzzi, Mahmoud Badawi, A. Zanchettin, P. Rocco","doi":"10.1109/RO-MAN53752.2022.9900823","DOIUrl":null,"url":null,"abstract":"In this work, we address two crucial issues that arise in the design of a human-robot collaborative station for the assembly of products: the optimal task allocation and the scheduling problem. We propose an offline method to solve in series the two mentioned issues, considering a static allocation and taking into account several features such as the minimization of postural discomfort, operation processing times, idle times and hence the total cycle time. Our methodology consists of a mixed approach that combines a capability-based method, where the agents' capabilities are tested against a list of predefined criteria, with optimization. In particular, we formulate a modified version of the Hungarian Algorithm to solve also unbalanced assignment problems, where the number of tasks is different from the number of agents. The scheduling policy is obtained by means of a Mixed Integer Linear Programming (MILP) formulation, with a multi-objective optimization. Moreover, the concepts of operation, assembly tree and precedence graph are formalized, since they represent the inputs to our method, together with the information on the workstation layout and on the selected kind of robot. Finally, the proposed solution is applied to a case study to define the optimal task allocation and scheduling for two different workstation layouts: the results are compared and the best layout is accordingly selected.","PeriodicalId":250997,"journal":{"name":"2022 31st IEEE International Conference on Robot and Human Interactive Communication (RO-MAN)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 31st IEEE International Conference on Robot and Human Interactive Communication (RO-MAN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RO-MAN53752.2022.9900823","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this work, we address two crucial issues that arise in the design of a human-robot collaborative station for the assembly of products: the optimal task allocation and the scheduling problem. We propose an offline method to solve in series the two mentioned issues, considering a static allocation and taking into account several features such as the minimization of postural discomfort, operation processing times, idle times and hence the total cycle time. Our methodology consists of a mixed approach that combines a capability-based method, where the agents' capabilities are tested against a list of predefined criteria, with optimization. In particular, we formulate a modified version of the Hungarian Algorithm to solve also unbalanced assignment problems, where the number of tasks is different from the number of agents. The scheduling policy is obtained by means of a Mixed Integer Linear Programming (MILP) formulation, with a multi-objective optimization. Moreover, the concepts of operation, assembly tree and precedence graph are formalized, since they represent the inputs to our method, together with the information on the workstation layout and on the selected kind of robot. Finally, the proposed solution is applied to a case study to define the optimal task allocation and scheduling for two different workstation layouts: the results are compared and the best layout is accordingly selected.
基于混合能力的人机任务分配与调度优化方法
在这项工作中,我们解决了产品装配人机协作站设计中出现的两个关键问题:最优任务分配和调度问题。我们提出了一种离线方法来串联解决上述两个问题,考虑静态分配,并考虑几个特征,如最小化姿势不适,操作处理时间,空闲时间和总周期时间。我们的方法由一种混合方法组成,该方法结合了基于能力的方法,其中代理的能力根据一系列预定义的标准进行测试,并进行优化。特别地,我们制定了匈牙利算法的修改版本来解决不平衡分配问题,其中任务的数量与代理的数量不同。采用混合整数线性规划(MILP)方法求解调度策略,并进行多目标优化。此外,对操作、装配树和优先图的概念进行了形式化,因为它们代表了我们方法的输入,以及关于工作站布局和所选机器人类型的信息。最后,将所提出的解决方案应用于实例研究,定义了两种不同工作站布局的最优任务分配和调度,并对结果进行了比较,从而选择了最佳布局。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信