arrow
返回

Trajectory-Aware Task Coalition Assignment in Spatial Crowdsourcing

delete2024-11-01
delete0
PRE
AI
Y
Yuan Xie
F
Fan Wu *
周旭 封面图
周旭 (Xu Zhou)
W
Wensheng Luo
Y
Yifang Yin
R
Roger Zimmermann
李克勤 封面图
李克勤 (Keqin Li)
李肯立 封面图
李肯立 (Kenli Li)
DOI:10.1109/TKDE.2023.3336642delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
With the popularity of GPS-equipped smart devices, spatial crowdsourcing (SC) techniques have attracted growing attention in both academia and industry. A fundamental problem in SC is assigning location-based tasks to workers under spatial-temporal constraints. In many real-life applications, workers choose tasks on the basis of their preferred trajectories. However, by existing trajectory-aware task assignment approaches, tasks assigned to a worker may be far apart from each other, resulting in a higher detour cost as the worker needs to deviate from the original trajectory more often than necessary. Motivated by the above observations, we investigate a trajectory-aware task coalition assignment (TCA) problem and prove it to be NP-hard. The goal is to maximize the number of assigned tasks by assigning task coalitions to workers based on their preferred trajectories. For tackling the TCA problem, we develop a batch-based three-stage framework consisting of task grouping, planning, and assignment. First, we design greedy and spanning grouping approaches to generate task coalitions. Second, to gain candidate task coalitions for each worker efficiently, we design task-based and trajectory-based pruning strategies to reduce the search space. Furthermore, a 2-approximate algorithm, termed MST-Euler, is proposed to obtain a route among each worker and task coalition with a minimal detour cost. Third, the MST-Euler Greedy (MEG) algorithm is presented to compute an assignment that results in the maximal number of tasks assigned and a parallel strategy is introduced to boost its efficiency. Extensive experiments on real and synthetic datasets demonstrate the effectiveness and efficiency of the proposed algorithms.
Keyword:
Task analysis
Trajectory
Costs
Crowdsourcing
Computer science
Planning
Industries
Spatial crowdsourcing
task assignment
task coalition
trajectory

期刊

IEEE Transactions on Knowledge and Data Engineering 封面图
IEEE Transactions on Knowledge and Data Engineering
IF:
10.4
论文数:
6.9K
被引数:
3.2W

机构

T
The Chinese University of Hong Kong, Shenzhen
学者数:
4.3K
论文数: 4.0K
被引数: 7
A
a*star - institute for infocomm research (i2r)
学者数:
869
论文数: 880
被引数: 1
H
hunan university
学者数:
4.5W
论文数: 3.3W
被引数: 70
A
agency for science technology & research (a*star)
学者数:
2.2W
论文数: 1.9W
被引数: 57
N
National University of Singapore
学者数:
7.6W
论文数: 6.5W
被引数: 11.4W
学者 查看更多机构
引用论文

引用论文

Morphology controlled syntheses of Cr doped ZnO single-crystal nanorods for acetone gas sensor
err2016-02-01
err0
PREAI
errG.H. Zhang; X.Y. Deng; P.Y. Wang; X.L. Wang; Y. Chen; H.L. Ma; D.J. Gengzang
err分享
err收藏
Suppressed ovulatory function and oviductal microsurgery in the rabbit
err1981-04-01
err0
errOAAI
errPeter F. McComb; Robert J. Bourdage; Sheridan A. Halbert
err分享
err收藏
err分享
err收藏
PP-036 - The changing role of the embryologist – data management in an electronic age
err2016-05-01
err0
errOAAI
errJeanette Mackenzie; Catarina Moreira; Giles Palmer; Peter Sprober
err分享
err收藏
err分享
err收藏
Task Assignment on Multi-Skill Oriented Spatial Crowdsourcing
err2016-08-01
err157
errOAAI
errCheng, Peng; Lian, Xiang; Chen, Lei; Han, Jinsong; Zhao, Jizhong
err分享
err收藏
Angiogenin is involved in lung adenocarcinoma cell proliferation and angiogenesis
err2009-10-01
err0
PREAI
errYang Yuan; Feng Wang; Xiao-Hong Liu; De-jun Gong; He-zhong Cheng; Sheng-dong Huang
err分享
err收藏
Laparoscopic approach in emergency for the treatment of acute incarcerated groin hernia: a systematic review and meta-analysis
err2022-05-26
err0
PREAI
errA. Sartori; A. Balla; E. Botteri; F. Scolari; M. Podda; P. Lepiane; M. Guerrieri; S. Morales-Conde; A. Szold; M. Ortenzi
err分享
err收藏
学者 查看更多内容