Friendship-aware task planning in mobile crowdsourcing  

作　　者：Yuan LIANG Wei-feng LV Wen-jun WU Ke XU 

机构地区：[1]State Key Laboratory of Software Development Environment,School of Computer Science,Beihang University,Beijing 100191,China

出　　处：《Frontiers of Information Technology & Electronic Engineering》2017年第1期107-121,共15页信息与电子工程前沿（英文版）

基　　金：supported by the National High-Tech R&D Program(863) of China(No.2014AA015203)

摘　　要：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 offiine and online settings, respectively. To solve the problem in an offiine 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.Recently, crowdsourcing platforms have attracted a number of citizens to perform a variety of locationspecific 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.

关 键 词：Mobile crowdsourcing Task planning Greedy algorithms Simulated annealing 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]