Multi-worker-aware task planning in real-time spatial crowdsourcing
Spatial crowdsourcing emerges as a new computing paradigm with the development of mobile Internet and the ubiquity of mobile devices. The core of many real-world spatial crowdsourcing applications is to assign suitable tasks to proper workers in real time. Many works only assign a set of tasks to ea...
Saved in:
Main Authors: | , , , , , |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2018
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/4735 https://ink.library.smu.edu.sg/context/sis_research/article/5738/viewcontent/dasfaa18_tao.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-5738 |
---|---|
record_format |
dspace |
spelling |
sg-smu-ink.sis_research-57382020-01-16T10:41:33Z Multi-worker-aware task planning in real-time spatial crowdsourcing TAO, Qian ZENG, Yuxiang ZHOU, Zimu TONG, Yongxin CHEN, Lei XU, Ke Spatial crowdsourcing emerges as a new computing paradigm with the development of mobile Internet and the ubiquity of mobile devices. The core of many real-world spatial crowdsourcing applications is to assign suitable tasks to proper workers in real time. Many works only assign a set of tasks to each worker without making the plan how to perform the assigned tasks. Others either make task plans only for a single worker or are unable to operate in real time. In this paper, we propose a new problem called the Multi-Worker-Aware Task Planning (MWATP) problem in the online scenario, in which we not only assign tasks to workers but also make plans for them, such that the total utility (revenue) is maximized. We prove that the offline version of MWATP problem is NP-hard, and no online algorithm has a constant competitive ratio on the MWATP problem. Two heuristic algorithms, called Delay-Planning and Fast-Planning, are proposed to solve the problem. Extensive experiments on synthetic and real datasets verify the effectiveness and efficiency of the two proposed algorithms. 2018-05-12T07:00:00Z text application/pdf https://ink.library.smu.edu.sg/sis_research/4735 info:doi/10.1007/978-3-319-91458-9_18 https://ink.library.smu.edu.sg/context/sis_research/article/5738/viewcontent/dasfaa18_tao.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 Spatial crowdsourcing Task assignment Task planning Software Engineering |
institution |
Singapore Management University |
building |
SMU Libraries |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
SMU Libraries |
collection |
InK@SMU |
language |
English |
topic |
Spatial crowdsourcing Task assignment Task planning Software Engineering |
spellingShingle |
Spatial crowdsourcing Task assignment Task planning Software Engineering TAO, Qian ZENG, Yuxiang ZHOU, Zimu TONG, Yongxin CHEN, Lei XU, Ke Multi-worker-aware task planning in real-time spatial crowdsourcing |
description |
Spatial crowdsourcing emerges as a new computing paradigm with the development of mobile Internet and the ubiquity of mobile devices. The core of many real-world spatial crowdsourcing applications is to assign suitable tasks to proper workers in real time. Many works only assign a set of tasks to each worker without making the plan how to perform the assigned tasks. Others either make task plans only for a single worker or are unable to operate in real time. In this paper, we propose a new problem called the Multi-Worker-Aware Task Planning (MWATP) problem in the online scenario, in which we not only assign tasks to workers but also make plans for them, such that the total utility (revenue) is maximized. We prove that the offline version of MWATP problem is NP-hard, and no online algorithm has a constant competitive ratio on the MWATP problem. Two heuristic algorithms, called Delay-Planning and Fast-Planning, are proposed to solve the problem. Extensive experiments on synthetic and real datasets verify the effectiveness and efficiency of the two proposed algorithms. |
format |
text |
author |
TAO, Qian ZENG, Yuxiang ZHOU, Zimu TONG, Yongxin CHEN, Lei XU, Ke |
author_facet |
TAO, Qian ZENG, Yuxiang ZHOU, Zimu TONG, Yongxin CHEN, Lei XU, Ke |
author_sort |
TAO, Qian |
title |
Multi-worker-aware task planning in real-time spatial crowdsourcing |
title_short |
Multi-worker-aware task planning in real-time spatial crowdsourcing |
title_full |
Multi-worker-aware task planning in real-time spatial crowdsourcing |
title_fullStr |
Multi-worker-aware task planning in real-time spatial crowdsourcing |
title_full_unstemmed |
Multi-worker-aware task planning in real-time spatial crowdsourcing |
title_sort |
multi-worker-aware task planning in real-time spatial crowdsourcing |
publisher |
Institutional Knowledge at Singapore Management University |
publishDate |
2018 |
url |
https://ink.library.smu.edu.sg/sis_research/4735 https://ink.library.smu.edu.sg/context/sis_research/article/5738/viewcontent/dasfaa18_tao.pdf |
_version_ |
1770575015377371136 |