{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,22]],"date-time":"2026-01-22T12:33:41Z","timestamp":1769085221557,"version":"3.49.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,1,30]],"date-time":"2020-01-30T00:00:00Z","timestamp":1580342400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["IIS-1618669 (III) and ACI-1642133 (CICI)"],"award-info":[{"award-number":["IIS-1618669 (III) and ACI-1642133 (CICI)"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Spatial Algorithms Syst."],"published-print":{"date-parts":[[2020,3,31]]},"abstract":"<jats:p>In mobile crowdsourcing, workers are financially motivated to perform as many self-selected tasks as possible to maximize their revenue. Unfortunately, the existing task scheduling approaches in mobile crowdsourcing fail to consider task execution duration and do not scale for massive tasks and large geographic areas. In this article, we propose a novel framework, Turbo-GTS, in support of large-scale geo-task scheduling, with the objective of identifying an optimal task assignment for each worker to maximize the total number of tasks that can be completed for an entire worker group, given the geographic locations of each task and each worker. Since the exact solution to the geo-task scheduling problem is computationally intractable, we first propose two sub-optimal approaches (least cost neighbor with particle filtering and non-urgency degree particle filtering with iterative clustering) based on particle filtering and DBSCAN for the single-worker geo-task scheduling problem. We then extend our work to solve the multi-worker geo-task scheduling problem by proposing two space partitioning-based methods (QT-NNH and QT-NUD), which leverage point-region quadtree to ensure workload balancing. The effectiveness and efficiency of the four proposed approximate solutions are verified by our extensive experiments using both real and synthetic data. Compared to state-of-the-art approaches, our proposed solutions are able to return a higher number of completed tasks for the worker group while reducing the computation cost by up to three orders of magnitude when coping with massive tasks distributed in large geographic areas.<\/jats:p>","DOI":"10.1145\/3363450","type":"journal-article","created":{"date-parts":[[2020,4,3]],"date-time":"2020-04-03T22:42:55Z","timestamp":1585953775000},"page":"1-29","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Turbo-GTS"],"prefix":"10.1145","volume":"6","author":[{"given":"Wei","family":"Li","sequence":"first","affiliation":[{"name":"Auburn University, Auburn, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haiquan","family":"Chen","sequence":"additional","affiliation":[{"name":"California State University, Sacramento, CA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wei-Shinn","family":"Ku","sequence":"additional","affiliation":[{"name":"Auburn University, Auburn, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiao","family":"Qin","sequence":"additional","affiliation":[{"name":"Auburn University, Auburn, AL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2020,1,30]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5465\/amr.2010.0146"},{"key":"e_1_2_1_3_1","volume-title":"Retrieved","author":"Baig Edward","year":"2012","unstructured":"Edward Baig . 2012 . Quri App Lets You Make Money While You Shop . Retrieved November 16, 2019 from http:\/\/content.usatoday.com\/communities\/technologylive\/post\/2012\/05\/quri-easyshift-shopper-app\/1#.Vd6ybPnT4ds. Edward Baig. 2012. Quri App Lets You Make Money While You Shop. Retrieved November 16, 2019 from http:\/\/content.usatoday.com\/communities\/technologylive\/post\/2012\/05\/quri-easyshift-shopper-app\/1#.Vd6ybPnT4ds."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1177\/1354856507084420"},{"key":"e_1_2_1_5_1","volume-title":"Retrieved","author":"Carter Nicole","year":"2012","unstructured":"Nicole Carter . 2012 . TaskRabbit: From Start-Up to Global Web Market for Odd Jobs . Retrieved November 16, 2019 from http:\/\/www.inc.com\/nicole-carter-and-tim-rice\/task-rabbit-leah-busque-start-up-to-global-web-marketplace-jobs.html. Nicole Carter. 2012. TaskRabbit: From Start-Up to Global Web Market for Odd Jobs. Retrieved November 16, 2019 from http:\/\/www.inc.com\/nicole-carter-and-tim-rice\/task-rabbit-leah-busque-start-up-to-global-web-marketplace-jobs.html."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAIS.2013.6720583"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10458-011-9168-3"},{"key":"e_1_2_1_8_1","first-page":"555","article-title":"Non-linear filtering: Interacting particle resolution","volume":"2","author":"Moral Pierre Del","year":"1996","unstructured":"Pierre Del Moral . 1996 . Non-linear filtering: Interacting particle resolution . Markov Processes and Related Fields 2 , 4 (1996), 555 -- 581 . Pierre Del Moral. 1996. Non-linear filtering: Interacting particle resolution. Markov Processes and Related Fields 2, 4 (1996), 555--581.","journal-title":"Markov Processes and Related Fields"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0103798"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10707-016-0251-4"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2820783.2820831"},{"key":"e_1_2_1_12_1","volume-title":"Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996)","author":"Ester Martin","year":"1996","unstructured":"Martin Ester , Hans-Peter Kriegel , J\u00f6rg Sander , and Xiaowei Xu . 1996 . A density-based algorithm for discovering clusters in large spatial databases with noise . In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996) . 226--231. Martin Ester, Hans-Peter Kriegel, J\u00f6rg Sander, and Xiaowei Xu. 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD\u201996). 226--231."},{"key":"e_1_2_1_13_1","volume-title":"Retrieved","author":"Fried Ina","year":"2011","unstructured":"Ina Fried . 2011 . Gigwalk Allows iPhone Owners to Stumble into Part-Time Work . Retrieved November 16, 2019 from http:\/\/allthingsd.com\/20110504\/gigwalk-allows-iphone-owners-to-stumble-into-part-time-work\/. Ina Fried. 2011. Gigwalk Allows iPhone Owners to Stumble into Part-Time Work. Retrieved November 16, 2019 from http:\/\/allthingsd.com\/20110504\/gigwalk-allows-iphone-owners-to-stumble-into-part-time-work\/."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2011.52"},{"key":"e_1_2_1_15_1","volume-title":"Retrieved","author":"Good Leisa","year":"2014","unstructured":"Leisa Good . 2014 . GigWalk Pays You for Doing Short Tasks with Your Phone . Retrieved November 16, 2019 from http:\/\/extracashandrewards.com\/gigwalk-pays-for-phone-short-tasks\/. Leisa Good. 2014. GigWalk Pays You for Doing Short Tasks with Your Phone. Retrieved November 16, 2019 from http:\/\/extracashandrewards.com\/gigwalk-pays-for-phone-short-tasks\/."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/17538941003759255"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1049\/ip-f-2.1993.0015"},{"key":"e_1_2_1_18_1","first-page":"2011","volume-title":"Retrieved","author":"Hamburger Ellis","year":"2011","unstructured":"Ellis Hamburger . 2011 . How to Make Some Extra Cash Just by Taking Photos Around Town with Your iPhone . Retrieved November 16, 2019 from http:\/\/www.businessinsider.com\/gigwalk-iphone-app- 2011 - 2015 Ellis Hamburger. 2011. How to Make Some Extra Cash Just by Taking Photos Around Town with Your iPhone. Retrieved November 16, 2019 from http:\/\/www.businessinsider.com\/gigwalk-iphone-app-2011-5"},{"key":"e_1_2_1_19_1","first-page":"1","article-title":"The rise of crowdsourcing","volume":"14","author":"Howe Jeff","year":"2006","unstructured":"Jeff Howe . 2006 . The rise of crowdsourcing . Wired Magazine 14 , 6 (2006), 1 -- 4 . Jeff Howe. 2006. The rise of crowdsourcing. Wired Magazine 14, 6 (2006), 1--4.","journal-title":"Wired Magazine"},{"key":"e_1_2_1_20_1","volume-title":"Retrieved","author":"Hughes Matthew","year":"2014","unstructured":"Matthew Hughes . 2014 . What Is Uber and Why Is It Threatening Traditional Taxi Services ? Retrieved November 16, 2019 from http:\/\/www.makeuseof.com\/tag\/uber-threatening-traditional-taxi-services\/. Matthew Hughes. 2014. What Is Uber and Why Is It Threatening Traditional Taxi Services? Retrieved November 16, 2019 from http:\/\/www.makeuseof.com\/tag\/uber-threatening-traditional-taxi-services\/."},{"key":"e_1_2_1_21_1","first-page":"1","article-title":"Batch allocation for tasks with overlapping skill requirements in crowdsourcing","volume":"99","author":"Jiang Jiuchuan","year":"2019","unstructured":"Jiuchuan Jiang , Bo An , Yichuan Jiang , Peng Shi , Zhan Bu , and Jie Cao . 2019 . Batch allocation for tasks with overlapping skill requirements in crowdsourcing . IEEE Transactions on Parallel and Distributed Systems PP , 99 , 1 . Jiuchuan Jiang, Bo An, Yichuan Jiang, Peng Shi, Zhan Bu, and Jie Cao. 2019. Batch allocation for tasks with overlapping skill requirements in crowdsourcing. IEEE Transactions on Parallel and Distributed Systems PP, 99, 1.","journal-title":"IEEE Transactions on Parallel and Distributed Systems PP"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.249"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2424321.2424346"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2557642.2578223"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1357054.1357127"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology (UIST\u201911)","author":"Kittur Aniket","unstructured":"Aniket Kittur , Boris Smus , Susheel Khamkar , and Robert E. Kraut . 2011. CrowdForge: Crowdsourcing complex work . In Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology (UIST\u201911) . 43--52. Aniket Kittur, Boris Smus, Susheel Khamkar, and Robert E. Kraut. 2011. CrowdForge: Crowdsourcing complex work. In Proceedings of the 24th Annual ACM Symposium on User Interface Software and Technology (UIST\u201911). 43--52."},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139958.3139973"},{"key":"e_1_2_1_28_1","volume-title":"Retrieved","author":"Needleman Rafe","year":"2012","unstructured":"Rafe Needleman . 2012 . EasyShift Takes on GigWalk with New Task Marketplace . Retrieved November 16, 2019 from http:\/\/www.cnet.com\/news\/easyshift-takes-on-gigwalk-with-new-task-marketplace\/. Rafe Needleman. 2012. EasyShift Takes on GigWalk with New Task Marketplace. Retrieved November 16, 2019 from http:\/\/www.cnet.com\/news\/easyshift-takes-on-gigwalk-with-new-task-marketplace\/."},{"key":"e_1_2_1_29_1","volume-title":"Bayesian Inference: Particle Filtering","author":"Orhan Emin","year":"2012","unstructured":"Emin Orhan . 2012 . Bayesian Inference: Particle Filtering . Center for Neural Science , University of Rochester, Rochester, NY. Emin Orhan. 2012. Bayesian Inference: Particle Filtering. Center for Neural Science, University of Rochester, Rochester, NY."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2348543.2348580"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/356924.356930"},{"key":"e_1_2_1_32_1","unstructured":"Andreas St\u00f8rksen Stordal. 2008. Sequential Monte Carlo Methods for Bayesian Filtering. Available at bora.uib.no\/handle\/1956\/3374.  Andreas St\u00f8rksen Stordal. 2008. Sequential Monte Carlo Methods for Bayesian Filtering. Available at bora.uib.no\/handle\/1956\/3374."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SERVICES-I.2009.56"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2013.2289327"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.7903\/cmr.1145"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2015.05.010"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814575"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2014.2327053"},{"key":"e_1_2_1_39_1","volume-title":"Volunteered geographic information and crowdsourcing disaster relief: A case study of the Haitian earthquake. World Medical 8 Health Policy 2, 2","author":"Zook Matthew","year":"2010","unstructured":"Matthew Zook , Mark Graham , Taylor Shelton , and Sean Gorman . 2010. Volunteered geographic information and crowdsourcing disaster relief: A case study of the Haitian earthquake. World Medical 8 Health Policy 2, 2 ( 2010 ), 7--33. Matthew Zook, Mark Graham, Taylor Shelton, and Sean Gorman. 2010. Volunteered geographic information and crowdsourcing disaster relief: A case study of the Haitian earthquake. World Medical 8 Health Policy 2, 2 (2010), 7--33."}],"container-title":["ACM Transactions on Spatial Algorithms and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3363450","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3363450","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3363450","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:53Z","timestamp":1750201973000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3363450"}},"subtitle":["A Fast Framework of Optimizing Task Throughput for Large-Scale Mobile Crowdsourcing"],"short-title":[],"issued":{"date-parts":[[2020,1,30]]},"references-count":38,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,3,31]]}},"alternative-id":["10.1145\/3363450"],"URL":"https:\/\/doi.org\/10.1145\/3363450","relation":{},"ISSN":["2374-0353","2374-0361"],"issn-type":[{"value":"2374-0353","type":"print"},{"value":"2374-0361","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,30]]},"assertion":[{"value":"2018-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2019-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-01-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}