Abstract
Emerging spatial crowdsourcing platforms enable the workers (i.e., crowd) to complete spatial crowdsourcing tasks (like taking photos, conducting citizen journalism) that are associated with rewards and tagged with both time and location features. In this paper, we study the problem of online recommending an optimal route for a crowdsourcing worker, such that he can (i) reach his destination on time and (ii) receive the maximum reward from tasks along the route. We show that no optimal online algorithm exists in this problem. Therefore, we propose several heuristics, and powerful pruning rules to speed up our methods. Experimental results on real datasets show that our proposed heuristics are very efficient, and return routes that contain 82–91 % of the optimal reward.
The research is partly supported by grant GRF 152201/14E from Hong Kong RGC.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
- 4.
The reward of a task can be collected by the same worker for only once. Similar to [10], we assume that each task has a unit reward and can be completed immediately.
- 5.
Our method can be applied to any distance function provided that it satisfies the triangle inequality, such as Euclidean distance, Manhattan distance, and road network distance.
- 6.
Available tasks are tasks released before the current time \(t_{now}\).
- 7.
- 8.
For each location with only one check-in item (say, at time t), we choose its deadline randomly in \([t, t^+_q]\), where \(t_q^+\) refers to the query’s deadline.
- 9.
As mentioned in Definition 4, \(R_{opt}(q)\) is obtained with assumption that all tasks’ information are known in advance at time \(t_q^-\). With this assumption, OnlineRR becomes a special case of SnapshotRR where tasks can have release time larger than \(t_q^-\) and the approach for SnapshotRR can be used to find \(R_{opt}(q)\) then.
References
Allahverdi, A., Ng, C.T., Cheng, T.C.E., Kovalyov, M.Y.: A survey of scheduling problems with setup times or costs. Eur. J. Oper. Res. 187, 985–1032 (2008)
Allan, B., Ran, E.-Y.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)
Alt, F., Shirazi, A.S., Schmidt, A., Kramer, U., Nawaz, Z.: Location-based crowdsourcing: extending crowdsourcing to the real world. In: NordiCHI, pp. 13–22 (2010)
Ausiello, G., Feuerstein, E., Leonardi, S., Stougie, L., Talamo, M.: Algorithms for the on-line travelling salesman. Algorithmica 29, 560–581 (2001)
Bansal, N., Blum, A., Chawla, S., Meyerson, A.: Approximation algorithms for deadline-tsp and vehicle routing with time-windows. In: Symposium on Theory of, Computing, pp. 166–174 (2004)
Blom, M., Krumke, S.O., Paepe, W.E.D., Stougie, L.: The online tsp against fair adversaries. INFORMS J. Comput. 13, 138–148 (2001)
Bulut, M.F., Yilmaz, Y.S., Demirbas, M.: Crowdsourcing location-based queries. In: PERCOM Workshops, pp. 513–518 (2011)
Chekuri, C., Korula, N.: Approximation algorithms for orienteering with time windows. CoRR (2007)
Chen, Z., Fu, R., Zhao, Z., Liu, Z., Xia, L., Chen, L., Cheng, P., Cao, C.C., Tong, Y., Zhang, C.J.: gmission: A general spatial crowdsourcing platform. In: PVLDB, pp. 1629–1632 (2014)
Deng, D., Shahabi, C., Demiryurek, U.: Maximizing the number of worker’s self-selected tasks in spatial crowdsourcing. In: SIGSPATIAL, pp. 314–323 (2013)
Eiselt, H.A., Gendreau, M., Laporte, G.: Location of facilities on a network subject to a single-edge failure. Networks 22, 231–246 (1992)
Frederickson, G.N., Wittman, B.: Approximation algorithms for the traveling repairman and speeding deliveryman problems. Algorithmica 62, 1198–1221 (2012)
Gavalas, D., Konstantopoulos, C., Mastakas, K., Pantziou, G.E.: A survey on algorithmic approaches for solving tourist trip design problems. J. Heuristics 20, 291–328 (2014)
Jaillet, P., Wagner, M.R.: Online routing problems: value of advanced information as improved competitive ratios. Transp. Sci. 40, 200–210 (2006)
Kazemi, L., Shahabi, C.: Geocrowd: enabling query answering with spatial crowdsourcing. In: SIGSPATIAL, ppp. 189–198 (2012)
Kazemi, L., Shahabi, C., Chen, L.: Geotrucrowd: trustworthy query answering with spatial crowdsourcing. In: SIGSPATIAL, pp. 304–313 (2013)
Li, F., Cheng, D., Hadjieleftheriou, M., Kollios, G., Teng, S.-H.: On trip planning queries in spatial databases. In: Medeiros, C.B., Egenhofer, M., Bertino, E. (eds.) SSTD 2005. LNCS, vol. 3633, pp. 273–290. Springer, Heidelberg (2005)
Pournajaf, L., Xiong, L., Sunderam, V.S., Goryczka, S.: Spatial task assignment for crowd sensing with cloaked locations. In: MDM, pp. 73–82 (2014)
Righini, G., Salani, M.: Decremental state space relaxation strategies and initialization heuristics for solving the orienteering problem with time windows with dynamic programming. Comput. Oper. Res. 36, 1191–1203 (2009)
Rubinstein, R.Y., Kroese, D.P.: Simulation and the Monte Carlo method. Wiley, Hoboken (2011)
Sharifzadeh, M., Kolahdouzan, M.R., Shahabi, C.: The optimal sequenced route query. VLDB J. 17, 765–787 (2008)
To, H., Ghinita, G., Shahabi, C.: A framework for protecting worker location privacy in spatial crowdsourcing. In: PVLDB, pp. 919–930 (2014)
Vansteenwegen, P., Souffriau, W., Oudheusden, D.V.: The orienteering problem: a survey. Eur. J. Oper. Res. 209, 1–10 (2011)
Wen, X., Xu, Y., Zhang, H.: Online traveling salesman problem with deadlines and service flexibility. J. Comb. Optim. 1–18 (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, Y., Yiu, M.L., Xu, W. (2015). Oriented Online Route Recommendation for Spatial Crowdsourcing Task Workers. In: Claramunt, C., et al. Advances in Spatial and Temporal Databases. SSTD 2015. Lecture Notes in Computer Science(), vol 9239. Springer, Cham. https://doi.org/10.1007/978-3-319-22363-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-22363-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-22362-9
Online ISBN: 978-3-319-22363-6
eBook Packages: Computer ScienceComputer Science (R0)