SHORTEST PATH FOR ROBOT CAR

  • 발행 : 1992.12.01

초록

In this paper, we consider the shortest path problem of a Robot car moving in a workspace which consists of some obstacles. The motion of the Robot car is considered to have initial and final directions with some restrictions in the curvature of the path. At first we consider the problem in the case of having no obstacles and we give an analytical solution. Then wre present an algorithm to find a feasible path in the case of having obstacles and a method to improve this feasible path into a minimal path. Some computational results using Graph theory and Linear programming have been included.

키워드