Optimal Sequenced Route Query Algorithm Using Visited POI Graph

  • Htoo Htoo
  • Yutaka Ohsawa
  • Noboru Sonehara
  • Masao Sakauchi
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7418)

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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
  2. 2.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numeriche Mathematik 1, 269–271 (1959)MathSciNetMATHCrossRefGoogle Scholar
  3. 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. 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
  5. 5.
    Hart, P.E., Nilsson, N.J., Raphael, B.: A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics SSC-4(2), 100–107 (1968)CrossRefGoogle Scholar
  6. 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
  7. 7.
    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)CrossRefGoogle Scholar
  8. 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. 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. 10.
    Sharifzadeh, M., Kalahdouzan, M., Shahabi, C.: The optimal sequenced route query. Technical report, Computer Science Department, University of Southern California (2005)Google Scholar
  11. 11.
    Sharifzadeh, M., Kolahdouzan, M., Shahabi, C.: The optimal sequenced route query. The VLDB Journal 17, 765–787 (2008)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Htoo Htoo
    • 1
  • Yutaka Ohsawa
    • 1
  • Noboru Sonehara
    • 2
  • Masao Sakauchi
    • 2
  1. 1.Graduate School of Science and EngineeringSaitama UniversityJapan
  2. 2.National Institute of InformaticsJapan

Personalised recommendations