DOI QR코드

DOI QR Code

A Speed-Based Dijkstra Algorithm for the Line Tracer Control of a Robot

로봇 경로 제어를 위한 속도기반 Dijkstra 알고리즘

  • 천성권 (가톨릭상지대학 중국비지니스정보과) ;
  • 김근덕 (영남대학교 공과대학 컴퓨터공학과) ;
  • 김종근 (영남대학교 공과대학 컴퓨터공학과)
  • Received : 2011.07.22
  • Accepted : 2011.10.02
  • Published : 2011.12.31

Abstract

A robot education system by emulation based on Web can be efficiently used for understanding concept of robot assembly practice and control mechanism of robot by control programming. It is important to predict the path of the line tracer robot which has to be decided by the robot. Shortest Path Algorithm is a well known algorithm which searches the most efficient path between the start node and the end node. There are two related typical algorithms. Dijkstra Algorithm searches the shortest path tree from a node to the rest of the other nodes. $A^*$ Algorithm searches the shortest paths among all nodes. The delay time caused by turning the direction of navigation for the line tracer robot at the crossroads can give big differences to the travel time of the robot. So we need an efficient path determine algorithm which can solve this problem. Thus, It is necessary to analyze the overhead of changing direction of robot at multi-linked node to determine the next direction for efficient routings. In this paper, we reflect the real delay time of directional changing from the real robot. A speed based Dijkstra algorithm is proposed and compared with the previous ones to analyze the performance.

Keywords

References

  1. 심충섭, 김진석, "One-to-One 최단경로 알고리즘의 성능 평가", 정보과학회논문지, 제29권, 제11호(2002), pp.634-639.
  2. 민근홍 외, "신호 교차로에서 방향별 지체를 고려한 최적경로탐색 연구",「한국ITS학회 논문지, 제9권, 제3호(2010), pp.12-19.
  3. 김근덕 외, "웹 기반 로봇제어 교육 시스템", 한국정보과학회 학술심포지엄논문집, 제4권, 제1호(2010), pp.35-39.
  4. 김용민, 최인찬, "로봇을 위한 위치 인식 및 경로 안내 시스템에 관한 연구", 전자공학회논문지, 제29권, 제1호(2010), pp.12-21.
  5. Zhipeng Liu, "A Study of Routing Protocols for Ad Hoc Networks", Yeungnam University, Masters of Engineering, 2008.
  6. Hart, P. E., N. J. Nilsson, and B. 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(1968), pp.100-107.
  7. Dijkstra, E. W., "A Note on Two Prooblems in connexion with Graphs", Numerische Mathematik, Vol.1(1959), pp.269-271. https://doi.org/10.1007/BF01386390
  8. Cherkassky, B. V., A. V. Goldberg, and T. Redzik, "Shortest Paths Algorithms : Theory and Experimental Evaluation", Mathematical Programming, Vol.73, No.2(1996), pp.129-174. https://doi.org/10.1007/BF02592101