PPO-TA: Adaptive task allocation via Proximal Policy Optimization for spatio-temporal crowdsourcing

IF 7.2 1区 计算机科学 Q1 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Knowledge-Based Systems Pub Date : 2023-03-15 DOI:10.1016/j.knosys.2023.110330
Bingxu Zhao , Hongbin Dong , Yingjie Wang , Tingwei Pan
{"title":"PPO-TA: Adaptive task allocation via Proximal Policy Optimization for spatio-temporal crowdsourcing","authors":"Bingxu Zhao ,&nbsp;Hongbin Dong ,&nbsp;Yingjie Wang ,&nbsp;Tingwei Pan","doi":"10.1016/j.knosys.2023.110330","DOIUrl":null,"url":null,"abstract":"<div><p><span>With the pervasiveness of dynamic task allocation in sharing economy applications, the online bipartite graph<span> matching has attracted people’s increasing attention to its research in recent years. Among its application in sharing economy, the crowdsourcing allocate the tasks to workers dynamically. There are still three main problems that need to be addressed from previous studies. (1) These task allocation algorithms usually ignore the long-term utility on crowdsourcing platforms. (2)The current research works show that it has low allocation numbers. (3) Due to the low number of allocations, it becomes difficult to improve total allocation utilities. In this paper, we considered the long-term utility and drawed an idea of dynamic delay bipartite graph matching(DDBM). We proposed a Policy Gradient Based Discrete Threshold Task Allocation algorithm (DTTA) and a Proximal </span></span>Policy Optimization Based Continuous Threshold Task Allocation algorithm (PPOTA) to solve these problems. The extensive experimental results on two real datasets demonstrate that the proposed algorithms are superior to the existing algorithms in both effectiveness and efficiency.</p></div>","PeriodicalId":49939,"journal":{"name":"Knowledge-Based Systems","volume":"264 ","pages":"Article 110330"},"PeriodicalIF":7.2000,"publicationDate":"2023-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Knowledge-Based Systems","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0950705123000801","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 2

Abstract

With the pervasiveness of dynamic task allocation in sharing economy applications, the online bipartite graph matching has attracted people’s increasing attention to its research in recent years. Among its application in sharing economy, the crowdsourcing allocate the tasks to workers dynamically. There are still three main problems that need to be addressed from previous studies. (1) These task allocation algorithms usually ignore the long-term utility on crowdsourcing platforms. (2)The current research works show that it has low allocation numbers. (3) Due to the low number of allocations, it becomes difficult to improve total allocation utilities. In this paper, we considered the long-term utility and drawed an idea of dynamic delay bipartite graph matching(DDBM). We proposed a Policy Gradient Based Discrete Threshold Task Allocation algorithm (DTTA) and a Proximal Policy Optimization Based Continuous Threshold Task Allocation algorithm (PPOTA) to solve these problems. The extensive experimental results on two real datasets demonstrate that the proposed algorithms are superior to the existing algorithms in both effectiveness and efficiency.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于近端策略优化的时空众包自适应任务分配
随着共享经济应用中动态任务分配的普及,在线二部图匹配近年来越来越受到人们的关注。众包在共享经济中的应用是将任务动态分配给劳动者。从以往的研究中仍有三个主要问题需要解决。(1)这些任务分配算法通常忽略了在众包平台上的长期效用。(2)目前的研究表明,其分配数量较少。(3)由于分配数量少,很难提高总分配效用。本文从长期效用的角度出发,提出了动态延迟二部图匹配的思想。为了解决这些问题,我们提出了一种基于策略梯度的离散阈值任务分配算法(DTTA)和一种基于邻近策略优化的连续阈值任务分配算法(PPOTA)。在两个真实数据集上的大量实验结果表明,本文提出的算法在有效性和效率上都优于现有算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Knowledge-Based Systems
Knowledge-Based Systems 工程技术-计算机:人工智能
CiteScore
14.80
自引率
12.50%
发文量
1245
审稿时长
7.8 months
期刊介绍: Knowledge-Based Systems, an international and interdisciplinary journal in artificial intelligence, publishes original, innovative, and creative research results in the field. It focuses on knowledge-based and other artificial intelligence techniques-based systems. The journal aims to support human prediction and decision-making through data science and computation techniques, provide a balanced coverage of theory and practical study, and encourage the development and implementation of knowledge-based intelligence models, methods, systems, and software tools. Applications in business, government, education, engineering, and healthcare are emphasized.
期刊最新文献
Progressive de-preference task-specific processing for generalizable person re-identification GKA-GPT: Graphical knowledge aggregation for multiturn dialog generation A novel spatio-temporal feature interleaved contrast learning neural network from a robustness perspective PSNet: A non-uniform illumination correction method for underwater images based pseudo-siamese network A novel domain-private-suppress meta-recognition network based universal domain generalization for machinery fault diagnosis
×
引用
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