Browse > Article
http://dx.doi.org/10.6109/jkiice.2007.11.11.2072

An Implementation of $A^*$ Algorithm with Turn Heuristic for Enhancing the Straightness of a Path  

Moon, Dae-Jin (동서대학교 컴퓨터정보공학부)
Cho, Dae-Soo (동서대학교 컴퓨터정보공학부)
Abstract
In driving a car, u-turn or left turn makes the speed of car decrease considerably or require more waiting time at the cross for the traffic signal to turn green. A more straight path, therefore, is probably fester to arrive at the destination than zig-zaged path with same distance. Previous works related to the path navigation do not consider the straightness of the path. In this paper, we have proposed the path navigation algorithm with turn heuristic for enhancing the straightness of a path. We have implement the proposed algorithm and compared it with a traditional $A^*$ algorithm. The experimental result shows that the degree of the straightness of a path is enhanced by 30% and the navigation distance of a path is deceased by 3.3%.
Keywords
$A^*$;
Citations & Related Records
연도 인용수 순위
  • Reference
1 문대진, 조대수, '방향전환 최소화 기법을 적용한 계 층 경로 탐색 알고리즘', 한국해양정보통신학회 2007 춘계 종합학술대회, Vol.11, No.1, pp.323-326, 2007
2 이현섭, 김진덕, '고정 그리드 기반 가변 휴리스틱을 이용한 최적경로 탐색', 한국해양정보통신학회 2005 추계 종합학술대회, Vol.9, No.2, pp.137-141, 2005
3 G. R. Jagadeesh, T. Srikanthan, and K. H. Quek, 'Heuristic Techniques for Accelerating Hierarchical Routing on Road Networks', IEEE Trans. Intelligent Transportation Systems, Vol. 3, No 4, pp.301-309, 2002   DOI   ScienceOn
4 R. Jacob, M.V. Marathe, and K. Nigel, 'A computational study of routing algorithms realistic transportation networks,' presented at the Second Workshop on Algorithmic Engineering, NJ, 1998
5 'A* Pathfinding for Beginners', http://www.gamedev.net/reference/programming/features/astar/
6 H. A. Karimi, 'Real-time optimal route computation: a heuristic approach,' ITS J., vol. 3, no. 2, pp. 111-127, 1996
7 Peter E. Hart, Nils J. Nilsson and Bertram Raphael, 'A Formal Basis for the Heuristic Determination of Minimum Cost Paths in Graphs,' IEEE Trans. on Systems Science and Cybernetics, Vol. SSC-4, No. 2, pp 100-107, 1968