论文标题

空间众包中的影响意识的任务分配(技术报告)

Influence-aware Task Assignment in Spatial Crowdsourcing (Technical Report)

论文作者

Chen, Xuanhao, Zhao, Yan, Zheng, Kai, Yang, Bin, Jensen, Christian S.

论文摘要

随着智能手机的广泛扩散,旨在为移动工人分配空间任务的空间众包(SC)引起了学术界和行业的越来越多的关注。主要问题之一是如何将任务最好分配给工人。鉴于工人和任务,工人将选择基于她对任务的亲和力接受任务,并且工人可以传播任务的信息,以吸引更多的工人执行任务。这些因素可以作为工作任务的影响来衡量。由于工人对任务的亲和力不同,任务发行人可能会要求执行任务的工人传播任务信息以吸引更多的工人执行这些任务,因此在进行作业时,分析工人任务的影响很重要。我们在SC中提出并解决了一个新颖的影响力感知的任务分配问题,在该问题中,任务是以实现高工作工作影响的方式分配给工人的。特别是,我们旨在最大化分配的任务和工作任务影响的数量。为了解决问题,我们首先通过识别工人的历史任务绩效模式来确定工人对任务的亲密关系。接下来,开发了一种历史接受方法来衡量工人执行任务的意愿,即工人在通知任务时访问任务位置的可能性。接下来,我们提出了一种基于可随机到达的传播优化算法,该算法利用可相反的到达集以计算社交网络中有关任务的工人的可能性。基于从上述三个因素得出的Worker任务影响,我们提出了三种影响感知的任务分配算法,旨在最大程度地提高指定的任务和工人任务的影响。在两个现实世界数据集上进行的广泛实验提供了有关解决方案有效性的详细见解。

With the widespread diffusion of smartphones, Spatial Crowdsourcing (SC), which aims to assign spatial tasks to mobile workers, has drawn increasing attention in both academia and industry. One of the major issues is how to best assign tasks to workers. Given a worker and a task, the worker will choose to accept the task based on her affinity towards the task, and the worker can propagate the information of the task to attract more workers to perform it. These factors can be measured as worker-task influence. Since workers' affinities towards tasks are different and task issuers may ask workers who performed tasks to propagate the information of tasks to attract more workers to perform them, it is important to analyze worker-task influence when making assignments. We propose and solve a novel influence-aware task assignment problem in SC, where tasks are assigned to workers in a manner that achieves high worker-task influence. In particular, we aim to maximize the number of assigned tasks and worker-task influence. To solve the problem, we first determine workers' affinities towards tasks by identifying workers' historical task-performing patterns. Next, a Historical Acceptance approach is developed to measure workers' willingness of performing a task, i.e., the probability of workers visiting the location of the task when they are informed. Next, we propose a Random reverse reachable-based Propagation Optimization algorithm that exploits reverse reachable sets to calculate the probability of workers being informed about tasks in a social network. Based on worker-task influence derived from the above three factors, we propose three influence-aware task assignment algorithms that aim to maximize the number of assigned tasks and worker-task influence. Extensive experiments on two real-world datasets offer detailed insight into the effectiveness of our solutions.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源