Browse > Article

An Optimal Path Search Method based on Traffic Information for Telematics Terminals  

Kim, Jin-Deog (동의대학교 컴퓨터공학과)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.10, no.12, 2006 , pp. 2221-2229 More about this Journal
Abstract
Optimal path search algorithm which is a killer application of mobile device to utilize location information should consider traffic flows of the roads as well as the distance between a departure and destination. The existing path search algorithms, however, are net able to cope efficiently with the change of the traffic flows. In this paper, we propose a new optimal path search algorithm. The algorithm takes the current flows into consideration in order to reduce the cost to get destination. It decomposes the road network into Fixed Grid to get variable heuristics. We also carry out the experiments with Dijkstra and Ar algorithm in terms of the execution time, the number of node accesses and the accuracy of path. The results obtained from the experimental tests show the proposed algorithm outperforms the others. The algorithm is highly expected to be useful in a advanced telematics systems.
Keywords
모바일 단말기;텔레매틱스;최적경로탐색;고정그리드;
Citations & Related Records
연도 인용수 순위
  • Reference
1 Peter E. Hart, Nils J.Nilsson, Bertram Raphael, 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs' IEEE Trans. on Systems Science and Cybernetics, Vol. SSC4, No.2, pp 100-107, 1968
2 E.W.Dijkstr, 'A note on two problems in connection with graphs', Numerische Mathematik, Vol. 1, pp. 260-271,1959
3 이세일, '타일맵에서 A 알고리즘을 이용한 유닛들의 길 찾기 방법 제안' 한국컴퓨터정보학회 논문지, Vol. 9 No.3 ,pp. 71-77
4 이현섭, 안준환, 김진덕, '교통정보 기반 취적 알고리즘', 한국 해양정보통신학회 2004 추계 종합학술대회, Vol.8, No.2, pp. 425-428, 2004
5 Woo Young Kwon, Sanghoon Lee, II Hong Suh, 'A reinforcement learning approach involving a shortest path finding algorithm' Proc. of Int. Conf. Intelligent Robots and Systems 2003, Vol. 7, 2003
6 Chang Wook Ahn R. S. Ramakrishnan, 'A Genetic Algorithm for Shortest Path Routing Problem and the Sizing of Populations', IEEE Transaction on Evolutionary Computation, Vol.6, pp. 566-579,2002   DOI   ScienceOn
7 http://visionjoy.co.kr
8 http://theory.stanford.edu/-amitp/Game Programming
9 H. Kaindl, G. Kainz, 'Bidirectional Heuristic Search Reconsidered', Journal of Artificial Intelligence Research, Vol.7, pp.283-317, 1997
10 Stefano Pallottino, Maria Grazia Scutella, 'Shortest Path Algorithms in Transportation Models : Classical and Innovative Aspects', TR, Dniv. of Pisa, 1998
11 http://inavi.co.kr
12 이현섭, 김진덕, '고정 그리드 기반 가변 휴리스틱을 이용한 최적경로 탐색', 한국해양정보통신학회 2005 추계 종합학술대회, Vol. 9, No.2, pp.137-141, 2005
13 J. Mostow, A. Prieditis, 'Discovering Admissible Heuristics by Abstracting and Optimizing: A Transformational Approach,' International Conference on Artificial Intelligence, pp.701-707, 1989
14 http://qnavi.bizemeka.com
15 htp:/Idrive.nate.com
16 Stephan Winter, 'Modeling Costs of Truns in Route Planning', GeoInfonmtica, Vol. 6, No.4, pp. 345-360,2002