Real-Time Task Assignment in Hyperlocal Spatial Crowdsourcing under Budget Constraints

被引:0
作者
To, Hien [1 ]
Fan, Liyue [1 ]
Tran, Luan [1 ]
Shahabi, Cyrus [1 ]
机构
[1] Univ Southern Calif, Los Angeles, CA 90089 USA
来源
2016 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM) | 2016年
关键词
Crowdsourcing; Spatial Crowdsourcing; Mobile Crowdsensing; Online Task Assignment; Budget Constraints;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Spatial Crowdsourcing (SC) is a novel platform that engages individuals in the act of collecting various types of spatial data. This method of data collection can significantly reduce cost and turnover time, and is particularly useful in environmental sensing, where traditional means fail to provide tine-grained field data. In this study, we introduce hyperlocal spatial crowdsourcing, where all workers who are located within the spatiotemporal vicinity of a task are eligible to perform the task, e.g., reporting the precipitation level at their area and time. In this setting, there is often a budget constraint, either for every time period or for the entire campaign, on the number of workers to activate to perform tasks. The challenge is thus to maximize the number of assigned tasks under the budget constraint, despite the dynamic arrivals of workers and tasks as well as their co location relationship. We study two problem variants in this paper: budget is constrained for every timestamp, i.e. fixed, and budget is constrained for the entire campaign, i.e. dynamic. For each variant, we study the complexity of its online version and then propose several heuristics for the online version which exploit the spatial and temporal knowledge acquired over time. Extensive experiments with real-world and synthetic datasets show the effectiveness and efficiency of our proposed solutions.
引用
收藏
页数:8
相关论文
共 21 条
[1]  
Alfarrarjeh A., 2015, MOB DAT MAN MDM 2015, V1, P134
[2]  
[Anonymous], P VLDB ENDOWMENT
[3]  
Chekuri C, 2004, LECT NOTES COMPUT SC, V3122, P72
[4]  
Cheng P., 2014, ARXIV14120223
[5]  
Cranshaw J., 2010, P 12 ACM INT C UB CO
[6]  
Deng D., 2013, 21 ACM SIGSPATIAL GI, P314
[7]  
Dorminey Bruce, 2014, CROWDSOURCING WEATHE
[8]   A threshold of in n for approximating set cover [J].
Feige, U .
JOURNAL OF THE ACM, 1998, 45 (04) :634-652
[9]  
He SB, 2014, IEEE INFOCOM SER, P745, DOI 10.1109/INFOCOM.2014.6848001
[10]  
Hochbaum Dorit S, 1996, Approximation algorithms for NP-hard problems