A global collision-free path planning using parametric parabola through Geometry Mapping of obstacles in robot work space
In this paper, a new algorithm for palnning collision-free path connecting from start to target point is developed using Bézier curve of order two. The control point, i. e. the mid-point of quadratic Bézier curve, determines the shape of parabola and constitutes the Control Point Space, and this process is difined a Geometry Mapping. After Geometry Mapping of all obstacles, the clear area of CPS, an area not occupied by obstacle images, identifies collision-free path. The path planning algorithm, heance, transform path planning problem in Euclidian Space to point selection problem in CPS. The calculations involved in the algorithm do not require iterative procedures and all the formulas of the solution are derived in closed form. A CPS completely filled with obstacle images indicates that path planning based on parabola is not possible and requires higher order curve with more than one control point.
Key WordsRobot Path Planning Geometry Mapping Robot Task Planning Collision Avoidance
- Bézier, P., 1972,Numerical Control-Mathematics and Application, Translated by Forrest A. R. and Pankhurst, A. F., Wiley John & Sons, New York.Google Scholar
- Khosla, P. and Volpe, R., 1988, “Superquadric Artificial Potential for Obstacle Avoidance and Approach,”IEEE Proc. Int. Conf. on Robotics and Automation, Philadelphia, pp. 1778–1784.Google Scholar
- Namgung, Ihn, 1989, “Planning Collision-Free Paths with Applications to Robot Manipulators,” Ph. D. Dissertation, University of Florida.Google Scholar
- Volpe, R. and Khosla, P., 1987, “Artificial Potentials with Elliptical Isopotential Contours for Obstacle Avoidance,”IEEE Proc. 26th Conf. Decision and Control, Los Angeles, pp. 180–185Google Scholar