A Server-Assigned Spatial Crowdsourcing Framework

With the popularity of mobile devices, spatial crowdsourcing is rising as a new framework that enables human workers to solve tasks in the physical world. With spatial crowdsourcing, the goal is to crowdsource a set of spatiotemporal tasks (i.e., tasks related to time and location) to a set of workers, which requires the workers to physically travel to those locations in order to perform the tasks. In this article, we focus on one class of spatial crowdsourcing, in which the workers send their locations to the server and thereafter the server assigns to every worker tasks in proximity to the worker’s location with the aim of maximizing the overall number of assigned tasks. We formally define this maximum task assignment (MTA) problem in spatial crowdsourcing, and identify its challenges. We propose alternative solutions to address these challenges by exploiting the spatial properties of the problem space, including the spatial distribution and the travel cost of the workers. MTA is based on the assumptions that all tasks are of the same type and all workers are equally qualified in performing the tasks. Meanwhile, different types of tasks may require workers with various skill sets or expertise. Subsequently, we extend MTA by taking the expertise of the workers into consideration. We refer to this problem as the maximum score assignment (MSA) problem and show its practicality and generality. Extensive experiments with various synthetic and two real-world datasets show the applicability of our proposed framework.

[1]  Kenneth Steiglitz,et al.  Combinatorial Optimization: Algorithms and Complexity , 1981 .

[2]  N. Biggs THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization , 1986 .

[3]  Richard M. Karp,et al.  An optimal algorithm for on-line bipartite matching , 1990, STOC '90.

[4]  Samir Khuller,et al.  On-Line Algorithms for Weighted Bipartite Matching and Stable Marriages , 1991, Theor. Comput. Sci..

[5]  Bala Kalyanasundaram,et al.  Online Weighted Matching , 1993, J. Algorithms.

[6]  Kasturi R. Varadarajan A divide-and-conquer algorithm for min-cost perfect matching in the plane , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[7]  Bala Kalyanasundaram,et al.  An optimal deterministic algorithm for online b-matching , 1996, Theor. Comput. Sci..

[8]  Paolo Toth,et al.  Models, relaxations and exact approaches for the capacitated vehicle routing problem , 2002, Discret. Appl. Math..

[9]  Éva Tardos,et al.  Algorithm design , 2005 .

[10]  양희영 2005 , 2005, Los 25 años de la OMC: Una retrospectiva fotográfica.

[11]  Aranyak Mehta,et al.  AdWords and generalized on-line matching , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

[12]  Michael J. Pazzani,et al.  Mining for proposal reviewers: lessons learned at the national science foundation , 2006, KDD '06.

[13]  Yang Zhang,et al.  CarTel: a distributed mobile sensor computing system , 2006, SenSys '06.

[14]  Jun Wang,et al.  A Hybrid Knowledge and Model Approach for Reviewer Assignment , 2007, 2007 40th Annual Hawaii International Conference on System Sciences (HICSS'07).

[15]  Raymond Chi-Wing Wong,et al.  On Efficient Spatial Matching , 2007, VLDB.

[16]  Andrew McCallum,et al.  Expertise modeling for matching papers with reviewers , 2007, KDD '07.

[17]  Brendan T. O'Connor,et al.  Cheap and Fast – But is it Good? Evaluating Non-Expert Annotations for Natural Language Tasks , 2008, EMNLP.

[18]  Kyriakos Mouratidis,et al.  Capacity constrained assignment in spatial databases , 2008, SIGMOD Conference.

[19]  Laura A. Dabbish,et al.  Designing games with a purpose , 2008, CACM.

[20]  Omar Alonso,et al.  Crowdsourcing for relevance evaluation , 2008, SIGF.

[21]  Ramachandran Ramjee,et al.  Nericell: rich monitoring of road and traffic conditions using mobile smartphones , 2008, SenSys '08.

[22]  David A. Forsyth,et al.  Utility data annotation with Amazon Mechanical Turk , 2008, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops.

[23]  Minho Shin,et al.  Anonysense: privacy-aware people-centric sensing , 2008, MobiSys '08.

[24]  Javier R. Movellan,et al.  Whose Vote Should Count More: Optimal Integration of Labels from Labelers of Unknown Expertise , 2009, NIPS.

[25]  Chin-Laung Lei,et al.  A crowdsourceable QoE evaluation framework for multimedia content , 2009, ACM Multimedia.

[26]  Vikas Kumar,et al.  CrowdSearch: exploiting crowds for accurate real-time image search on mobile phones , 2010, MobiSys '10.

[27]  Alireza Sahami Shirazi,et al.  Location-based crowdsourcing: extending crowdsourcing to the real world , 2010, NordiCHI.

[28]  Aniket Kittur,et al.  Bridging the gap between physical location and online social networks , 2010, UbiComp.

[29]  Cyrus Shahabi,et al.  A privacy-aware framework for participatory sensing , 2011, SKDD.

[30]  Jennifer Widom,et al.  Human-assisted graph search: it's okay to ask questions , 2011, Proc. VLDB Endow..

[31]  Murat Demirbas,et al.  Crowdsourcing location-based queries , 2011, 2011 IEEE International Conference on Pervasive Computing and Communications Workshops (PERCOM Workshops).

[32]  A. James 2010 , 2011, Philo of Alexandria: an Annotated Bibliography 2007-2016.

[33]  Ohad Greenshpan,et al.  Guess who?: enriching the social graph through a crowdsourcing game , 2011, CHI.

[34]  Benjamin B. Bederson,et al.  Human computation: a survey and taxonomy of a growing field , 2011, CHI.

[35]  David R. Karger,et al.  Human-powered Sorts and Joins , 2011, Proc. VLDB Endow..

[36]  Tim Kraska,et al.  CrowdDB: answering queries with crowdsourcing , 2011, SIGMOD '11.

[37]  Alessandro Bozzon,et al.  Answering search queries with CrowdSearcher , 2012, WWW.

[38]  Beng Chin Ooi,et al.  CDAS: A Crowdsourcing Data Analytics System , 2012, Proc. VLDB Endow..

[39]  Jennifer Widom,et al.  CrowdScreen: algorithms for filtering data with humans , 2012, SIGMOD Conference.

[40]  Bo Gao,et al.  On optimization of expertise matching with various constraints , 2012, Neurocomputing.

[41]  Tim Kraska,et al.  CrowdER: Crowdsourcing Entity Resolution , 2012, Proc. VLDB Endow..

[42]  Cyrus Shahabi,et al.  GeoCrowd: enabling query answering with spatial crowdsourcing , 2012, SIGSPATIAL/GIS.

[43]  Wilfred Ng,et al.  CrowdSeed: query processing on microblogs , 2013, EDBT '13.

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

[45]  Xiaolei Ma,et al.  Vehicle Routing Problem , 2013 .

[46]  Ugur Demiryurek,et al.  Maximizing the number of worker's self-selected tasks in spatial crowdsourcing , 2013, SIGSPATIAL/GIS.

[47]  Tim Kraska,et al.  CrowdQ: Crowdsourced Query Understanding , 2013, CIDR.

[48]  Lei Chen,et al.  GeoTruCrowd: trustworthy query answering with spatial crowdsourcing , 2013, SIGSPATIAL/GIS.

[49]  Michael S. Bernstein,et al.  The future of crowd work , 2013, CSCW.

[50]  Deepak Ganesan,et al.  Labor dynamics in a mobile micro-task market , 2013, CHI.

[51]  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.

[52]  Cyrus Shahabi,et al.  A Framework for Protecting Worker Location Privacy in Spatial Crowdsourcing , 2014, Proc. VLDB Endow..

[53]  Vaidy S. Sunderam,et al.  Spatial Task Assignment for Crowd Sensing with Cloaked Locations , 2014, 2014 IEEE 15th International Conference on Mobile Data Management.

[54]  Cyrus Shahabi,et al.  PrivGeoCrowd: A toolbox for studying private spatial Crowdsourcing , 2015, 2015 IEEE 31st International Conference on Data Engineering.