scholarly journals Preference-Aware Task Assignment in Spatial Crowdsourcing

Author(s):  
Yan Zhao ◽  
Jinfu Xia ◽  
Guanfeng Liu ◽  
Han Su ◽  
Defu Lian ◽  
...  

With the ubiquity of smart devices, Spatial Crowdsourcing (SC) has emerged as a new transformative platform that engages mobile users to perform spatio-temporal tasks by physically traveling to specified locations. Thus, various SC techniques have been studied for performance optimization, among which one of the major challenges is how to assign workers the tasks that they are really interested in and willing to perform. In this paper, we propose a novel preference-aware spatial task assignment system based on workers’ temporal preferences, which consists of two components: History-based Context-aware Tensor Decomposition (HCTD) for workers’ temporal preferences modeling and preference-aware task assignment. We model worker preferences with a three-dimension tensor (worker-task-time). Supplementing the missing entries of the tensor through HCTD with the assistant of historical data and other two context matrices, we recover worker preferences for different categories of tasks in different time slots. Several preference-aware task assignment algorithms are then devised, aiming to maximize the total number of task assignments at every time instance, in which we give higher priorities to the workers who are more interested in the tasks. We conduct extensive experiments using a real dataset, verifying the practicability of our proposed methods.

2020 ◽  
Vol 5 (4) ◽  
pp. 375-390
Author(s):  
Xiang Li ◽  
Yan Zhao ◽  
Xiaofang Zhou ◽  
Kai Zheng

Abstract With the pervasiveness of GPS-enabled smart devices and increased wireless communication technologies, spatial crowdsourcing (SC) has drawn increasing attention in assigning location-sensitive tasks to moving workers. In real-world scenarios, for the complex tasks, SC is more likely to assign each task to more than one worker, called group task assignment (GTA), for the reason that an individual worker cannot complete the task well by herself. It is a challenging issue to assign worker groups the tasks that they are interested in and willing to perform. In this paper, we propose a novel framework for group task assignment based on worker groups’ preferences, which includes two components: social impact-based preference modeling (SIPM) and preference-aware group task assignment (PGTA). SIPM employs a bipartite graph embedding model and the attention mechanism to learn the social impact-based preferences of different worker groups on different task categories. PGTA utilizes an optimal task assignment algorithm based on the tree decomposition technique to maximize the overall task assignments, in which we give higher priorities to the worker groups showing more interests in the tasks. We further optimize the original framework by proposing strategies to improve the effectiveness of group task assignment, wherein a deep learning method and the group consensus are taken into consideration. Extensive empirical studies verify that the proposed techniques and optimization strategies can settle the problem nicely.


Author(s):  
Jinfu Xia ◽  
Yan Zhao ◽  
Guanfeng Liu ◽  
Jiajie Xu ◽  
Min Zhang ◽  
...  

In Spatial Crowdsourcing (SC) systems, mobile users are enabled to perform spatio-temporal tasks by physically traveling to specified locations with the SC platforms. SC platforms manage the systems and recruit mobile users to contribute to the SC systems, whose commercial success depends on the profit attained from the task requesters. In order to maximize its profit, an SC platform needs an online management mechanism to assign the tasks to suitable workers. How to assign the tasks to workers more cost-effectively with the spatio-temporal constraints is one of the most difficult problems in SC. To deal with this challenge, we propose a novel Profit-driven Task Assignment (PTA) problem, which aims to maximize the profit of the platform. Specifically, we first establish a task reward pricing model with tasks' temporal constraints (i.e., expected completion time and deadline). Then we adopt an optimal algorithm based on tree decomposition to achieve the optimal task assignment and propose greedy algorithms to improve the computational efficiency. Finally, we conduct extensive experiments using real and synthetic datasets, verifying the practicability of our proposed methods.


2018 ◽  
Vol 10 (2) ◽  
pp. 18-25 ◽  
Author(s):  
Yongxin Tong ◽  
Zimu Zhou

2018 ◽  
Vol 9 (3) ◽  
pp. 1-26 ◽  
Author(s):  
Luan Tran ◽  
Hien To ◽  
Liyue Fan ◽  
Cyrus Shahabi

Author(s):  
Zhao Liu ◽  
Kenli Li ◽  
Xu Zhou ◽  
Ningbo Zhu ◽  
Yunjun Gao ◽  
...  

2021 ◽  
Author(s):  
Ziwei Wang ◽  
Yan Zhao ◽  
Xuanhao Chen ◽  
Kai Zheng

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.


2019 ◽  
Vol 15 (3) ◽  
pp. 155014771983056 ◽  
Author(s):  
Hang Ye ◽  
Kai Han ◽  
Chaoting Xu ◽  
Jingxin Xu ◽  
Fei Gui

Spatial crowdsourcing is an emerging outsourcing platform that allocates spatio-temporal tasks to a set of workers. Then, the worker moves to the specified locations to perform the tasks. However, it usually demands workers to upload their location information to the spatial crowdsourcing server, which unavoidably attracts attention to the privacy-preserving of the workers’ locations. In this article, we propose a novel framework that can protect the location privacy of the workers and the requesters when assigning tasks to workers. Our scheme is based on mathematical transformation to the location while providing privacy protection to workers and requesters. Moreover, to further preserve the relative location between workers, we generate a certain amount of noise to interfere the spatial crowdsourcing server. Experimental results on real-world data sets show the effectiveness and efficiency of our proposed framework.


Sign in / Sign up

Export Citation Format

Share Document