Browse > Article

An Approximate Shortest Path Re-Computation Method for Digital Road Map Databases in Mobile Computing Environments  

김재훈 (LG전자)
정성원 (서강대학교 컴퓨터학과)
박성용 (서강대학교 컴퓨터학과)
Abstract
One of commercial applications of mobile computing is ATIS(Advanced Traveler Information Systems) in ITS(Intelligent Transport Systems). In ATIS, a primary mobile computing task is to compute the shortest path from the current location to the destination. In this paper, we have studied the shortest path re-computation problem that arises in the DRGS(Dynamic Route Guidance System) in ATIS where the cost of topological digital road map is frequently updated as traffic condition changes dynamically. Previously suggested methods either re-compute the shortest path from scratch or re-compute the shortest path just between the two end nodes of the edge where the cost change occurs. However, these methods we trivial in that they do not intelligently utilize the previously computed shortest path information. In this paper, we propose an efficient approximate shortest path re-computation method based on the dynamic window scheme. The proposed method re-computes an approximate shortest path very quickly by utilizing the previously computed shortest path information. We first show the theoretical analysis of our methods and then present an in-depth experimental performance analysis by implementing it on grid graphs as well as a real digital road map.
Keywords
Mobile Computing; Digital Road Maps; Approximate Shortest Path; ITS; Grid;
Citations & Related Records
연도 인용수 순위
  • Reference
1 R. Agrawal and H. Iagadish, 'Algorithms for Searching Massive Graphs', In IEEE Transactions on Knowledge and Data Engineering, Vol. 6, No.2, pp. 225-238, April 1994   DOI   ScienceOn
2 B. Liu, S. Choo, S. Lok, S. Leong, S. Lee, F. Poon, and H. Tan, 'Integrating Case-Based Reasoning, Knowledge-Based Approach and Dijkstra Algorithm for Route Finding', Proc. Tenth Conf. Artificial Intelligence for Applications (CAIA '94), pp, 149-155, 1994   DOI
3 J. Shapiro, J. Waxman, and D. Nir, 'Level Graphs and Approximate Shortest Path Algorithms', In Networks, Vol. 22, pp. 691-717, 1992   DOI
4 T. Yang, S. Shekhar, B. Hamidzadeh, and P. Hancock, 'Path Planning and Evaluation in IVHS Databases', IEEE Int'l Conf. on Vehicle Navigation and Information Systems(VNIS IVHS), pp. 283-290, 1991
5 R. Goldman, N. Shivakumar, S. Venkstasubramanian, and H. Gracia-Molina, Search in Databases', In Proceedings VLDB Conference, pp. 26-37, 1998
6 R. Kung, E. Hanson, Y. Ioannnidis, T. Sellis, L. Shapiro, and M. Stonebraker, 'Heuristic Search in Data Base System', In Proc. 1st Int. Workshop Expert Database Systems, pp. 96-107, Oct. 1984
7 Y. Huang, N. Jing, and E. Rundensteiner, 'Hierarchical Path Views: A Model Based on Fragmentation and Transportation Road Types', In Proc. of the 3rd ACM Workshop on Geographic Information Systems, pp, 93-100, 1995
8 K. Ishikawa, M. Ogawa, S. Azume, and T. Ito, 'Map Navigation Software of the Electro Multivision of the '91 Toyota Soarer', In Int. Conf. on Vehicle Navigation and Information Systems(VNIS IVHS), IEEE, (991) pp. 463-473
9 S. Jung and S. Pramanik, 'HiTi Graph Model of Topographical Road Maps in Navigation Systems', Proceedings of the 12th IEEE International Conference on Data Engineering, pp. 76-84, New Orleans, Louisiana, Feb. 1996   DOI
10 N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation', In IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No.3, pp. 409-432, May/June 1998   DOI   ScienceOn
11 T. Mohr and C. Pasche, 'A Parallel Shortest Path Algorithm', In Computing, Vol. 40, pp, 281-292, 1988   DOI
12 S. Shekhar, A. Kohli, and M. Coyle, 'Path Computation Algorithms for advanced Traveler Information System (ATIS)', In Proc. IEEE 9th Int'l Conf. Data engineering, pp. 31-39, 1993   DOI
13 N. Jing, Y. Huang, and E. Rundensteiner, 'Hierarchical Optimization of Optimal Path Finding for Transportation Applications', In Proc. of 5th Int'l Conf. on Information and Knowledge Management, pp. 261-268, 1996   DOI