面向众包的人工智能全局复杂任务分配研究

Jinwei Zhang, Jinpeng Wei
{"title":"面向众包的人工智能全局复杂任务分配研究","authors":"Jinwei Zhang, Jinpeng Wei","doi":"10.1109/ISAIAM55748.2022.00021","DOIUrl":null,"url":null,"abstract":"In the traditional crowdsourcing platform, every time a complex task is published, a new team needs to be formed from the system to meet the skill requirements of the task. However, this one-sided consideration of the assignment of tasks not only fails to enable workers to perform the appropriate tasks to the best of their ability, but also the number of successful tasks. This becomes even more difficult when a large number of complex tasks are distributed across the globe. The goal of this study is to focus on tasks and the assignment of global workers: to maximize the number of tasks successfully assigned, and to maximize the effort of the workers to complete the appropriate tasks. Then the task assignment process is abstracted into a weighted bipartite graph matching model, which is solved by an improved KM algorithm. Finally, experiments are carried out on real data sets, and the results show that, compared with the previous methods, the method proposed in this paper has achieved good results in increasing the number of successful assignments, improving work efficiency and reducing cost.","PeriodicalId":382895,"journal":{"name":"2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Crowdsourcing-oriented Global Complex Task Assignment Based on Artificial Intelligence\",\"authors\":\"Jinwei Zhang, Jinpeng Wei\",\"doi\":\"10.1109/ISAIAM55748.2022.00021\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the traditional crowdsourcing platform, every time a complex task is published, a new team needs to be formed from the system to meet the skill requirements of the task. However, this one-sided consideration of the assignment of tasks not only fails to enable workers to perform the appropriate tasks to the best of their ability, but also the number of successful tasks. This becomes even more difficult when a large number of complex tasks are distributed across the globe. The goal of this study is to focus on tasks and the assignment of global workers: to maximize the number of tasks successfully assigned, and to maximize the effort of the workers to complete the appropriate tasks. Then the task assignment process is abstracted into a weighted bipartite graph matching model, which is solved by an improved KM algorithm. Finally, experiments are carried out on real data sets, and the results show that, compared with the previous methods, the method proposed in this paper has achieved good results in increasing the number of successful assignments, improving work efficiency and reducing cost.\",\"PeriodicalId\":382895,\"journal\":{\"name\":\"2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISAIAM55748.2022.00021\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 2nd International Symposium on Artificial Intelligence and its Application on Media (ISAIAM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISAIAM55748.2022.00021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在传统的众包平台中,每次发布一个复杂的任务,都需要从系统中组建一个新的团队来满足任务的技能要求。然而,这种对任务分配的片面考虑,不仅不能使工人能够尽其所能地执行适当的任务,而且也不能保证成功完成任务的数量。当大量复杂的任务分布在全球各地时,这变得更加困难。本研究的目标是关注任务和全球工人的分配:最大限度地增加成功分配的任务数量,并最大限度地提高工人完成适当任务的努力。然后将任务分配过程抽象为加权二部图匹配模型,采用改进的KM算法求解。最后,在真实数据集上进行了实验,结果表明,与以往的方法相比,本文提出的方法在增加任务成功次数、提高工作效率和降低成本方面取得了较好的效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Crowdsourcing-oriented Global Complex Task Assignment Based on Artificial Intelligence
In the traditional crowdsourcing platform, every time a complex task is published, a new team needs to be formed from the system to meet the skill requirements of the task. However, this one-sided consideration of the assignment of tasks not only fails to enable workers to perform the appropriate tasks to the best of their ability, but also the number of successful tasks. This becomes even more difficult when a large number of complex tasks are distributed across the globe. The goal of this study is to focus on tasks and the assignment of global workers: to maximize the number of tasks successfully assigned, and to maximize the effort of the workers to complete the appropriate tasks. Then the task assignment process is abstracted into a weighted bipartite graph matching model, which is solved by an improved KM algorithm. Finally, experiments are carried out on real data sets, and the results show that, compared with the previous methods, the method proposed in this paper has achieved good results in increasing the number of successful assignments, improving work efficiency and reducing cost.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信