To rapidly feed industrial parts on an assembly line, Carlisle et. al. [7] proposed a flexible part feeding system that drops parts on a flat conveyor belt, determines position and orientation of each part with a vision system, and then moves them into a desired orientation. A robot arm with 4 degrees of freedom (DoF) is capable of moving parts through 6 DoF when equipped with a passive pivoting axis between the parallel jaws of its gripper. The idea is to grasp a part with 2 hard finger contacts such that it pivots, under gravity, into a desired orientation when lifted and replaced on the table. We refer to these actions as pivot grasps. This paper considers the planning problem. Given a polyhedral part shape, coefficient of friction and a pair of stable configurations as input, find pairs of grasp points that will cause the part to pivot from one stable configuration to the other. For some transitions, pivot grasps may not exist. For a part with n faces and m stable configurations, we give an O(m 2 n log n) algorithm to generate the m m matrix of pivot grasps. When the part is star shaped, this reduces to O(m 2 n). We also study a generalization that considers "capture regions" around stable configurations. Both algorithms are complete in that they are guaranteed to find pivot grasps when they exist.
Rao et al. REF give a planar analysis for picking up polyhedral parts using 2 hard point contacts with a pivoting bearing, allowing the part to pivot under gravity to rotate into a new configuration.
Complete Algorithms for Feeding Polyhedral Parts using Pivot Grasps
Mathematics Computer Science