Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties

In this work, we investigate the problem of large-scale mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually pick tasks to perform, we automatically make task recommendation based...

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/2815
https://ink.library.smu.edu.sg/context/sis_research/article/3815/viewcontent/IJCAI2015_City_scaleCrowdsourcing.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-3815
record_format dspace
spelling sg-smu-ink.sis_research-38152020-03-24T03:39:12Z Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties CHEN CEN, CHENG, Shih-Fen LAU, Hoong Chuin MISRA, Archan In this work, we investigate the problem of large-scale mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually pick tasks to perform, we automatically make task recommendation based on workers’ historical trajectories and desired time budgets. The challenge of predicting workers’ trajectories is that it is faced with uncertainties, as a worker does not take same routes every day. In this work, we depart from 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 structures of the formulation and apply the Lagrangian relaxation technique to scale up computation. 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-07-01T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/2815 https://ink.library.smu.edu.sg/context/sis_research/article/3815/viewcontent/IJCAI2015_City_scaleCrowdsourcing.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 Deterministic modeling Industry practices Integer linear program sLagrangian relaxation techniques Location based Mobile crowdsourcing Stochastic task Transportation network Computer Sciences Operations Research, Systems Engineering and Industrial Engineering
institution Singapore Management University
building SMU Libraries
continent Asia
country Singapore
Singapore
content_provider SMU Libraries
collection InK@SMU
language English
topic Deterministic modeling
Industry practices
Integer linear program
sLagrangian relaxation techniques
Location based
Mobile crowdsourcing
Stochastic task
Transportation network
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
spellingShingle Deterministic modeling
Industry practices
Integer linear program
sLagrangian relaxation techniques
Location based
Mobile crowdsourcing
Stochastic task
Transportation network
Computer Sciences
Operations Research, Systems Engineering and Industrial Engineering
CHEN CEN,
CHENG, Shih-Fen
LAU, Hoong Chuin
MISRA, Archan
Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
description In this work, we investigate the problem of large-scale mobile crowdsourcing, where workers are financially motivated to perform location-based tasks physically. Unlike current industry practice that relies on workers to manually pick tasks to perform, we automatically make task recommendation based on workers’ historical trajectories and desired time budgets. The challenge of predicting workers’ trajectories is that it is faced with uncertainties, as a worker does not take same routes every day. In this work, we depart from 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 structures of the formulation and apply the Lagrangian relaxation technique to scale up computation. 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 Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
title_short Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
title_full Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
title_fullStr Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
title_full_unstemmed Towards City-scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties
title_sort towards city-scale mobile crowdsourcing: task recommendations under trajectory uncertainties
publisher Institutional Knowledge at Singapore Management University
publishDate 2015
url https://ink.library.smu.edu.sg/sis_research/2815
https://ink.library.smu.edu.sg/context/sis_research/article/3815/viewcontent/IJCAI2015_City_scaleCrowdsourcing.pdf
_version_ 1770572633879871488