무인 주행 차량의 주행 특성과 주행 시간을 고려한 경로 생성 및 주행 알고리즘
Path Planning for the Shortest Driving Time Considering UGV Driving Characteristic and Driving Time and Its Driving Algorithm
0
조회
0
다운로드
9
인용
0
참고문헌
키워드
초록
A* algorithm is a global path generation algorithm, and typically create a path using only the distance information. Therefore along the path, a moving vehicle is usually not be considered by driving characteristics. Deceleration at the corner is one of the driving characteristics of the vehicle. In this paper, considering this characteristic, a new evaluation function based path algorithm is proposed to decrease the number of driving path corner, in order to reduce the driving cost, such as driving time, fuel consumption and so on. Also the potential field method is applied for driving of UGV, which is robust against static and dynamic obstacle environment during following the generated path of the mobile robot under. The driving time and path following test was occurred by experiments based on a pseudo UGV, mobile robot in downscaled UGV’s maximum and driving speed in corner. The experiment results were confirmed that the driving time by the proposed algorithm was decreased comparing with the results from A* algorithm.
Abstract
A* algorithm is a global path generation algorithm, and typically create a path using only the distance information. Therefore along the path, a moving vehicle is usually not be considered by driving characteristics. Deceleration at the corner is one of the driving characteristics of the vehicle. In this paper, considering this characteristic, a new evaluation function based path algorithm is proposed to decrease the number of driving path corner, in order to reduce the driving cost, such as driving time, fuel consumption and so on. Also the potential field method is applied for driving of UGV, which is robust against static and dynamic obstacle environment during following the generated path of the mobile robot under. The driving time and path following test was occurred by experiments based on a pseudo UGV, mobile robot in downscaled UGV’s maximum and driving speed in corner. The experiment results were confirmed that the driving time by the proposed algorithm was decreased comparing with the results from A* algorithm.
참고문헌 (11)
- J. H. Lee, "Status and Prospects of Intelligent Autonomous vehicle contest", Korea Multimedia Society, 14(1), pp.31~41 (2010)
- O. Khatib, "Real-time Obstacle Avoidance for Manipulators and Mobile Robots", International Journal of Robotics Research, 5(1), pp.90~98 (1986)
- E. Rimon, "Exact robot navigation using artificial potential functions", IEEE Trans. On Robotics and Automation, 9(5), pp.501~518 (1992)
- M. G. Park, "Artificial Potential Field Based Path Planning for Mobile Robots Using a Virtual Obstacle Concept", 2003 IEEE, 2003, pp.2, 20~24
- Liu Chengqing, "Virtual Obstacle Concept for Local-minimum-recovery in Potential-field Based Navigation", 2000 IEEE International Conference on Robotics & Automation, 2, pp.983~988 (2000)
- M. H. Kim, "A Study of New Path Planning Algorithm using Extended A* Algorithm with Survivability", The 5th International Conference on Intelligent Robotics and Applications (2012)