Optimal Probing Strategies

Probing is a common operation employed to reduce the position uncertainty of objects. This paper demonstrates a technique for constructing provably near-optimal probing strategies for precisely localizing polygonal parts. This problem is shown to be dual to the well-studied grasping problem of computing optimal finger placements as defined by B. Mishra and others. A useful quality metric of any given probing strategy can easily be computed from simple geometric constructions in the displacement space of the polygon. The approach will always find a minimal set of probes that is guaranteed to be near optimal for constraining the position of the polygon. The size of the resulting set of probes is within O(1) of the optimal number of probes and can be computed in O(n log2 n) time, whereas the exact optimal solution is in NP-hard. The result of this work is a probing strategy useful in practice for refining part poses.

[1]  John F. Canny,et al.  Planning optimal grasps , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[2]  John F. Canny,et al.  Accurate insertion strategies using simple optical sensors , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[3]  Christos H. Papadimitriou,et al.  Optimum Grip of a Polygon , 1987, Int. J. Robotics Res..

[4]  Richard Cole,et al.  Shape from Probing , 1987, J. Algorithms.

[5]  Jean Ponce,et al.  On Computing Two-Finger Force-Closure Grasps of Curved 2D Objects , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[6]  John F. Canny,et al.  Planning for modular and hybrid fixtures , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Michael T. Goodrich,et al.  Almost optimal set covers in finite VC-dimension , 1995, Discret. Comput. Geom..

[8]  Jiawei Li,et al.  On Computing Three-Finger Force-Closure Grasps , 2003 .

[9]  Ben J Hicks,et al.  SPIE - The International Society for Optical Engineering , 2001 .

[10]  A. Bruckstein,et al.  Reconstructing a Convex Polygon from Binary Perspective Projections , 1989, The Sixteenth Conference of Electrical and Electronics Engineers in Israel,.

[11]  David P. Dobkin,et al.  Probing Convex Polytopes , 1990, Autonomous Robot Vehicles.

[12]  Yan-Bin Jia,et al.  The complexity of sensing by point sampling , 1995 .

[13]  Jirí Matousek.  Construction of ɛ-nets , 1990, Discret. Comput. Geom..

[14]  Aaron S. Wallack,et al.  Geometric matching algorithm for beam scanning , 1993, Other Conferences.

[15]  Vladimir Vapnik,et al.  Chervonenkis: On the uniform convergence of relative frequencies of events to their probabilities , 1971 .

[16]  Daniel E. Whitney,et al.  Computer-controlled Assembly , 1978 .

[17]  Mariette Yvinec,et al.  Probing a scene of non convex polyhedra , 1989, SCG '89.

[18]  John F. Canny,et al.  Easily computable optimum grasps in 2-D and 3-D , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[19]  Dinesh Manocha,et al.  Object localization using crossbeam sensing , 1993, [1993] Proceedings IEEE International Conference on Robotics and Automation.

[20]  Herbert J. Bernstein.  Determining the Shape of a Convex n-Sided Polygon by Using 2n+k Tactile Probes , 1986, Inf. Process. Lett..

[22]  Randy C. Brost,et al.  Automatic Grasp Planning in the Presence of Uncertainty , 1988, Int. J. Robotics Res..

[23]  Kenneth L. Clarkson,et al.  Algorithms for Polytope Covering and Approximation , 1993, WADS.

[24]  John F. Canny,et al.  "RISC" industrial robotics: recent results and open problems , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.