Pseudo minimuym translational distance between convex polyhedra (II)

摘要

By using the pseudo minimum translational distyrance between convex objects, this paper presents two algorithms for robot path planning. First, an analytically tractable potential field is defined in the robot configuration space, and the concept of virtual obstacles is introduced and incoproorated in the path planner to handle the local minima of the potential function.