Task assignment is a crucial aspect of mobile crowdsourcing research. The focus is on allocating appropriate perceptual tasks based on task and worker characteristics to optimize perceptual quality. Tasks arrive dynamically in a crowdsourcing system, and the platform cannot assign all tasks at the beginning. This can lead to the task allocation process falling into a local optimal solution. To address the problem, this paper proposes a two-stage prediction algorithm that utilises historical spatio-temporal data of crowdsourcing services. Firstly, the temporal data is converted into image data through Markov Transition Field. Then, the task availability is transformed into a categorisation problem. In the first stage, a ConvNeXt-based network is used to predict the task availability. In the second stage, a GRU-based network is used to predict the task duration. This paper presents the results of several experiments that confirm the effectiveness of the proposed algorithm.

错误:搜索内容不能为空,请输入英文关键词
错误:关键词超出字数限制,请精简
高级检索

Mobile Crowdsourcing Task Assignment Algorithm Based on ConvNeXt and GRU

  • Zequn Fan,
  • Qingxian Pan,
  • Zhaolong Gao,
  • Peng Luan,
  • Kai Wei,
  • Jinru Li

摘要

Task assignment is a crucial aspect of mobile crowdsourcing research. The focus is on allocating appropriate perceptual tasks based on task and worker characteristics to optimize perceptual quality. Tasks arrive dynamically in a crowdsourcing system, and the platform cannot assign all tasks at the beginning. This can lead to the task allocation process falling into a local optimal solution. To address the problem, this paper proposes a two-stage prediction algorithm that utilises historical spatio-temporal data of crowdsourcing services. Firstly, the temporal data is converted into image data through Markov Transition Field. Then, the task availability is transformed into a categorisation problem. In the first stage, a ConvNeXt-based network is used to predict the task availability. In the second stage, a GRU-based network is used to predict the task duration. This paper presents the results of several experiments that confirm the effectiveness of the proposed algorithm.