Please wait a minute...
Front. Inform. Technol. Electron. Eng.  2017, Vol. 18 Issue (1): 107-121    DOI: 10.1631/FITEE.1601860
Research Articles     
Friendship-aware task planning in mobile crowdsourcing
Yuan Liang, Wei-feng Lv, Wen-jun Wu, Ke Xu
State Key Laboratory of Software Development Environment, School of Computer Science, Beihang University, Beijing 100191, China
Download:     PDF (0 KB)     
Export: BibTeX | EndNote (RIS)      

Abstract  Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of location-specific tasks. However, most existing approaches consider the arrangement of a set of tasks for a set of crowd workers, while few consider crowd workers arriving in a dynamic manner. Therefore, how to arrange suitable location-specific tasks to a set of crowd workers such that the crowd workers obtain maximum satisfaction when arriving sequentially represents a challenge. To address the limitation of existing approaches, we first identify a more general and useful model that considers not only the arrangement of a set of tasks to a set of crowd workers, but also all the dynamic arrivals of all crowd workers. Then, we present an effective crowd-task model which is applied to offline and online settings, respectively. To solve the problem in an offline setting, we first observe the characteristics of task planning (CTP) and devise a CTP algorithm to solve the problem. We also propose an effective greedy method and integrated simulated annealing (ISA) techniques to improve the algorithm performance. To solve the problem in an online setting, we develop a greedy algorithm for task planning. Finally, we verify the effectiveness and efficiency of the proposed solutions through extensive experiments using real and synthetic datasets.

Key wordsMobile crowdsourcing      Task planning      Greedy algorithms      Simulated annealing     
Received: 23 December 2016      Published: 20 January 2017
CLC:  TP3  
Cite this article:

Yuan Liang, Wei-feng Lv, Wen-jun Wu, Ke Xu. Friendship-aware task planning in mobile crowdsourcing. Front. Inform. Technol. Electron. Eng., 2017, 18(1): 107-121.

URL:

http://www.zjujournals.com/xueshu/fitee/10.1631/FITEE.1601860     OR     http://www.zjujournals.com/xueshu/fitee/Y2017/V18/I1/107

[1] De-xuan Zou, Gai-ge Wang, Gai Pan, Hong-wei Qi. A modified simulated annealing algorithm and an excessive area model for floorplanning using fixed-outline constraints[J]. Front. Inform. Technol. Electron. Eng., 2016, 17(11): 1228-1244.
[2] Ding-cheng Feng, Feng Chen, Wen-li Xu. Learning robust principal components from L1-norm maximization[J]. Front. Inform. Technol. Electron. Eng., 2012, 13(12): 901-908.
[3] Zheng Zhu, Dong-xiao Li, Ming Zhang. Optimizing inter-view prediction structures for multi-view video coding using simulated annealing[J]. Front. Inform. Technol. Electron. Eng., 2011, 12(2): 155-162.
[4] Peng Chen, Bin-jian Shen, Li-sheng Zhou, Yao-wu Chen. Optimized simulated annealing algorithm for thinning and weighting large planar arrays[J]. Front. Inform. Technol. Electron. Eng., 2010, 11(4): 261-269.