TY - GEN
T1 - Team-oriented task planning in spatial crowdsourcing
AU - Gao, Dawei
AU - Tong, Yongxin
AU - Ji, Yudian
AU - Xu, Ke
N1 - Publisher Copyright:
© Springer International Publishing AG 2017.
PY - 2017
Y1 - 2017
N2 - The rapid development of mobile devices has stimulated the popularity of spatial crowdsourcing. Various spatial crowdsourcing platforms, such as Uber, gMission and Gigwalk, are becoming increasingly important in our daily life. A core functionality of spatial crowdsourcing platforms is to allocate tasks or make plans for workers to efficiently finish the published tasks. However, existing studies usually ignore the fact that tasks may impose different skill requirements on workers, which may lead to decreased numbers of accomplished tasks in real-world applications. In this work, we propose a practical problem called TOTP, Team-Oriented Task Planning, which not only makes feasible plans for workers but also satisfies the skill requirements of different tasks on workers. We prove the NP-hardness of TOTP, and propose two greedy-based heuristic algorithms to solve the TOTP problem. Evaluations on both synthetic and real-world datasets verify the effectiveness and the efficiency of the proposed algorithms.
AB - The rapid development of mobile devices has stimulated the popularity of spatial crowdsourcing. Various spatial crowdsourcing platforms, such as Uber, gMission and Gigwalk, are becoming increasingly important in our daily life. A core functionality of spatial crowdsourcing platforms is to allocate tasks or make plans for workers to efficiently finish the published tasks. However, existing studies usually ignore the fact that tasks may impose different skill requirements on workers, which may lead to decreased numbers of accomplished tasks in real-world applications. In this work, we propose a practical problem called TOTP, Team-Oriented Task Planning, which not only makes feasible plans for workers but also satisfies the skill requirements of different tasks on workers. We prove the NP-hardness of TOTP, and propose two greedy-based heuristic algorithms to solve the TOTP problem. Evaluations on both synthetic and real-world datasets verify the effectiveness and the efficiency of the proposed algorithms.
KW - Spatial crowdsourcing
KW - Task plan
KW - Team formation
UR - https://www.scopus.com/pages/publications/85028468684
U2 - 10.1007/978-3-319-63579-8_4
DO - 10.1007/978-3-319-63579-8_4
M3 - 会议稿件
AN - SCOPUS:85028468684
SN - 9783319635781
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 41
EP - 56
BT - Web and Big Data - 1st International Joint Conference, APWeb-WAIM 2017, Proceedings
A2 - Shahabi, Cyrus
A2 - Lian, Xiang
A2 - Jensen, Christian S.
A2 - Yang, Xiaochun
A2 - Chen, Lei
PB - Springer Verlag
T2 - 1st Asia-Pacific Web and Web-Age Information Management Joint Conference on Web and Big Data, APWeb-WAIM 2017
Y2 - 7 July 2017 through 9 July 2017
ER -