Multi-Objective Online Task Allocation in Spatial Crowdsourcing Systems

Author(s):  
Ellen Mitsopoulou ◽  
Iouliana Litou ◽  
Vana Kalogeraki
2020 ◽  
Vol 2020 ◽  
pp. 1-6
Author(s):  
Shengxiang Wang ◽  
Xiaofan Jia ◽  
Qianqian Sang

Spatial crowdsourcing assigns location-related tasks to a group of workers (people equipped with smart devices and willing to complete the tasks), who complete the tasks according to their scope of work. Since space crowdsourcing usually requires workers’ location information to be uploaded to the crowdsourcing server, it inevitably causes the privacy disclosure of workers. At the same time, it is difficult to allocate tasks effectively in space crowdsourcing. Therefore, in order to improve the task allocation efficiency of spatial crowdsourcing in the case of large task quantity and improve the degree of privacy protection for workers, a new algorithm is proposed in this paper, which can improve the efficiency of task allocation by disturbing the location of workers and task requesters through k-anonymity. Experiments show that the algorithm can improve the efficiency of task allocation effectively, reduce the task waiting time, improve the privacy of workers and task location, and improve the efficiency of space crowdsourcing service when facing a large quantity of tasks.


2020 ◽  
Vol 29 (03) ◽  
pp. 2050003
Author(s):  
Liping Gao ◽  
Kun Dai ◽  
Chao Lu

Task allocation of spatial crowdsourcing tasks is an important branch of crowdsourcing. Spatial crowdsourcing tasks not only require workers to complete a specific task at a specified time, but also require users to go to the designated location to complete the corresponding tasks. In this paper, Scope spatial crowdsourcing task whose work position is a region rather than a location is a kind of spatial crowdsourcing task. Mobile crowdsourced sensing (MCS) is one of the most important platforms to publish spatial crowdsourcing tasks, based on which MCS workers can use smartphones to complete the collections of related sensing data. When assigning tasks for scoped crowdsourcing tasks, there is a scope overlap between tasks and one or more tasks due to the association of task scope between tasks, which causes a waste of manpower. The focus of this paper is to study the redundancy of the task scope that occurs when using MCS to collect scoping data in the case of fewer workers and more tasks. Optimizing scope spatial crowdsourcing tasks allocation algorithm (OSSA) can eliminate the redundancy of the task area by integrating and decomposing tasks and achieve the improvement of the assignable number of tasks. In the Windows platform, experiments are made to compare the efficiency of the OSSA algorithm with the greedy algorithm and the two-phase-based global online allocation (TGOA) algorithm to further prove the correctness and feasibility of the algorithm for task scope optimization.


2018 ◽  
Vol 5 (3) ◽  
pp. 1749-1764 ◽  
Author(s):  
Bin Guo ◽  
Yan Liu ◽  
Leye Wang ◽  
Victor O. K. Li ◽  
Jacqueline C. K. Lam ◽  
...  

2019 ◽  
Vol 155 ◽  
pp. 360-368 ◽  
Author(s):  
Mingchu Li ◽  
Yuan Gao ◽  
Mingliang Wang ◽  
Cheng Guo ◽  
Xing Tan

Sign in / Sign up

Export Citation Format

Share Document