arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2503.21458cs.LGcs.DB
收藏

DATA-WA:基于需求的动态工人可用性窗口自适应任务分配

DATA-WA: Demand-based Adaptive Task Assignment with Dynamic Worker Availability Windows

University of Electronic Science and Technology of China(电子科技大学);China Mobile (Suzhou) Software Technology Co., Ltd.(中国移动(苏州)软件技术有限公司);Aalborg University(奥尔堡大学);Beijing University of Posts and Telecommunications(北京邮电大学);Shenzhen Institute for Advanced Study, University of Electronic Science and Technology of China(电子科技大学深圳高等研究院)

Jinwen Chen, Jiannan Guo, Dazhuo Qiu, Yawen Li, Guanhua Ye, Yan Zhao, Kai Zheng

AI总结:

针对空间众包中需求与供给随时间波动的问题,提出DATA-WA框架,通过预测任务需求并利用工人可用性窗口动态调整分配,结合图划分和强化学习提升效率,实验验证其有效性和高效性。

摘要:

随着移动网络的快速发展和移动设备的广泛使用,空间众包(将基于位置的任务分配给移动工人)已获得显著关注。然而,现有研究大多聚焦于当前时刻的任务分配,忽视了任务与工人之间随时间的需求与供给波动。为解决此问题,我们引入一个自适应任务分配问题,旨在通过动态调整任务分配以响应变化的需求与供给,最大化已分配任务数量。我们开发了一个空间众包框架,即基于需求的动态工人可用性窗口自适应任务分配,包含两个组件:任务需求预测和任务分配。在第一个组件中,我们构建一个表示不同区域需求依赖关系的图邻接矩阵,并采用多元时间序列学习方法预测未来任务需求。在任务分配组件中,我们基于这些预测、工人可用性窗口和当前任务分配来调整任务给工人,其中每个工人有一个可用性窗口,指示他们可用于任务分配的时间段。为减少任务分配的搜索空间并提高效率,我们提出了一种基于图划分的工人依赖分离方法和一种基于强化学习的任务价值函数。在真实数据上的实验表明,我们的方法既有效又高效。

英文摘要:

With the rapid advancement of mobile networks and the widespread use of mobile devices, spatial crowdsourcing, which involves assigning location-based tasks to mobile workers, has gained significant attention. However, most existing research focuses on task assignment at the current moment, overlooking the fluctuating demand and supply between tasks and workers over time. To address this issue, we introduce an adaptive task assignment problem, which aims to maximize the number of assigned tasks by dynamically adjusting task assignments in response to changing demand and supply. We develop a spatial crowdsourcing framework, namely demand-based adaptive task assignment with dynamic worker availability windows, which consists of two components including task demand prediction and task assignment. In the first component, we construct a graph adjacency matrix representing the demand dependency relationships in different regions and employ a multivariate time series learning approach to predict future task demands. In the task assignment component, we adjust tasks to workers based on these predictions, worker availability windows, and the current task assignments, where each worker has an availability window that indicates the time periods they are available for task assignments. To reduce the search space of task assignments and be efficient, we propose a worker dependency separation approach based on graph partition and a task value function with reinforcement learning. Experiments on real data demonstrate that our proposals are both effective and efficient.

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

↑