Name
Abstract | ||
|---|---|---|
With the proliferation of GPS-enabled smart devices and increased availability of wireless network, spatial crowdsourcing (SC) has been recently proposed as a framework to automatically request workers (i.e., smart device carriers) to perform location-sensitive tasks (e.g., taking scenic photos, reporting events). In this paper we study a destination-aware task assignment problem that concerns the optimal strategy of assigning each task to proper worker such that the total number of completed tasks can be maximized whilst all workers can reach their destinations before deadlines after performing assigned tasks. Finding the global optimal assignment turns out to be an intractable problem since it does not imply optimal assignment for individual worker. Observing that the task assignment dependency only exists amongst subsets of workers, we utilize tree-decomposition technique to separate workers into independent clusters and develop an efficient depth-first search algorithm with progressive bounds to prune non-promising assignments. Our empirical studies demonstrate that our proposed technique is quite effective and settle the problem nicely.
|
Year | DOI | Venue |
|---|---|---|
2017 | 10.1145/3132847.3132894 | CIKM |
Keywords | Field | DocType |
spatial crowdsourcing, spatial ask assignment, user mobility | Wireless network,Search algorithm,Smart device,Information retrieval,Computer science,Crowdsourcing,Assignment problem,Empirical research | Conference |
ISBN | Citations | PageRank |
978-1-4503-4918-5 | 9 | 0.55 |
References | Authors | |
15 | 5 | |