Abstract
Route planning and recommendation have received significant attention in recent years. In this light, we propose and investigate the novel problem of finding traffic-aware fastest paths (TAFP query) in spatial networks by considering the related traffic conditions. Given a sequence of user specified intended places O q and a departure time t, TAFP finds the fastest path connecting O q in order to guarantee that moving objects (e.g., travelers and bags) can arrive at the destination in time. This type of query is mainly motivated by indoor space applications, but is also applicable in outdoor space, and we believe that it may bring important benefits to users in many popular applications, such as tracking VIP bags in airports and recommending convenient routes to travelers. TAFP is challenged by two difficulties: (i) how to model the traffic awareness practically, and (ii) how to evaluate TAFP efficiently under different query settings. To overcome these challenges, we construct a traffic-aware spatial network G ta (V,E) by analysing uncertain trajectory data of moving objects. Based on G ta (V,E), two efficient algorithms are developed based on best-first and heuristic search strategies to evaluate TAFP query. The performance of TAFP has been verified by extensive experiments on real and synthetic spatial datasets.
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
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Ahuja, R.K., Orlin, J.B., Pallottino, S., Scutellà , M.G.: Dynamic shortest paths minimizing travel times and costs. Networks 41(4), 197–205 (2003)
Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. In: SODA, pp. 589–598 (2003)
Brakatsoulas, S., Pfoser, D., Salas, R., Wenk, C.: On map-matching vehicle tracking data. In: VLDB, pp. 853–864 (2005)
Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Math. 1, 269–271 (1959)
Ding, B., Yu, J.X., Qin, L.: Finding time-dependent shortest paths over large graphs. In: EDBT, pp. 205–216 (2008)
George, B., Kim, S., Shekhar, S.: Spatio-temporal network databases and routing algorithms: A summary of results. In: Papadias, D., Zhang, D., Kollios, G. (eds.) SSTD 2007. LNCS, vol. 4605, pp. 460–477. Springer, Heidelberg (2007)
Greenfeld, J.: Matching gps observations to locations on a digital map. In: 81th Annual Meeting of the Transportation Research Board (2002)
Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions on Systems Science and Cybernetics 4(2), 100–107 (1968)
Hua, M., Pei, J.: Probabilistic path queries in road networks: traffic uncertainty aware path selection. In: EDBT, pp. 347–358 (2010)
Jensen, C.S., Lu, H., Yang, B.: Graph model based indoor tracking. In: Mobile Data Management, pp. 122–131 (2009)
Jensen, C.S., Lu, H., Yang, B.: Indexing the trajectories of moving objects in symbolic indoor space. In: Mamoulis, N., Seidl, T., Pedersen, T.B., Torp, K., Assent, I. (eds.) SSTD 2009. LNCS, vol. 5644, pp. 208–227. Springer, Heidelberg (2009)
Liu, K., Deng, K., Ding, Z., Li, M., Zhou, X.: Moir/mt: Monitoring large-scale road network traffic in real-time. In: VLDB, pp. 1538–1541 (2009)
Muckell, J., Hwang, J.-H., Lawson, C., Ravi, S.: Algorithms for compressing gps trajectory data: An empirical evaluation. ACM GIS (2010)
Orda, A., Rom, R.: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length. J. ACM 37(3), 607–625 (1990)
Pfoser, D., Jensen, C.S.: Capturing the uncertainty of moving-object representations. In: Güting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol. 1651, p. 111. Springer, Heidelberg (1999)
Samet, H., Sankaranarayanan, J., Alborzi, H.: Scalable network distance browsing in spatial databases. In: Proceedings of SIGMOD, pp. 43–54 (2008)
Shang, S., Lu, H., Pedersen, T.B., Xie, X.: Modeling of traffic-aware travel time in spatial networks. In: MDM, 4 pages (2013)
Trajcevski, G., Tamassia, R., Ding, H., Scheuermann, P., Cruz, I.F.: Continuous probabilistic nearest-neighbor queries for uncertain trajectories. In: EDBT, pp. 874–885 (2009)
Trajcevski, G., Wolfson, O., Hinrichs, K., Chamberlain, S.: Managing uncertainty in moving objects databases. ACM Trans. Database Syst. 29(3), 463–507 (2004)
Wenk, C., Salas, R., Pfoser, D.: Addressing the need for map-matching speed: Localizing globalb curve-matching algorithms. In: SSDBM (2006)
Wolfson, O., Chamberlain, S., Dao, S., Jiang, L., Mendez, G.: Cost and imprecision in modeling the position of moving objects. In: ICDE, pp. 588–596 (1998)
Wolfson, O., Sistla, A.P., Chamberlain, S., Yesha, Y.: Updating and querying databases that track mobile units. Distributed and Parallel Databases 7(3), 257–387 (1999)
Yuan, J., Zheng, Y., Zhang, C., Xie, W., Xie, X., Sun, G., Huang, Y.: T-drive: driving directions based on taxi trajectories. In: GIS, pp. 99–108 (2010)
Zhang, M., Chen, S., Jensen, C.S., Ooi, B.C., Zhang, Z.: Effectively indexing uncertain moving objects for predictive queries. PVLDB 2(1), 1198–1209 (2009)
Zheng, K., Trajcevski, G., Zhou, X., Scheuermann, P.: Probabilistic range queries for uncertain trajectories on road networks. In: EDBT, pp. 283–294 (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shang, S., Lu, H., Pedersen, T.B., Xie, X. (2013). Finding Traffic-Aware Fastest Paths in Spatial Networks. In: Nascimento, M.A., et al. Advances in Spatial and Temporal Databases. SSTD 2013. Lecture Notes in Computer Science, vol 8098. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-40235-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-40235-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-40234-0
Online ISBN: 978-3-642-40235-7
eBook Packages: Computer ScienceComputer Science (R0)