A Dynamic Task Assignment Framework based on Prediction and Adaptive Batching

Lijun Sun, Xiaojie Yu, Shicong Chen, Yang Yan
{"title":"A Dynamic Task Assignment Framework based on Prediction and Adaptive Batching","authors":"Lijun Sun, Xiaojie Yu, Shicong Chen, Yang Yan","doi":"10.1109/IPCCC50635.2020.9391525","DOIUrl":null,"url":null,"abstract":"With the continuous popularization of smart devices, a new computing paradigm–Spatial Crowdsourcing(SC) came into being. As an important part of SC, task assignment has received more and more attention. However, in the real scenario, the emergence of tasks is random and dynamic, which pose a huge challenge to task assignment. In order to solve this challenge, we propose a Dynamic Task Assignment Framework based on Prediction and Adaptive Batching (DTAF-PAB), which utilizes the Gated Recurrent Unit (GRU) in deep learning to predict the number of tasks entering a specific area, and propose an adaptive batching algorithm based on Deep Q Network (DQN) to dynamically adjust the size of batches, thereby improving the overall benefit of assignment. We use datasets from the real world to evaluate the competitiveness of DTAF-PAB and the experimental results show that the proposed framework is superior to other existing technologies in terms of both predictive performance and crowdsourcing platform benefit.","PeriodicalId":226034,"journal":{"name":"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE 39th International Performance Computing and Communications Conference (IPCCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPCCC50635.2020.9391525","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

With the continuous popularization of smart devices, a new computing paradigm–Spatial Crowdsourcing(SC) came into being. As an important part of SC, task assignment has received more and more attention. However, in the real scenario, the emergence of tasks is random and dynamic, which pose a huge challenge to task assignment. In order to solve this challenge, we propose a Dynamic Task Assignment Framework based on Prediction and Adaptive Batching (DTAF-PAB), which utilizes the Gated Recurrent Unit (GRU) in deep learning to predict the number of tasks entering a specific area, and propose an adaptive batching algorithm based on Deep Q Network (DQN) to dynamically adjust the size of batches, thereby improving the overall benefit of assignment. We use datasets from the real world to evaluate the competitiveness of DTAF-PAB and the experimental results show that the proposed framework is superior to other existing technologies in terms of both predictive performance and crowdsourcing platform benefit.
基于预测和自适应批处理的动态任务分配框架
随着智能设备的不断普及,一种新的计算范式——空间众包(spatial Crowdsourcing, SC)应运而生。任务分配作为供应链管理的重要组成部分,越来越受到重视。然而,在实际场景中,任务的出现是随机的、动态的,这给任务分配带来了巨大的挑战。为了解决这一挑战,我们提出了一种基于预测和自适应批处理的动态任务分配框架(DTAF-PAB),该框架利用深度学习中的门控循环单元(GRU)来预测进入特定区域的任务数量,并提出了一种基于深度Q网络(DQN)的自适应批处理算法来动态调整批处理的大小,从而提高分配的整体效益。我们使用来自现实世界的数据集来评估DTAF-PAB的竞争力,实验结果表明,所提出的框架在预测性能和众包平台效益方面优于其他现有技术。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信