首页> 外文期刊>Human-Machine Systems, IEEE Transactions on >ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems
【24h】

ActiveCrowd: A Framework for Optimized Multitask Allocation in Mobile Crowdsensing Systems

机译:ActiveCrowd:移动人群感应系统中优化多任务分配的框架

获取原文
获取原文并翻译 | 示例
           

摘要

Worker selection is a key issue in mobile crowd sensing (MCS). While the previous worker selection approaches mainly focus on selecting a proper subset of workers for a single MCS task, a multitask-oriented worker selection is essential and useful for the efficiency of large-scale MCS platforms. This paper proposes ActiveCrowd, a worker selection framework for multitask MCS environments. We study the problem of multitask worker selection under two situations: worker selection based on workers’ intentional movement for time-sensitive tasks and unintentional movement for delay-tolerant tasks. For time-sensitive tasks, workers are required to move to the task venue intentionally and the goal is to minimize the total distance moved. For delay-tolerant tasks, we select workers whose route is predicted to pass by the task venues and the goal is to minimize the total number of workers. Two greedy-enhanced genetic algorithms are proposed to solve them. Experiments verify that the proposed algorithms outperform baseline methods under different experiment settings (scale of task sets, available workers, varied task distributions, etc.).
机译:员工选择是移动人群感知(MCS)中的关键问题。尽管以前的工作人员选择方法主要集中于为单个MCS任务选择适当的工作人员子集,但面向多任务的工作人员选择对于大规模MCS平台的效率至关重要且有用。本文提出ActiveCrowd,这是用于多任务MCS环境的工作人员选择框架。我们研究了两种情况下的多任务工人选择问题:基于对时间敏感任务的工人有意移动的工人选择和对延迟容忍任务的无意移动。对于时间紧迫的任务,要求工人有意识地移到任务地点,目的是使移动的总距离最小。对于延迟容忍的任务,我们选择预计其路线会经过任务地点的工作人员,目标是最大程度地减少工作人员总数。提出了两种贪婪增强遗传算法来求解它们。实验证明,在不同的实验设置(任务集规模,可用工人,变化的任务分配等)下,所提出的算法优于基线方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号