Abstract
With the development of intelligent mobile devices and communication technology, moving objects have become a hot research topic. This paper studies the moving objects on the road network, and a dynamic shortest path query algorithm is proposed to solve the shortest path calculation between two moving objects on the road network. The algorithm is divided into pre-processing phase and query phase. The pre-processing phase pre-calculates and stores a small part of the shortest path according to the important positions of the road network and the pre-storage coefficient k. Then the pre-processing information is used to query the shortest path during the query process. Experiments are performed by using the road network data (nearly 200,000 segments) of Nanjing, including the setting of the pre-stored coefficient k, the pre-stored path size, and the road network size. The results show that the MOSP algorithm proposed in this paper outperforms baseline approaches by 2–3 orders of magnitude.
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
References
Hassan, M.S., Aref, W.G, Aly, A.M.: Graph indexing for shortest path finding over dynamic sub-graphs. In: SIGMOD, pp. 1183–1197 (2016)
Huang, B., Wu, Q., Zhan, F.B.: A shortest path algorithm with novel heuristics for dynamic transportation networks. Int. J. Geogr. Inf. Syst. 21(6), 625–644 (2007)
Goto, T., Kosaka, T., Noborio, H.: On the heuristics of A∗ or A algorithm in ITS and robot path-planning. In: IEEE/RSJ International Conference on Intelligent Robots & Systems. IEEE (2003)
Zhang, Z., Liu, J., Qiu, A., et al.: The shortest path approximation algorithm for large scale road network. Acta Geodaetica et Cartographica Sinica 48(1), 86–94 (2019)
Jing, N., Huang, Y.W., Rundensteiner, E.A.: Hierarchical optimization of optimal path finding for transportation applications. In: CIKM, vol. 96, pp. 12–16 (1996)
Lee, K.C.K, Lee, W.C., Zheng, B.: Fast object search on road networks. In: Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology, pp. 1018–1029. ACM (2009)
Zhong, R., Li, G., Tan, K.L., et al.: G-Tree: an efficient and scalable index for spatial search on road networks. IEEE Trans. Knowl. Data Eng. 27(8), 2175–2189 (2015)
Wang, J., Kai, Z., Jeung, H., et al.: Cost-efficient spatial network partitioning for distance-based query processing. In: MDM, vol. 1, pp. 13–22 (2014)
Delling, D., Goldberg, A.V., Pajor, T., Werneck, R.F.: Robust distance queries on massive networks. In: Schulz, A.S., Wagner, D. (eds.) Algorithms - ESA 2014. Lecture Notes in Computer Science, vol. 8737, pp. 321–333. Springer, Heidelberg (2014). https://doi.org/10.1007/978-3-662-44777-2_27
Jung, S., Pramanik, S.: An efficient path computation model for hierarchically structured topographical road maps. IEEE Trans. Knowl. Data Eng. 14(5), 1029–1046 (2002)
Bast, H., Funke, S., Matijevic, D., et al.: In transit to constant time shortest-path queries in road networks. In: Proceedings of the Meeting on Algorithm Engineering & Expermiments. Society for Industrial and Applied Mathematics, pp. 46–59 (2007)
Geisberger, R., Sanders, P., Schultes, D., Delling D.: Contraction hierarchies: faster and simpler hierarchical routing in road networks. In: McGeoch, C.C. (eds.) Experimental Algorithms. Lecture Notes in Computer Science. WEA 2008, vol. 5038, pp. 319–333. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-68552-4_24
Akiba, T., Iwata, Y., Kawarabayashi, K., et al.: Fast shortest-path distance queries on road networks by pruned highway labeling. In: 2014 Proceedings of the Sixteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, pp. 147–154 (2014)
Yin, X., Ding, Z., Li, J.: Moving continuous k nearest neighbor queries in spatial network databases. World Congr. Comput. Sci. Inf. Eng. 4, 535–541 (2009)
Zhu, C.J., Lam, K.Y., Cheng, R.C.K., et al.: On using broadcast index for efficient execution of shortest path continuous queries. Inf. Syst. 49, 142–162 (2015)
Shen, B., Zhao, Y., Li, G., et al.: V-tree: efficient kNN search on moving objects with road-network constraints. In: IEEE 33rd International Conference on Data Engineering (ICDE), pp. 609–620. IEEE (2017)
Zeberga, K., Jin, R., Cho, H.J., et al.: A safe-region approach to a moving k-RNN queries in a directed road network. J. Circ. Syst. Comput. 26(05), 1750071 (2017)
Cho, H.J., Kwon, S.J., Chung, T.S.: A safe exit algorithm for continuous nearest neighbor monitoring in road networks. Mob. Inf. Syst. 9(1), 37–53 (2013)
Acknowledgment
This work is supported by NSFC under grants 61972198, Natural Science Foundation of Jiangsu Province of China under grants BK20191273 and National Key Research and Development Plan of China (2018YFB1003902).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Chen, S., Xu, J. (2021). Dynamic Shortest Path Queries over Moving Objects on Road Networks. In: Meng, X., Xie, X., Yue, Y., Ding, Z. (eds) Spatial Data and Intelligence. SpatialDI 2020. Lecture Notes in Computer Science(), vol 12567. Springer, Cham. https://doi.org/10.1007/978-3-030-69873-7_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-69873-7_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69872-0
Online ISBN: 978-3-030-69873-7
eBook Packages: Computer ScienceComputer Science (R0)