Hostname: page-component-6898cfcb55-kwdml Total loading time: 0 Render date: 2026-11-11T16:57:29.320Z Has data issue: false hasContentIssue false

Inference on robotic assembly precedence constraints using a part contact level graph

Published online by Cambridge University Press:  09 March 2009

D. Y. Cho
Affiliation:
Department of Precision Eng. and Mechatronics, Korea Advanced Institute of Science and Technology, P.O. Box 201, Cheongryang, Seoul (Korea)
H. S. Cho
Affiliation:
Department of Precision Eng. and Mechatronics, Korea Advanced Institute of Science and Technology, P.O. Box 201, Cheongryang, Seoul (Korea)

Summary

This paper describes a new approach to the automatic generation of assembly precedence constraints for robotic assembly, using a part contact level graph. Since inference of precedence constraints is a prerequisite to generate assembly sequences of a product, much work has been done in this field. However, most of it has some limitations in that they use a cumbersome user query or time-consuming geometric reasoning. To cope with these problems, this paper utilizes three directional part contact level graphs which, in three orthogonal directions, contain the information on directional connections for each pair of mating parts. By using these graphs, an assembly precedence constraint is inferred in two steps: The first step infers a precedence constraint for each directional connection by applying the path-finding algorithm. Utilizing the precedence constraints thus obtained, the next step infers the precedence constraint for each part to be assembled with its base assembly. Examples are given to illustrate the concepts and procedure of the proposed scheme.

Information

Type
Research Article
Copyright
Copyright © Cambridge University Press 1993

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable