Tangency-Based Algorithm for Robot Path Planning

This paper proposes a new algorithm for robot path planning. The algorithm uses image contour to compute the tangency of an obstacle. In order to get the tangency and the shortest path, contour list and tangency stack are used to design the recursion function. This idea can greatly reduce the complexity of the computation and thus result in simple programming. The experiments have proved that this design can be used in robot path planning.