S. Lou, Gang Liu, Zhiyu Chen, Jianwei Guo, Peng Liu
{"title":"Mobile Crowdsensing Task Allocation Model Based on Discrete Particle Swarm Optimization","authors":"S. Lou, Gang Liu, Zhiyu Chen, Jianwei Guo, Peng Liu","doi":"10.1109/cvidliccea56201.2022.9824089","DOIUrl":null,"url":null,"abstract":"Mobile crowdsensing (MCS) is a new crowdsourcing model. With the continuous development of MCS, more and more task requesters and workers participate in the MCS, and how to design a reasonable task allocation scheme hasbecome a hot topic of research. In this paper, we investigate the spatiotemporal task allocation problem considering task time constraints and workers’ execution capabilities, and proposean efficient task allocation algorithm based on the discrete particle swarm optimization to maximise social welfare. In order to further optimise the task allocation scheme, a greedy algorithm is introduced to reduce the distance workers have to travel to perform the task and hence the cost of performing the task. Simulation results show that the algorithm is effective in improving social welfare.","PeriodicalId":23649,"journal":{"name":"Vision","volume":"10 1","pages":"1-7"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/cvidliccea56201.2022.9824089","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Mobile crowdsensing (MCS) is a new crowdsourcing model. With the continuous development of MCS, more and more task requesters and workers participate in the MCS, and how to design a reasonable task allocation scheme hasbecome a hot topic of research. In this paper, we investigate the spatiotemporal task allocation problem considering task time constraints and workers’ execution capabilities, and proposean efficient task allocation algorithm based on the discrete particle swarm optimization to maximise social welfare. In order to further optimise the task allocation scheme, a greedy algorithm is introduced to reduce the distance workers have to travel to perform the task and hence the cost of performing the task. Simulation results show that the algorithm is effective in improving social welfare.