.png){kind=icon}
返回
Aggregation-based dual heterogeneous task allocation in spatial crowdsourcing
.png){kind=icon}
PRE
AI
DOI：10.1007/s11704-023-3133-6.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Spatial crowdsourcing (SC) is a popular data collection paradigm for numerous applications. With the increment of tasks and workers in SC, heterogeneity becomes an unavoidable difficulty in task allocation. Existing researches only focus on the single-heterogeneous task allocation. However, a variety of heterogeneous objects coexist in real-world SC systems. This dramatically expands the space for searching the optimal task allocation solution, affecting the quality and efficiency of data collection. In this paper, an aggregation-based dual heterogeneous task allocation algorithm is put forth. It investigates the impact of dual heterogeneous on the task allocation problem and seeks to maximize the quality of task completion and minimize the average travel distance. This problem is first proved to be NP-hard. Then, a task aggregation method based on locations and requirements is built to reduce task failures. Meanwhile, a time-constrained shortest path planning is also developed to shorten the travel distance in a community. After that, two evolutionary task allocation schemes are presented. Finally, extensive experiments are conducted based on real-world datasets in various contexts. Compared with baseline algorithms, our proposed schemes enhance the quality of task completion by up to 25% and utilize 34% less average travel distance.
Keyword:
task allocation
aggregation
shortest path
dual heterogeneous
spatial crowdsourcing
期刊
IF:
4.6
论文数:
1.6K
被引数:
2.8K
机构
引用论文
2 Synapsin I, an actin-binding protein regulating synaptic vesicle traffic in the nerve terminal
PREAI
分享收藏Laparoscopic approach in emergency for the treatment of acute incarcerated groin hernia: a systematic review and meta-analysis.png)
Hernia
HerniaIF0
PREAI
分享收藏
查看更多内容