Affinitive Diversity-Aware Task Allocation in Spatial Crowdsourcing

被引:2
作者
Bhatti, Shahzad Sarwar [1 ]
Chang, Yiding [1 ]
Gao, Xiaofeng [1 ]
Chen, Guihai [1 ]
机构
[1] Shanghai Jiao Tong Univ, Shanghai Key Lab Data Sci, Dept Comp Sci & Engn, Shanghai, Peoples R China
来源
2020 IEEE 13TH INTERNATIONAL CONFERENCE ON WEB SERVICES (ICWS 2020) | 2020年
基金
国家重点研发计划; 中国国家自然科学基金;
关键词
crowdsourcing; social network; approximation algorithm; quality of service; combinatorial optimization;
D O I
10.1109/ICWS49710.2020.00011
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of mobile network and devices, spatial crowdsourcing (SC) has recently attracted much attention. For the improvement of quality of service (QoS) in spatial crowdsourcing platforms, existing works usually adopt the many-to-one strategy - assigning multiple workers as a team for each published task. However, such an allocation scheme fails to consider team characteristics which can strongly affect the QoS for some experience-sensitive collaborative tasks. In this paper, we jointly consider two team characteristics to further improve the QoS: Diversity, which is the union of experiences within a team and Affinity, which is how efficiently team members collaborate. Inspired by these two characteristics, we study an important problem, namely, Affinitive Diversity-Aware Spatial Crowdsourcing (ADA-SC), which aims to find an allocation scheme, such that each team satisfies the affinity requirement of the corresponding task and maximizes the team diversity under budget and spatial constraints. Since ADA-SC is proven to be NP-hard by reduction from the set cover problem with non-linear constraints, we propose two submodular approximation algorithms with pruning strategies for two single-task scenarios. Then a greedy-based algorithm is designed for the multi-task scenario. Extensive experiments on real and synthetic data verify the effectiveness of our proposed methods.
引用
收藏
页码:27 / 36
页数:10
相关论文
共 29 条
  • [1] [Anonymous], 2017, GIGWALK WORLDS LARGE
  • [2] Chekuri C, 2004, LECT NOTES COMPUT SC, V3122, P72
  • [3] Reliable Diversity-Based Spatial Crowdsourcing by Moving Workers
    Cheng, Peng
    Lian, Xiang
    Chen, Zhao
    Fu, Rui
    Chen, Lei
    Han, Jinsong
    Zhao, Jizhong
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2015, 8 (10): : 1022 - 1033
  • [4] BikeNow: A Pervasive Application for Crowdsourcing Bicycle Traffic Data
    Froehlich, Sven
    Springer, Thomas
    Dinter, Stephan
    Pape, Sebastian
    Schill, Alexander
    Krimmling, Juergen
    [J]. UBICOMP'16 ADJUNCT: PROCEEDINGS OF THE 2016 ACM INTERNATIONAL JOINT CONFERENCE ON PERVASIVE AND UBIQUITOUS COMPUTING, 2016, : 1408 - 1417
  • [5] Mobile Crowdsensing: Current State and Future Challenges
    Ganti, Raghu K.
    Ye, Fan
    Lei, Hui
    [J]. IEEE COMMUNICATIONS MAGAZINE, 2011, 49 (11) : 32 - 39
  • [6] He SB, 2014, IEEE INFOCOM SER, P745, DOI 10.1109/INFOCOM.2014.6848001
  • [7] Hochba D. S., 1997, SIGACT NEWS, V28, P40, DOI [DOI 10.1145/261342.571216, 10.1145/261342.571216]
  • [8] Kargar M., 2011, P 20 ACM INT C INF K, P985, DOI DOI 10.1145/2063576.2063718
  • [9] Kazemi L., 2012, P SIGSPATIAL 2012 IN, P189
  • [10] The budgeted maximum coverage problem
    Khuller, S
    Moss, A
    Naor, JS
    [J]. INFORMATION PROCESSING LETTERS, 1999, 70 (01) : 39 - 45