arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2310.12433cs.DC
收藏

面向海量空间异构数据的空间众包任务分配方案

Spatial Crowdsourcing Task Allocation Scheme for Massive Data with Spatial Heterogeneity

Kun Li, Shengling Wang, Hongwei Shi, Xiuzhen Cheng, Minghui Xu

AI总结:

针对现有空间众包任务分配在计算效率、均衡匹配和参与激励方面的局限,提出基于图的分配框架,通过聚类降规模、非交叉图建模和双向匹配优化共同利益,并在真实数据集上验证了有效性。

摘要:

空间众包(SC)利用大量工人池完成基于位置的任务,吸引了越来越多的研究兴趣。然而,现有的SC任务分配方法在计算效率、均衡匹配和参与激励方面存在局限。为应对这些挑战,我们提出了一种针对海量异构空间数据优化的基于图的分配框架。该框架首先分别对相似任务和工人进行聚类,以降低分配规模。接着,构建新型非交叉图结构,对分布不均的任务与工人间的均衡邻接关系进行建模。基于这些图,设计了双向工人-任务匹配方案,以生成优化共同利益的分配结果。在真实数据集上的大量实验分析了不同参数设置下的性能表现。

英文摘要:

Spatial crowdsourcing (SC) engages large worker pools for location-based tasks, attracting growing research interest. However, prior SC task allocation approaches exhibit limitations in computational efficiency, balanced matching, and participation incentives. To address these challenges, we propose a graph-based allocation framework optimized for massive heterogeneous spatial data. The framework first clusters similar tasks and workers separately to reduce allocation scale. Next, it constructs novel non-crossing graph structures to model balanced adjacencies between unevenly distributed tasks and workers. Based on the graphs, a bidirectional worker-task matching scheme is designed to produce allocations optimized for mutual interests. Extensive experiments on real-world datasets analyze the performance under various parameter settings.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑