Journal Article10.1109/TMC.2020.2984380
An Approximation Algorithm for Bounded Task Assignment Problem in Spatial Crowdsourcing
21
TL;DR: This paper proposes a constant-ratio approximation algorithm based on partition and shifting method to achieve the assignment solution for the important problem, namely, Bounded and Heterogeneous Task Assignment (BHTA), and proves that the BHTA problem is NP-hard.
read more
Abstract: Spatial crowdsourcing, a human-centric compelling paradigm in performing spatial tasks, has drawn rising attention. Task assignment is of paramount importance in spatial crowdsourcing. Existing studies often use heuristics of various kinds to solve task assignment problems. These schemes usually only apply some specific cases, once the environment changes, the efficiency of the algorithms is significantly reduced. In this paper, we first introduce a taxonomy of task assignment in spatial crowdsourcing. Next, we design an approximation algorithm and get an efficient solution for the important problem, namely, Bounded and Heterogeneous Task Assignment (BHTA), such that the sum of the rewards of workers is maximized subject to multiple constraints. We prove that the BHTA problem is NP-hard. Subsequently, we propose a constant-ratio approximation algorithm based on partition and shifting method to achieve the assignment solution. To meet with the workers’ dynamism, we further devise a greedy algorithm and provide theoretical guarantee. Experiments on synthetic and real datasets demonstrate the efficiency of our strategy over previous methods. So far as we know, this paper is the first attempt to give a constant-ratio approximation for such task assignment problems in spatial crowdsourcing.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Multiple Cooperative Task Allocation in Group-Oriented Social Mobile Crowdsensing
TL;DR: This paper proposes a novel three-phase approach named Group-oriented Cooperative Crowdsensing (GoCC) to tackle the MCTA problem in social mobile crowdsensing, which improves the task coverage via group-oriented cooperation while achieving good task cooperation quality.
53
POTA: Privacy-Preserving Online Multi-Task Assignment with Path Planning
Chuan Zhang,Xingqi Luo,Jinwen Liang,Ximeng Liu,Liehuang Zhu,Song Guo +5 more
TL;DR: Experimental evaluations on real-world datasets demonstrate the feasibility of POTA in terms of running time and its ability to achieve minimized total moving distances and security analysis proves that POTA guarantees the confidentiality of sensitive data.
25
Cooperative multi-task traversing with complex marine environment for multiple unmanned surface vehicles inspired by membrane computing
TL;DR: In this article , a cooperative multi-task traversing scheme for multiple unmanned surface vehicles (USVs) under complex marine environments is proposed, where a membrane reward-mechanism genetic-optimization (M-RM-GO) algorithm is proposed to solve the task assignment problem.
13
Multiple Cooperative Task Allocation in Group-Oriented Social Mobile Crowdsensing
TL;DR: Wang et al. as discussed by the authors proposed a novel three-phase approach named Group-oriented Cooperative Crowdsensing (GoCC), which exploits real-life relationships in the social network to form compatible groups, which improves the task coverage via grouporiented cooperation while achieving good task cooperation quality.
12
An Online Fairness-Aware Task Planning Approach for Spatial Crowdsourcing
TL;DR: In this paper , the authors proposed a utility-fairness index to evaluate the performance of the crowdsourcing platform and introduced the Fairness-Aware Task Planning problem that maximizes the utility while well-maintaining fairness during task assignment.
7
References
GeoCrowd: enabling query answering with spatial crowdsourcing
Leyla Kazemi,Cyrus Shahabi +1 more
- 06 Nov 2012
TL;DR: This paper introduces a taxonomy for spatial crowdsourcing, and focuses on one class of this taxonomy, in which workers send their locations to a centralized server and thereafter the server assigns to every worker his nearby tasks with the objective of maximizing the overall number of assigned tasks.
ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems
TL;DR: ActiveCrowd is proposed, a worker selection framework for multitask MCS environments that selects workers whose route is predicted to pass by the task venues and the goal is to minimize the total number of workers.
248
Online minimum matching in real-time spatial data: experiments and analysis
Yongxin Tong,Jieying She,Bolin Ding,Lei Chen,Tianyu Wo,Ke Xu +5 more
- 01 Aug 2016
TL;DR: A comprehensive experimental comparison of the representative algorithms of the OMBM problem and observes a surprising result that the simple and efficient greedy algorithm, which has been considered as the worst due to its exponential worst-case competitive ratio, is significantly more effective than other algorithms.
Reliable diversity-based spatial crowdsourcing by moving workers
Peng Cheng,Xiang Lian,Zhao Chen,Rui Fu,Lei Chen,Jinsong Han,Jizhong Zhao +6 more
- 01 Jun 2015
TL;DR: Wang et al. as discussed by the authors proposed a reliable diversity-based spatial crowdsourcing (RDB-SC) problem to assign workers to spatial tasks such that the completion reliability and the spatial/temporal diversities of spatial tasks are maximized.
Distributed Time-Sensitive Task Selection in Mobile Crowdsensing
Man Hon Cheung,Richard Southwell,Fen Hou,Jianwei Huang +3 more
- 22 Jun 2015
TL;DR: Zhang et al. as mentioned in this paper proposed an asynchronous and distributed task selection (ADTS) algorithm for heterogeneous users with different initial locations, movement costs, movement speeds, and reputation levels.
163