A simple and efficient planning of robot motions with obstacle avoidance

장애물이 있는 경우의 효율적인 로보트 동자계획

This paper deals with the efficient planning of robot motions in the Cartesian space while avoiding the collision with obstacles. The motion planning problem is to find a path from the specified starting robot configuration that avoids collision with a known set of stationary obstacles. A simple and efficient algorithm was developed using "Backward" approach to solve this problem. The computational result was satisfactory enough to real problems. problems.