skip to main content
research-article

Task Planning Considering Location Familiarity in Spatial Crowdsourcing

Published: 30 March 2021 Publication History

Abstract

Spatial crowdsourcing (SC) is a popular distributed problem-solving paradigm that harnesses the power of mobile workers (e.g., smartphone users) to perform location-based tasks (e.g., checking product placement or taking landmark photos). Typically, a worker needs to travel physically to the target location to finish the assigned task. Hence, the worker’s familiarity level on the target location directly influences the completion quality of the task. In addition, from the perspective of the SC server, it is desirable to finish all tasks with a low recruitment cost. Combining these issues, we propose a Bi-Objective Task Planning (BOTP) problem in SC, where the server makes a task assignment and schedule for the workers to jointly optimize the workers’ familiarity levels on the locations of assigned tasks and the total cost of worker recruitment. The BOTP problem is proved to be NP-hard and thus intractable. To solve this challenging problem, we propose two algorithms: a divide-and-conquer algorithm based on the constraint method and a heuristic algorithm based on the multi-objective simulated annealing algorithm. The extensive evaluations on a real-world dataset demonstrate the effectiveness of the proposed algorithms.

References

[1]
Sanghamitra Bandyopadhyay, Sriparna Saha, Ujjwal Maulik, and Kalyanmoy Deb. 2008. A simulated annealing-based multiobjective optimization algorithm: AMOSA. IEEE Trans. Evol. Comput. 12, 3 (2008), 269--283.
[2]
Fuat Basık, Bugra Gedik, Hakan Ferhatosmanoglu, and Kun-Lung Wu. 2018. Fair task allocation in crowdsourced delivery. IEEE Trans. Serv. Comput. (2018).
[3]
Shahzad Sarwar Bhatti, Jiahao Fan, Kangrui Wang, Xiaofeng Gao, Fan Wu, and Guihai Chen. 2020. An approximation algorithm for bounded task assignment problem in spatial crowdsourcing. IEEE Trans. Mob. Comput. (2020).
[4]
José Brandão. 2004. A tabu search algorithm for the open vehicle routing problem. Eur. J. Op. Res. 157, 3 (2004), 552--564.
[5]
Yueyue Chen, Deke Guo, Md Zakirul Alam Bhuiyan, Ming Xu, Guojun Wang, and Pin Lv. 2019. Towards profit optimization during online participant selection in compressive mobile crowdsensing. ACM Trans. Sensor Netw. 15, 4 (2019), 1--29.
[6]
Peng Cheng, Xiang Lian, Zhao Chen, Rui Fu, Lei Chen, Jinsong Han, and Jizhong Zhao. 2015. Reliable diversity-based spatial crowdsourcing by moving workers. Proc. VLDB Endow. 8, 10 (2015), 1022--1033.
[7]
Dingxiong Deng, Cyrus Shahabi, and Ugur Demiryurek. 2013. Maximizing the number of worker’s self-selected tasks in spatial crowdsourcing. In Proceedings of the ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 324--333.
[8]
Dingxiong Deng, Cyrus Shahabi, and Linhong Zhu. 2015. Task matching and scheduling for multiple workers in spatial crowdsourcing. In Proceedings of the ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. ACM, 21.
[9]
Wei Gong, Baoxian Zhang, and Cheng Li. 2017. Location-based online task scheduling in mobile crowdsensing. In Proceedings of the IEEE Global Communications Conference (GLOBECOM’17). IEEE, 1--6.
[10]
Bin Guo, Yan Liu, Leye Wang, Victor O. K. Li, Jacqueline C. K. Lam, and Zhiwen Yu. 2018. Task allocation in spatial crowdsourcing: Current state and future directions. IEEE Internet Things J. 5, 3 (2018), 1749--1764.
[11]
Bin Guo, Yan Liu, Wenle Wu, Zhiwen Yu, and Qi Han. 2016. Activecrowd: A framework for optimized multitask allocation in mobile crowdsensing systems. IEEE Trans. Hum.-Mach. Syst. 47, 3 (2016), 392--403.
[12]
Mordechai Haklay. 2010. How good is volunteered geographical information? A comparative study of openstreetmap and ordnance survey datasets. Environ. Plan. B: Plan. Des. 37, 4 (2010), 682--703.
[13]
Shibo He, Dong-Hoon Shin, Junshan Zhang, and Jiming Chen. 2014. Toward optimal allocation of location dependent tasks in crowdsensing. In Proceedings of the IEEE Conference on Computer Communications (INFOCOM’14). IEEE, 745--753.
[14]
Leyla Kazemi and Cyrus Shahabi. 2012. Geocrowd: Enabling query answering with spatial crowdsourcing. In Proceedings of the 20th International Conference on Advances in Geographic Information Systems. ACM, 189--198.
[15]
Hanshang Li, Ting Li, and Yu Wang. 2015. Dynamic participant recruitment of mobile crowd sensing for heterogeneous sensing tasks. In Proceedings of the IEEE 12th International Conference on Mobile Ad Hoc and Sensor Systems. IEEE, 136--144.
[16]
Mingchu Li, Yuanyuan Zheng, Xing Jin, and Cheng Guo. 2018. Task assignment for simple tasks with small budget in mobile crowdsourcing. In Proceedings of the 14th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN’18). IEEE, 68--73.
[17]
Xin Li and Xinglin Zhang. 2021. Multi-task allocation under time constraints in mobile crowdsensing. IEEE Trans. Mob. Comput. 20, 4 (2021), 1494--1510.
[18]
Yu Li, Wenjian Xu, and Man Lung Yiu. 2019. Client-side service for recommending rewarding routes to mobile crowdsourcing workers. IEEE Trans. Serv. Comput. (2019).
[19]
Yan Liu, Bin Guo, Yang Wang, Wenle Wu, Zhiwen Yu, and Daqing Zhang. 2016. TaskMe: Multi-task allocation in mobile crowd sensing. In Proceedings of the ACM International Joint Conference on Pervasive and Ubiquitous Computing. ACM, 403--414.
[20]
Xin Miao, Yanrong Kang, Qiang Ma, Kebin Liu, and Lei Chen. 2020. Quality-aware online task assignment in mobile crowdsourcing. ACM Trans. Sensor Netw. 16, 3 (2020), 1--21.
[21]
Prashanth Mohan, Venkata N. Padmanabhan, and Ramachandran Ramjee. 2008. Nericell: Rich monitoring of road and traffic conditions using mobile smartphones. In Proceedings of the 6th ACM Conference on Embedded Network Sensor Systems. ACM, 323--336.
[22]
Sang-Min Park, Doo-Kwon Baik, and Young-Gab Kim. 2016. Sentiment user profile analysis based on forgetting curve in mobile environments. In Proceedings of the IEEE 15th International Conference on Cognitive Informatics & Cognitive Computing (ICCI* CC’16). IEEE, 207--211.
[23]
C. Peng, X. Zhang, and Z. Ou. 2019. Location familiarity oriented task planning in spatial crowdsourcing. In Proceedings of the IEEE 25th International Conference on Parallel and Distributed Systems (ICPADS’19). 798--805.
[24]
Lianyong Qi, Chunhua Hu, Xuyun Zhang, Mohammad R. Khosravi, Suraj Sharma, Shaoning Pang, and Tian Wang. 2020. Privacy-aware data fusion and prediction with spatial-temporal context for smart city industrial environment. IEEE Trans. Industr. Inf. (2020), 1--1. Retrieved from https://doi.org/10.1109/TII.2020.3012157.
[25]
Hien To, Liyue Fan, Luan Tran, and Cyrus Shahabi. 2016. Real-time task assignment in hyperlocal spatial crowdsourcing under budget constraints. In Proceedings of the IEEE International Conference on Pervasive Computing and Communications (PerCom’16). IEEE, 1--8.
[26]
Yongxin Tong, Lei Chen, and Cyrus Shahabi. 2017. Spatial crowdsourcing: Challenges, techniques, and applications. Proc. VLDB Endow. 10, 12 (2017), 1988--1991.
[27]
Umair ul Hassan and Edward Curry. 2016. Efficient task assignment for spatial crowdsourcing: A combinatorial fractional optimization approach with semi-bandit learning. Exp. Syst. Applic. 58 (2016), 36--56.
[28]
Liang Wang, Zhiwen Yu, Qi Han, Bin Guo, and Haoyi Xiong. 2017. Multi-objective optimization based allocation of heterogeneous spatial crowdsourcing tasks. IEEE Trans. Mob. Comput. 17, 7 (2017), 1637--1650.
[29]
Liang Wang, Zhiwen Yu, Daqing Zhang, Bin Guo, and Chi Harold Liu. 2018. Heterogeneous multi-task assignment in mobile crowdsensing using spatiotemporal correlation. IEEE Trans. Mob. Comput. 18, 1 (2018), 84--97.
[30]
Leye Wang, Daqing Zhang, Dingqi Yang, Animesh Pathak, Chao Chen, Xiao Han, Haoyi Xiong, and Yasha Wang. 2018. SPACE-TA : Cost-effective task allocation exploiting intradata and interdata correlations in sparse crowdsensing. ACM Trans. Intell. Syst. Technol. 9, 2 (2018), 20.
[31]
Y. Wang, Z. Cai, Z. Zhan, B. Zhao, X. Tong, and L. Qi. 2020. Walrasian equilibrium-based multiobjective optimization for task allocation in mobile crowdsourcing. IEEE Trans. Comput. Soc. Syst. 7, 4 (2020), 1033--1046.
[32]
Yingjie Wang, Zhipeng Cai, Zhi-Hui Zhan, Yue-Jiao Gong, and Xiangrong Tong. 2019. An optimization and auction-based incentive mechanism to maximize social welfare for mobile crowdsourcing. IEEE Trans. Comput. Soc. Syst. 6, 3 (2019), 414--429. Retrieved from https://doi.org/10.1109/TCSS.2019.2907059.
[33]
Yingjie Wang, Yang Gao, Yingshu Li, and Xiangrong Tong. 2020. A worker-selection incentive mechanism for optimizing platform-centric mobile crowdsourcing systems. Comput. Netw. 171 (2020), 107144. Retrieved from http://www.sciencedirect.com/science/article/pii/S1389128619311557.
[34]
Kun Xie, Xiaocan Li, Xin Wang, Gaogang Xie, Jigang Wen, and Dafang Zhang. 2019. Active sparse mobile crowd sensing based on matrix completion. In Proceedings of the International Conference on Management of Data. ACM, 195--210.
[35]
Xiaolong Xu, Qihe Huang, Xiaochun Yin, Mahdi Abbasi, Mohammad R. Khosravi, and Lianyong Qi. 2020. Intelligent offloading for collaborative smart city services in edge computing. IEEE Internet Things J. 7, 9 (2020), 7919--7927. Retrieved from https://doi.org/10.1109/JIOT.2020.3000871.
[36]
Bo Yanng and Weigong Zhang. 2011. Intelligent learning system based on HMM model. In Proceedings of the 4th International Symposium on Knowledge Acquisition and Modeling. IEEE, 490--492.
[37]
Man Lung Yiu and Nikos Mamoulis. 2007. Efficient processing of top-k dominating queries on multi-dimensional data. In Proceedings of the 33rd International Conference on Very Large Data Bases. VLDB Endowment, 483--494.
[38]
Xinglin Zhang, Le Jiang, and Xiumin Wang. 2019. Incentive mechanisms for mobile crowdsensing with heterogeneous sensing costs. IEEE Trans. Vehic. Technol. 68, 4 (2019), 3992--4002.
[39]
Xinglin Zhang, Zheng Yang, and Yunhao Liu. 2018. Vehicle-based bi-objective crowdsourcing. IEEE Trans. Intell. Transport. Syst. 19, 10 (2018), 3420--3428.
[40]
Xinglin Zhang, Zheng Yang, Yunhao Liu, and Shaohua Tang. 2019. On reliable task assignment for spatial crowdsourcing. IEEE Trans. Emerg. Topics Comput. 7, 1 (2019), 174--186.
[41]
Yifan Zhang, Xinglin Zhang, and Feng Li. 2020. BiCrowd: Online bi-objective incentive mechanism for mobile crowd sensing. IEEE Internet Things J. (2020), 1--1. Retrieved from https://doi.org/10.1109/JIOT.2020.2994365.
[42]
Yongjian Zhao and Qi Han. 2016. Spatial crowdsourcing: Current state and future directions. IEEE Commun. Mag. 54, 7 (2016), 102--107.
[43]
Yan Zhao, Kai Zheng, Yang Li, Han Su, Jiajun Liu, and Xiaofang Zhou. 2019. Destination-aware task assignment in spatial crowdsourcing: A worker decomposition approach. IEEE Trans. Knowl. Data Eng. 32, 12 (2019).
[44]
Zhengqiu Zhu, Bin Chen, Wenbin Liu, Yong Zhao, Zhong Liu, and Zhiming Zhao. 2020. A cost-quality beneficial cell selection approach for sparse mobile crowdsensing with diverse sensing costs. IEEE Internet Things J. (2020).

Cited By

View all
  • (2024)Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation ApproachIEEE Transactions on Mobile Computing10.1109/TMC.2024.337346923:10(10093-10110)Online publication date: 1-Oct-2024
  • (2023)Credit and quality intelligent learning based multi-armed bandit scheme for unknown worker selection in multimedia MCSInformation Sciences10.1016/j.ins.2023.119444647(119444)Online publication date: Nov-2023

Index Terms

  1. Task Planning Considering Location Familiarity in Spatial Crowdsourcing

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Transactions on Sensor Networks
    ACM Transactions on Sensor Networks  Volume 17, Issue 2
    May 2021
    296 pages
    ISSN:1550-4859
    EISSN:1550-4867
    DOI:10.1145/3447946
    Issue’s Table of Contents
    Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Journal Family

    Publication History

    Published: 30 March 2021
    Accepted: 01 December 2020
    Revised: 01 October 2020
    Received: 01 August 2020
    Published in TOSN Volume 17, Issue 2

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. Spatial crowdsourcing
    2. location familiarity
    3. location-based service
    4. task planning

    Qualifiers

    • Research-article
    • Research
    • Refereed

    Funding Sources

    • Pearl River S&T Nova Program of Guangzhou
    • National Natural Science Foundations of China
    • Guangdong Special Support Program
    • Natural Science Foundations of Guangdong Province for Distinguished Young Scholar

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)23
    • Downloads (Last 6 weeks)1
    Reflects downloads up to 03 Mar 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Enhancing Worker Recruitment in Collaborative Mobile Crowdsourcing: A Graph Neural Network Trust Evaluation ApproachIEEE Transactions on Mobile Computing10.1109/TMC.2024.337346923:10(10093-10110)Online publication date: 1-Oct-2024
    • (2023)Credit and quality intelligent learning based multi-armed bandit scheme for unknown worker selection in multimedia MCSInformation Sciences10.1016/j.ins.2023.119444647(119444)Online publication date: Nov-2023

    View Options

    Login options

    Full Access

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    HTML Format

    View this article in HTML Format.

    HTML Format

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media