Transit-based Task Assignment in Spatial Crowdsourcing

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

38 Downloads (Pure)

Abstract

Worker movement information can help the spatial crowdsourcing platform to identify the right time to assign a task to a worker for successful completion of the task. However, the majority of the current assignment strategies do not consider worker movement information. This paper aims to utilize the worker movement information via transits in an online task assignment setting. The idea is to harness the waiting periods at different transit stops in a worker transit route (WTR) for performing the tasks. Given the limited availability of workers’ waiting periods at transit stops, task deadlines and workers’ preference of performing tasks with higher rewards, we define the Transit-based Task Assignment (TTA) problem. The objective of the TTA problem is to maximize the average worker rewards for motivating workers, considering the fixed worker transit models. We solve the TTA problem by considering three variants, step-by-step, from offline to batch-based online versions. The first variant is the offline version of the TTA, which can be reduced to a maximum bipartite matching problem, and be leveraged for the second variant. The second variant is the batch-based online version of the TTA, for which, we propose dividing each batch into an offline version of the TTA problem, along with additional credibility constraints to ensure a certain level of worker response quality. The third variant is the extension of the batch-based online version of the TTA (Flexible-TTA) that relaxes the strict nature of the WTR model and assumes that a task with higher reward than a worker-defined threshold value will convince the worker to stay longer at the transit stop. Through our extensive evaluation, we observe that the algorithm solving the Flexible-TTA problem outperforms the algorithms proposed to solve other variants of the TTA problems, by 55% in terms of the number of assigned tasks, and by at least 35% in terms of average reward for the worker. With respect to the baseline (online task assignment) algorithm, the algorithm solving the Flexible-TTA problem results in three times higher reward and at least three times faster runtime.
Original languageEnglish
Title of host publicationSSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management
EditorsElaheh Pourabbas, Dimitris Sacharidis, Kurt Stockinger, Thanasis Vergoulis
Number of pages12
PublisherAssociation for Computing Machinery
Publication date7 Jul 2020
Pages1-12
Article number13
ISBN (Electronic)9781450388146
DOIs
Publication statusPublished - 7 Jul 2020
EventSSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management - Vienna, Austria
Duration: 7 Jul 20209 Jul 2020
http://ssdbm.org/2020/

Conference

ConferenceSSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management
CountryAustria
CityVienna
Period07/07/202009/07/2020
Internet address

Keywords

  • Spatial Crowdsourcing
  • Task Assignment
  • Transit

Fingerprint Dive into the research topics of 'Transit-based Task Assignment in Spatial Crowdsourcing'. Together they form a unique fingerprint.

  • Cite this

    Gummidi, B., Pedersen, T. B., & Xie, X. (2020). Transit-based Task Assignment in Spatial Crowdsourcing. In E. Pourabbas, D. Sacharidis, K. Stockinger, & T. Vergoulis (Eds.), SSDBM 2020: 32nd International Conference on Scientific and Statistical Database Management (pp. 1-12). [13] Association for Computing Machinery. https://doi.org/10.1145/3400903.3400929