This research concerns a grasp-planning algorithm that is fast and capable of determining grasp points for planar nondegenerate objects. We use a novel representation of the target and a quadtree based sampling scheme to generate a set of candidate grasps which are evaluated using a cost function. This function returns the first acceptable grasp point it finds. The resulting system has an execution time of seconds and is suitable for a large number of planar grasp planning problems.
展开▼