Automatic generation of goal regions for assembly tasks in the presence of uncertainty

A systematic procedure for generating the goal region of a mating action from a CAD model of assemblies using the mating features and the constraint types residing in the model, is presented. Assuming convexity and similarity of mating features, an analytical solution for C-space interior is developed and used to construct the goal region from 2-D features. This method provides a well-defined goal region which allows the computation of the corresponding success probability. Due to the uncertainties in object representation, goal regions are also subject to uncertainties. An approach that shrinks the nominal boundary of a goal region is proposed for computing the expectation of success probabilities. The effects of interference and fine-motion planning on success probabilities are also taken into consideration in order to define theoretical goal regions.<<ETX>>

[1]  Wynne Hsu,et al.  Automatic generation of goal regions for assembly tasks in the presence of uncertainty , 1996, IEEE Trans. Robotics Autom..

[2]  Russell H. Taylor,et al.  Automatic Synthesis of Fine-Motion Strategies for Robots , 1984 .

[3]  Michael A. Erdmann,et al.  Using Backprojections for Fine Motion Planning with Uncertainty , 1985, Proceedings. 1985 IEEE International Conference on Robotics and Automation.

[4]  C. S. George Lee,et al.  Uncertainty manipulation and propagation and verification of applicability of actions in assembly tasks , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[5]  Leonard S. Haynes,et al.  Robotic assembly by constraints , 1986, Proceedings. 1987 IEEE International Conference on Robotics and Automation.

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