This paper presents an algorithm for automatic planning of robot grasping motions that are insensitive to bounded uncer tainties in the object's location. The algorithm plans parallel- jaw grasping motions for arbitrary two-dimensional polygo nal objects, which need not be of uniform density. Grasping motions are viewed as parameterized operations, where the parameter values that describe an individual operation define an operation space of all possible operations. By combining an analysis of object geometry and the physics of friction, the planning algorithm divides the operation space into regions, where all operations within a given region produce the same final grasping configuration. Task uncertainties are then included by shrinking these regions by the amount of uncer tainty present. The smaller regions that remain after shrink ing indicate all those operations that will successfully result in a given grasping configuration, even if the worst-case combination of errors occurs. Moreover, the grasping operations presented in this paper intrinsically reduce task uncertainty. If an operation is cho sen from a region and executed, then two degrees of uncer tainty
📖 افتح في inklap 🔗 DOI 📮 اطلب بحثاً