Asset Details
MbrlCatalogueTitleDetail
Do you wish to reserve the book?
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
by
Lin, Zhikun
, Wu, Xiaozhu
, Yu, Long
, Jiao, Yuxin
in
Algorithms
/ Batch processing
/ Car sharing
/ Computer applications
/ Crowdsourcing
/ design
/ Earthquakes
/ Efficiency
/ exhibitions
/ fine-grained batching algorithm
/ Forest & brush fires
/ Matching
/ Mathematical analysis
/ methodology
/ multi-armed bandit algorithm
/ Multi-armed bandit problems
/ online task assignment
/ Participation
/ spatial crowdsourcing
/ spatial data
/ temporal variation
/ Temporal variations
/ User experience
/ utilities
/ wills
/ windows
2022
Hey, we have placed the reservation for you!
By the way, why not check out events that you can attend while you pick your title.
You are currently in the queue to collect this book. You will be notified once it is your turn to collect the book.
Oops! Something went wrong.
Looks like we were not able to place the reservation. Kindly try again later.
Are you sure you want to remove the book from the shelf?
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
by
Lin, Zhikun
, Wu, Xiaozhu
, Yu, Long
, Jiao, Yuxin
in
Algorithms
/ Batch processing
/ Car sharing
/ Computer applications
/ Crowdsourcing
/ design
/ Earthquakes
/ Efficiency
/ exhibitions
/ fine-grained batching algorithm
/ Forest & brush fires
/ Matching
/ Mathematical analysis
/ methodology
/ multi-armed bandit algorithm
/ Multi-armed bandit problems
/ online task assignment
/ Participation
/ spatial crowdsourcing
/ spatial data
/ temporal variation
/ Temporal variations
/ User experience
/ utilities
/ wills
/ windows
2022
Oops! Something went wrong.
While trying to remove the title from your shelf something went wrong :( Kindly try again later!
Do you wish to request the book?
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
by
Lin, Zhikun
, Wu, Xiaozhu
, Yu, Long
, Jiao, Yuxin
in
Algorithms
/ Batch processing
/ Car sharing
/ Computer applications
/ Crowdsourcing
/ design
/ Earthquakes
/ Efficiency
/ exhibitions
/ fine-grained batching algorithm
/ Forest & brush fires
/ Matching
/ Mathematical analysis
/ methodology
/ multi-armed bandit algorithm
/ Multi-armed bandit problems
/ online task assignment
/ Participation
/ spatial crowdsourcing
/ spatial data
/ temporal variation
/ Temporal variations
/ User experience
/ utilities
/ wills
/ windows
2022
Please be aware that the book you have requested cannot be checked out. If you would like to checkout this book, you can reserve another copy
We have requested the book for you!
Your request is successful and it will be processed during the Library working hours. Please check the status of your request in My Requests.
Oops! Something went wrong.
Looks like we were not able to place your request. Kindly try again later.
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
Journal Article
A Fine-Grain Batching-Based Task Allocation Algorithm for Spatial Crowdsourcing
2022
Request Book From Autostore
and Choose the Collection Method
Overview
Task allocation is a critical issue of spatial crowdsourcing. Although the batching strategy performs better than the real-time matching mode, it still has the following two drawbacks: (1) Because the granularity of the batch size set obtained by batching is too coarse, it will result in poor matching accuracy. However, roughly designing the batch size for all possible delays will result in a large computational overhead. (2) Ignoring non-stationary factors will lead to a change in optimal batch size that cannot be found as soon as possible. Therefore, this paper proposes a fine-grained, batching-based task allocation algorithm (FGBTA), considering non-stationary setting. In the batch method, the algorithm first uses variable step size to allow for fine-grained exploration within the predicted value given by the multi-armed bandit (MAB) algorithm and uses the results of pseudo-matching to calculate the batch utility. Then, the batch size with higher utility is selected, and the exact maximum weight matching algorithm is used to obtain the allocation result within the batch. In order to cope with the non-stationary changes, we use the sliding window (SW) method to retain the latest batch utility and discard the historical information that is too far away, so as to finally achieve refined batching and adapt to temporal changes. In addition, we also take into account the benefits of requesters, workers, and the platform. Experiments on real data and synthetic data show that this method can accomplish the task assignment of spatial crowdsourcing effectively and can adapt to the non-stationary setting as soon as possible. This paper mainly focuses on the spatial crowdsourcing task of ride-hailing.
Publisher
MDPI AG
Subject
This website uses cookies to ensure you get the best experience on our website.