Abstract
In spatial crowdsourcing, mobile workers are recruited to perform special tasks related to location and time. The task assignment has been a focus of the research community due to its importance in spatial crowdsourcing. However, most of the existing efforts focus on optimizing the task requester’s goal and do not consider the requirements and constraints of workers. Unlike the existing methods, we consider task assignment comprising the goals of both the workers and the requesters, that is, the trade-off regarding the reward and travel cost of a worker and the delay of a task. We formulate the delay-sensitive task assignment (DSTA) problem that optimizes the combined goal of minimizing costs and maximizing rewards of a worker; meanwhile, reducing the delay to wait until the task is assigned. The DSTA algorithm based on greed idea (DSTA-G) is proposed to address the problem. To improve the efficiency, we introduce the Geohash algorithm and propose a new solution DSTA-GH, which is scalable to large-scale datasets. Moreover, the task assignment method that only considers the worker’s objective (TAW) is proposed as the baseline. Finally, extensive experiments offer evidence that DSTA and DSTA-GH outperform the baseline in terms of performance and DSTA-GH only takes about 0.03% of the CPU time as compared to DSTA-G.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.