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 , Hongbin Dong , Yingjie Wang , 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.
期刊介绍:
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.