Journal of the Korea Institute of Information and Communication Engineering (한국정보통신학회논문지)

The Korea Institute of Information and Commucation Engineering (한국정보통신학회)
권호 표지
DOI QR코드

DOI QR Code

VTA* Algorithm: A* Path-Finding Algorithm using Variable Turn Heuristic

VTA* 알고리즘: 가변적인 턴 휴리스틱을 적용한 A* 경로탐색 알고리즘

  • 김지수 (동서대학교 컴퓨터정보공학부) ;
  • 조대수 (동서대학교 컴퓨터정보공학부)
  • Received : 2009.10.13
  • Accepted : 2010.01.13
  • Published : 2010.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

In driving a car, turns such as left turns, right turns, or u-turns, make the speed of the car decrease considerably. A more straight path, therefore, is probably faster to arrive at the destination than zig-zag path with same distance. In this paper, we have newly proposed the turn heuristic to make more straight path. The path navigation algorithm with turn heuristic(called as TA* algorithm) could enhance the straightness of a path by putting the turned-edges to the turn cost. It requires higher cost to use TA* algorithm than traditional A* algorithm because the straight-edge first searching have increased the search space. We have improved the TA* algorithm into the variable TA* algorithm(called as VTA* algorithm) which adopt the turn-heuristic during the a portion of the whole path.

차량을 타고 이동할 경우 좌회전, 우회전, U턴 등의 방향 전환은 차량의 속력 감소의 주요한 요인이 된다. 즉, 같은 거리를 이동할 경우 방향전환이 잦은 경로보다 직진 구간이 많은 경로가 보다 빨리 목적지에 도착할 수 있다. 이 논문에서는 직진성이 높은 경로를 탐색하기 위해서 방향전환비용을 고려한 턴 휴리스틱과 이률 적용한 경로탐색 알고리즘(TA* 알고리즘)을 제안한다. 또한 TA* 알고리즘의 탐색비용을 개선하기 위해서 일부 구간에서만 턴 휴리스틱을 적용하는 가변적인 턴 휴리스틱(VTA* 알고리즘)을 제안한다.

Keywords

References

  1. 이현섭, 김진덕, "고정 그리드 기반 가변 휴리스틱을 이용한 최적경로 탐색," 한국해양정보통신학회 2005 추계 종합학술대회, Vol.9, No.2, pp.137-141,2005
  2. T. A. Yang, S. Shekhar, B. Hamidzadeh and P. A. Hancock, "Path planning and evaluation in IVHS databases,"VNIS, pp.283-290, 1991
  3. R. Agrawal and H.V. Jagadish, "Materialization and Incremental Update of Path Information," Proc. Fifth Int'l Conf. Data Eng., pp. 374-383, 1989.
  4. Y.-W. Huang, N. Jing and E. A. Rundensteiner, "A Semi-Materialized View Approach for Route Guidance in Intelligent Vehicle Highway Systems," Pro. Second ACM Workshop Geographic Information System, pp.144-151,1994
  5. Y.-W. Huang, N. Jing and E. A. Rundensteiner, "Hierarchical Encoded Path Views for Path Query Processing: An Optimal Model and Its Performance Evaluation," IEEE Trans. Knowledge and Data Eng., Vol. 10, No.3, pp.409-432, 1998 https://doi.org/10.1109/69.687976
  6. E. W. Dijkstra, "A note on two problems in connection with graphs," Numerische Mathematik, Vol. 1, pp.260-271, 1959
  7. R. Goldman, N. Shivakumar, S. Venkatasubramanian and H. Garcia-Molina, "Proximity Search in Databases," VLDB, 1998
  8. S. Jung and S. Pramanik, "An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps," IEEE Trans. Knowledge and Data Eng., Vol. 14, No.5, pp.1029-1046, 2002 https://doi.org/10.1109/TKDE.2002.1033772