Optimal Sequenced Route Query Algorithm Using Visited POI Graph
Trip planning methods including the optimal sequenced route (OSR) query become a critical role to find the economical route for a trip in location based services and car navigation systems. OSR finds the shortest route, starting from an origin location and passing through a number of locations or points of interest (POIs), following the prespecified route sequence. This paper proposes a fast optimal sequenced route query algorithm from the current position to the destination by unidirectional and bidirectional searches adopting an A* algorithm. An OSR query on a road network tends to expand an extremely large number of nodes, which leads to an increase in processing time. To reduce the number of node expansions, we propose a visited POI graph (VPG) to register a single found path that connects neighboring POIs. By using a VPG, duplicated node expansions can be suppressed. We also perform experiments to show the effectiveness of our method compared with a conventional approach, in terms of the number of expanded nodes and processing time.
Unable to display preview. Download preview PDF.
- 1.Chen, H., Ku, W.S., Sun, M.T., Zimmermann, R.: The multi-rule partial sequenced route query. In: ACM GIS 2008, pp. 65–74 (2008)Google Scholar
- 3.Fujii, K., Htoo, H., Ohsawa, Y.: Fast optimal sequenced route query method by bi-directional search. Technical report, Technical Report of IEICE, ITS-2010-05 (2010) (in Japanese)Google Scholar
- 4.Guttman, A.: R-Trees: a dynamic index structure for spatial searching. In: Proc. ACM SIGMOD Conference on Management of Data, pp. 47–57 (1984)Google Scholar
- 6.Ikeda, T., Hsu, M.-Y., Imai, H., Shimoura, S.N.H., Hashimoto, T., Tenmoku, K., Mitoh, K.: A fast algorithm for finding better routes by AI search techniques. In: 1994 Vehicle Navigation & Information System Conference, pp. 291–296 (1994)Google Scholar
- 8.Ohsawa, Y., Fujino, K.: Simple trip planning algorithm on road networks without pre-computation. IEICE Transactions on Information and Systems J93-D(3), 203–210 (2010) (in Japanese)Google Scholar
- 9.Papadias, D., Zhang, J., Mamoulis, N., Tao, Y.: Query processing in spatial network databases. In: Proc. 29th VLDB, pp. 790–801 (2003)Google Scholar
- 10.Sharifzadeh, M., Kalahdouzan, M., Shahabi, C.: The optimal sequenced route query. Technical report, Computer Science Department, University of Southern California (2005)Google Scholar