Sign in to use this feature.

Years

Between: -

Subjects

remove_circle_outline
remove_circle_outline

Journals

Article Types

Countries / Regions

Search Results (1)

Search Parameters:
Keywords = participatory crowdsensing (PCS)

Order results
Result details
Results per page
Select all
Export citation of selected articles as:
16 pages, 2532 KB  
Article
Task Assignment and Path Planning Mechanism Based on Grade-Matching Degree and Task Similarity in Participatory Crowdsensing
by Xiaoxue He, Yubo Wang, Xu Zhao, Tiancong Huang and Yantao Yu
Sensors 2024, 24(2), 651; https://doi.org/10.3390/s24020651 - 19 Jan 2024
Cited by 2 | Viewed by 2828
Abstract
Participatory crowdsensing (PCS) is an innovative data sensing paradigm that leverages the sensors carried in mobile devices to collect large-scale environmental information and personal behavioral data with the user’s participation. In PCS, task assignment and path planning pose complex challenges. Previous studies have [...] Read more.
Participatory crowdsensing (PCS) is an innovative data sensing paradigm that leverages the sensors carried in mobile devices to collect large-scale environmental information and personal behavioral data with the user’s participation. In PCS, task assignment and path planning pose complex challenges. Previous studies have only focused on the assignment of individual tasks, neglecting or overlooking the associations between tasks. In practice, users often tend to execute similar tasks when choosing assignments. Additionally, users frequently engage in tasks that do not match their abilities, leading to poor task quality or resource wastage. This paper introduces a multi-task assignment and path-planning problem (MTAPP), which defines utility as the ratio of a user’s profit to the time spent on task execution. The optimization goal of MATPP is to maximize the utility of all users in the context of task assignment, allocate a set of task locations to a group of workers, and generate execution paths. To solve the MATPP, this study proposes a grade-matching degree and similarity-based mechanism (GSBM) in which the grade-matching degree determines the user’s income. It also establishes a mathematical model, based on similarity, to investigate the impact of task similarity on user task completion. Finally, an improved ant colony optimization (IACO) algorithm, combining the ant colony and greedy algorithms, is employed to maximize total utility. The simulation results demonstrate its superior performance in terms of task coverage, average task completion rate, user profits, and task assignment rationality compared to other algorithms. Full article
Show Figures

Figure 1

Back to TopTop