Rational Task Assignment and Path Planning Based on Location and Task Characteristics in Mobile Crowdsensing
Bibliographic Data
| ID | 22106655 |
|---|---|
| Authors | Bo Yin (0000-0001-9574-7032, Changsha University of Science and Technology), Jiaqi Li (0000-0001-8198-5160, Changsha University of Science and Technology), Xuetao Wei (0000-0002-4450-2251, Southern University of Science and Technology) |
| Year | 2022 |
| Volume | 9 |
| Issue | 3 |
| Pages | 781-793 |
| Publication date | 2022-06-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2021.3095946 |
| OpenAlex | W3185127829 |
| Language | EN |
| Citations received | 6 |
| References cited | 46 |
With the great development in smart devices, mobile crowdsensing (MCS) has been an innovative paradigm for data gathering. Task assignment is a fundamental problem in MCS systems and applications. Previous studies only focused on the assignment of individual tasks, neglecting planning the task processing from a higher level, e.g., making assignments between task locations and workers, which impacts the crowdsensing performance adversely. Furthermore, task characteristics, e.g., route distance, task similarity, and task priority, have a great impact on the rationality of a visiting order and the quality of crowdsensing services. In this article, we tackle the problem of rational task assignment and path planning for MCS, which aims to assign a set of task locations to a set of workers and generate location visiting sequences. We measure the assignment rationality by taking into account geographical information and task characteristics, i.e., route distance, task similarity, and task priority. We prove that the problem of computing the rationality maximization task assignment is NP-hard. For the single-worker scenario, we reduce the problem to a simpler problem with respect to only route distance and task priority criteria since the similarity measurement has a fixed value. We propose an effective greedy algorithm. For the multiple-worker scenario, we first extend the greedy idea by considering all three criteria and then propose an effective approach by reducing the computational complexity of similarity measurement. Extensive experiments show that our proposed approaches achieve promising results
Algorithm · Assignment problem · Greedy algorithm · Mathematical optimization · Maximization · Rationality · Task Analysis · Computer Science · Engineering · Human Mobility and Location-Based Analysis · Indoor and Outdoor Localization Technologies · Mathematics · Mobile Crowdsensing and Crowdsourcing · Artificial Intelligence
A Real-Time Route Prediction-Based Multiobjective Task Allocation for Opportunistic Mobile Crowdsensing
Quality-Improved and Delay-Aware Incentive Mechanism for Mobile Crowdsensing With Social Concerns
Surrounding Control Based on Optimal Targets Assignment and Dynamic Graph Game
Revenue-Optimal Reverse Auction for Task Allocation in Mobile Crowdsensing Through Transformer Attention
A Survey of Crowdsensing and Privacy Protection in Digital City
A Multiline Customized Bus Planning Method Based on Reinforcement Learning and Spatiotemporal Clustering Algorithm
| Citations per year | 2 |
|---|---|
| Citation span | 2023 - 2026 (4) |
| Highly cited | No |