Enhancing User Experience of Task Assignment in Spatial Crowdsourcing: A Self-Adaptive Batching Approach

Faced with the explosive demand of real-world applications, spatial crowdsourcing has attracted much attention, in which task assignment algorithms take the dominant role in the past few years. On the one hand, most recent studies concentrate on maximizing the overall benefits of the platform, ignoring the fact that user experience also plays an essential role in task allocation. On the other hand, they focus on matching, that is, how to assign tasks, rather than batching, that is, when to make assignment. In fact, user experience also depends on batching, but this is largely overlooked by current studies. In this paper, we propose a self-adaptive batching mechanism to enhance user experience in spatial crowdsourcing. With appropriate start-up timestamps, previous matching methods can perform better. Multi-armed bandit algorithm in reinforcement learning is adopted to split the batch dynamically according to historical current states. Extensive experimental results on both real and synthetic datasets demonstrate the effectiveness and efficiency of the proposed approach.

[1]  Edward Curry,et al.  A Multi-armed Bandit Approach to Online Spatial Task Assignment , 2014, 2014 IEEE 11th Intl Conf on Ubiquitous Intelligence and Computing and 2014 IEEE 11th Intl Conf on Autonomic and Trusted Computing and 2014 IEEE 14th Intl Conf on Scalable Computing and Communications and Its Associated Workshops.

[2]  Bowen Du,et al.  Spatial Bottleneck Minimum Task Assignment with Time-Delay , 2019, DASFAA.

[3]  Yuhao Zhang,et al.  How to match when all vertices arrive online , 2018, STOC.

[4]  Daren C. Brabham Crowdsourcing as a Model for Problem Solving , 2008 .

[5]  Mehryar Mohri,et al.  Multi-armed Bandit Algorithms and Empirical Evaluation , 2005, ECML.

[6]  Chris Watkins,et al.  Learning from delayed rewards , 1989 .

[7]  Jieping Ye,et al.  Dynamic Pricing in Spatial Crowdsourcing: A Matching-Based Approach , 2018, SIGMOD Conference.

[8]  Xiang Lian,et al.  Prediction-Based Task Assignment in Spatial Crowdsourcing , 2015, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[9]  Hung Dang,et al.  Maximum Complex Task Assignment: Towards Tasks Correlation in Spatial Crowdsourcing , 2013, IIWAS '13.

[10]  Weifeng Lv,et al.  Adaptive Dynamic Bipartite Graph Matching: A Reinforcement Learning Approach , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[11]  Lei Chen,et al.  Minimizing Maximum Delay of Task Assignment in Spatial Crowdsourcing , 2019, 2019 IEEE 35th International Conference on Data Engineering (ICDE).

[12]  Jie Wu,et al.  Online Task Assignment for Crowdsensing in Predictable Mobile Social Networks , 2017, IEEE Transactions on Mobile Computing.

[13]  Alfred C. Weaver,et al.  CrowdHelp: application for improved emergency response through crowdsourced information , 2013, UbiComp.

[14]  Lei Chen,et al.  Trichromatic Online Matching in Real-Time Spatial Crowdsourcing , 2017, 2017 IEEE 33rd International Conference on Data Engineering (ICDE).

[15]  Torben Bach Pedersen,et al.  A Survey of Spatial Crowdsourcing , 2019, ACM Trans. Database Syst..

[16]  Xi Chen,et al.  Privacy-Aware High-Quality Map Generation with Participatory Sensing , 2016, IEEE Transactions on Mobile Computing.

[17]  Hojung Cha,et al.  Understanding the coverage and scalability of place-centric crowdsensing , 2013, UbiComp.

[18]  Lei Chen,et al.  Online mobile Micro-Task Allocation in spatial crowdsourcing , 2016, 2016 IEEE 32nd International Conference on Data Engineering (ICDE).

[19]  H. Robbins Some aspects of the sequential design of experiments , 1952 .

[20]  Cyrus Shahabi,et al.  A Server-Assigned Spatial Crowdsourcing Framework , 2015, ACM Trans. Spatial Algorithms Syst..