返回
Task Allocation in Spatial Crowdsourcing: An Efficient Geographic Partition Framework
DOI:10.1109/TKDE.2024.3374086.png)
摘要
En 中文
Recent years have witnessed a revolution in Spatial Crowdsourcing (SC), in which people with mobile connectivity can perform spatio-temporal tasks that involve traveling to specified locations. In this paper, we identify and study in depth a new multi-center-based task allocation problem in the context of SC, where multiple allocation centers exist. In particular, we aim to maximize the total number of the allocated tasks while minimizing the allocated task number difference. To solve the problem, we propose a two-phase framework, called Task Allocation with Geographic Partition, consisting of a geographic partition and a task allocation phase. The first phase divides the whole study area based on the allocation centers by using both a basic Voronoi diagram-based algorithm and an adaptive weighted Voronoi diagram-based algorithm. In the allocation phase, we utilize a Reinforcement Learning method to achieve the task allocation, where a graph neural network with the attention mechanism is used to learn the embeddings of allocation centers, delivery points, and workers. To further improve the efficiency, we propose an early stopping optimization strategy for the adaptive weighted Voronoi diagram-based algorithm in the geographic partition phase and give a distance-constrained graph pruning strategy for the Reinforcement Learning method in the task allocation phase. Extensive experiments give insight into the effectiveness and efficiency of the proposed solutions.
Keyword:
Task analysis
Resource management
Partitioning algorithms
Crowdsourcing
Training
Reinforcement learning
Optimization
Geographic partition
task allocation
spatial crowdsourcing
reinforcement learning
期刊
IF:
10.4
论文数:
6.9K
被引数:
3.2W
机构
引用论文
Research on the Efficiency of Wireless Power Transfer System Based on Multi-Auxiliary Transmitting Coils基于多辅助发射线圈的无线电能传输系统效率研究
A reinforcement learning approach for optimizing multiple traveling salesman problems over graphs一种强化学习方法,用于优化图上的多个旅行商问题

