Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties

In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommend...

Full description

Saved in:
Bibliographic Details
Main Authors: CHEN, Cen, CHENG, Shih-Fen, LAU, Hoong Chuin, MISRA, Archan
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2015
Subjects:
Online Access:https://ink.library.smu.edu.sg/sis_research/2674
https://ink.library.smu.edu.sg/context/sis_research/article/3674/viewcontent/MultiAgentTaskAssignmentMCrowdsourcing_2015_AAMAS.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English
id sg-smu-ink.sis_research-3674
record_format dspace
spelling sg-smu-ink.sis_research-36742016-12-15T01:14:15Z Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties CHEN, Cen CHENG, Shih-Fen LAU, Hoong Chuin MISRA, Archan In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommendations based on workers' historical trajectories and desired time budgets. However, predicting workers' trajectories is inevitably faced with uncertainties, as no one will take exactly the same route every day; yet such uncertainties are oftentimes abstracted away in the known literature. In this work, we depart from the deterministic modeling and study the stochastic task recommendation problem where each worker is associated with several predicted routine routes with probabilities. We formulate this problem as a stochastic integer linear program whose goal is to maximize the expected total utility achieved by all workers. We further exploit the separable structure of the formulation and apply the Lagrangian relaxation technique to scale up the solution approach. Experiments have been performed over the instances generated using the real Singapore transportation network. The results show that we can find significantly better solutions than the deterministic formulation. 2015-05-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2674 https://ink.library.smu.edu.sg/context/sis_research/article/3674/viewcontent/MultiAgentTaskAssignmentMCrowdsourcing_2015_AAMAS.pdf http://creativecommons.org/licenses/by-nc-nd/4.0/ Research Collection School Of Computing and Information Systems eng Institutional Knowledge at Singapore Management University crowdsourcing mobile crowdsourcing multiagent planning Computer Sciences Operations Research, Systems Engineering and Industrial Engineering Software Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic crowdsourcing
mobile crowdsourcing
multiagent planning
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Software Engineering
spellingShingle crowdsourcing
mobile crowdsourcing
multiagent planning
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
Software Engineering
CHEN, Cen
CHENG, Shih-Fen
LAU, Hoong Chuin
MISRA, Archan
Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
description In this work, we investigate the problem of mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually browse and filter tasks to perform, we intend to automatically make task recommendations based on workers' historical trajectories and desired time budgets. However, predicting workers' trajectories is inevitably faced with uncertainties, as no one will take exactly the same route every day; yet such uncertainties are oftentimes abstracted away in the known literature. In this work, we depart from the deterministic modeling and study the stochastic task recommendation problem where each worker is associated with several predicted routine routes with probabilities. We formulate this problem as a stochastic integer linear program whose goal is to maximize the expected total utility achieved by all workers. We further exploit the separable structure of the formulation and apply the Lagrangian relaxation technique to scale up the solution approach. Experiments have been performed over the instances generated using the real Singapore transportation network. The results show that we can find significantly better solutions than the deterministic formulation.
format text
author CHEN, Cen
CHENG, Shih-Fen
LAU, Hoong Chuin
MISRA, Archan
author_facet CHEN, Cen
CHENG, Shih-Fen
LAU, Hoong Chuin
MISRA, Archan
author_sort CHEN, Cen
title Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
title_short Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
title_full Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
title_fullStr Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
title_full_unstemmed Multi-Agent Task Assignment for Mobile Crowdsourcing Under Trajectory Uncertainties
title_sort multi-agent task assignment for mobile crowdsourcing under trajectory uncertainties
publisher Institutional Knowledge at Singapore Management University
publishDate 2015
url https://ink.library.smu.edu.sg/sis_research/2674
https://ink.library.smu.edu.sg/context/sis_research/article/3674/viewcontent/MultiAgentTaskAssignmentMCrowdsourcing_2015_AAMAS.pdf
_version_ 1770572544460455936