DaTask: A Decomposition-Based Deadline-Aware Task Assignment and Workers’ Path-Planning in Mobile Crowd-Sensing
Clicks: 320
ID: 115044
2020
Article Quality & Performance Metrics
Overall Quality
Not rated
Combines reader engagement with the AI quality analysis. This
article has not been analysed, so there is no overall score —
reader engagement is measured and shown alongside.
Reader Engagement
Emerging Content
30.0
/100
320 views
50 readers
AI Quality Assessment
Not analyzed
Readership in this journal
EmergingRanked #40 of 308 articles by views in ieee access
Most read
Least read
Bar heights use a square-root scale. Only the 120 most-read articles are drawn; the journal has 308 in total.
Mint this article as an NFT
Not yet mintedCreate a permanent, verifiable on-chain record of this article on the Scimatic Network. The NFT is held in your Journament account, and you can withdraw it to your own wallet at any time.
5
SUSD
one-off · no wallet required
Abstract
Mobile crowd-sensing (MCS) has recently become a promising approach for massive data collection, which empowers common people to perform sensing tasks with their smart devices. In MCS, locations of tasks and workers are diverse, and workers need to visit different task venues to perform the tasks. The diversity of task and worker locations, tasks’ location accessibility, and required sensor type make the task assignment problem highly challenging. In time-sensitive MCS applications, this task assignment problem becomes even more intractable because of the deadline and a lot of possible movement trajectories of the workers. In this paper, we introduce two types of workers and formulate the task assignment problem, which comprises an embedded structure. Furthermore, a decomposition technique is applied to decompose the original problem into a main problem (the assignment problem) and a set of sub-problems (traveling salesman problems). The assignment problem determines task-worker assignments, and the sub-problems determine trajectories of the workers. This decomposition allows using a simpler solution strategy. Then, a memetic genetic algorithm is proposed to address the assignment problem, while each sub-problem is solved using an asymmetric traveling salesman problem heuristic. Results from simulations verify that the proposed algorithm outperforms the baseline methods under various experimental settings.
| Reference Key |
yoon2020ieeedatask:
Use this key to autocite in the manuscript while using
SciMatic Manuscript Manager or Thesis Manager
|
|---|---|
| Authors | Shathee Akter,Seokhoon Yoon;Shathee Akter;Seokhoon Yoon; |
| Journal | ieee access |
| Year | 2020 |
| DOI |
10.1109/access.2020.2980143
|
| URL | |
| Keywords |
Citations
No citations found. To add a citation, contact the admin at info@scimatic.org
Comments
No comments yet. Be the first to comment on this article.