Towards obtaining all possible contacts-growing a polyhedron by its location uncertainty

This paper provides a general and exact method of growing a polyhedral object in three-dimensional Cartesian space to take into account its orientation and position uncertainties. The work is particularly motivated by the need for automatically recognizing contact situations among objects in spite of uncertainties. The technique of growing surface elements of a polyhedron by uncertainty can be used to extract the set of all possible contact situations among polyhedral objects in the presence of location uncertainties, which can then serve as a basis for further and more accurate extraction of contact information by additional sensing means, such as vision and force/moment sensing.<<ETX>>

[1]  Josep Tornero,et al.  Efficient distance calculation using the spherically-extended polytope (S-tope) model , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.

[2]  Aristides A. G. Requicha,et al.  Toward a Theory of Geometric Tolerancing , 1983 .

[3]  Jing Xiao,et al.  Automatic verification of principal contacts using vision , 1993, Proceedings of 8th IEEE International Symposium on Intelligent Control.

[4]  Richard A. Volz,et al.  On replanning for assembly tasks using robots in the presence of uncertainties , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[5]  Tomás Lozano-Pérez,et al.  Spatial Planning: A Configuration Space Approach , 1983, IEEE Transactions on Computers.

[6]  Yasuyuki Funahashi,et al.  Parameter identification of contact conditions by active force sensing , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Chee Yap,et al.  Algorithmic motion planning , 1987 .

[8]  Ann Patricia Fothergill,et al.  Inferring the Positions of Bodies from Specified Spatial Relationships , 1974, Artif. Intell..

[9]  Christian Laugier,et al.  Planning fine motion strategies by reasoning in the contact space , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[10]  Michael Spreng.  Dealing with unexpected situations during the execution of robot motions , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[11]  S. Sathiya Keerthi,et al.  A fast procedure for computing the distance between complex objects in three-dimensional space , 1988, IEEE J. Robotics Autom..

[12]  Rajiv S. Desai,et al.  Identification and verification of termination conditions in fine motion in presence of sensor errors and geometric uncertainties , 1989, Proceedings, 1989 International Conference on Robotics and Automation.

[13]  Katsushi Ikeuchi,et al.  Toward an assembly plan from observation. I. Task recognition with polyhedral objects , 1994, IEEE Trans. Robotics Autom..

[14]  K. Sridharan,et al.  Algorithms for rapid computation of some distance functions between objects for path planning , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[15]  John W. Boyse,et al.  Interference detection among solids and surfaces , 1979, CACM.

[16]  Jing Xiao,et al.  A general strategy to determine geometrically valid contact formations from possible contact primitives , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.

[17]  Shahram Payandeh,et al.  Contact prediction and reasoning for compliant robot motions , 1989, IEEE Trans. Robotics Autom..

[18]  Elmer G. Gilbert,et al.  Computing the distance between general convex objects in three-dimensional space , 1990, IEEE Trans. Robotics Autom..

[19]  Jing Xiao,et al.  Replanning with compliant rotations in the presence of uncertainties , 1992, Proceedings of the 1992 IEEE International Symposium on Intelligent Control.

[20]  Robert H. Sturges,et al.  A Three-Dimensional Assembly Task Quantification with Application to Machine Dexterity , 1988, Int. J. Robotics Res..

[21]  Carme Torras,et al.  Interference detection between non-convex polyhedra revisited with a practical aim , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[22]  Tomás Lozano-Pérez,et al.  An algorithm for planning collision-free paths among polyhedral obstacles , 1979, CACM.

[23]  Jeffrey C. Trinkle,et al.  On the algebraic geometry of contact formation cells for systems of polygons , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.