Automatic assembly feature recognition and disassembly sequence generation

Sung, R. and Corney, J.R. and Clark, D. (2001) Automatic assembly feature recognition and disassembly sequence generation. Journal of Computing and Information Science in Engineering, 1 (4). pp. 291-299. ISSN 1530-9827 (http://dx.doi.org/10.1115/1.1429931)

Full text not available in this repository.Request a copy

Abstract

This paper describes a system for the automatic recognition of assembly features and the generation of disassembly sequences. The paper starts by reviewing the nature and use of assembly features. One of the conclusions drawn from this survey is that the majority of assembly features involve sets of spatially adjacent faces. Two principle types of adjacency relationships are identified and an algorithm is presented for identifying assembly features which arise from "spatial" and "contact" face adjacency relationships (known as s-adjacency and c-adjacency respectively). The algorithm uses an octree representation of a B-rep model to support the geometric reasoning required to locate assembly features on disjoint bodies. A pointerless octree representation is generated by recursively sub-dividing the assembly model's bounding box into octants which are used to locate: 1. Those portions of faces which are c-adjacent (i.e. they effectively touch within the tolerance of the octree). 2. Those portions of faces which are s-adjacent to a nominated face. The resulting system can locate and partition spatially adjacent faces in a wide range of situations and at different resolutions. The assembly features located are recorded as attributes in the B-rep model and are then used to generate a disassembly sequence plan for the assembly. This sequence plan is represented by a transition state tree which incorporates knowledge of the availability of feasible gripping features. By way of illustration, the algorithm is applied to several trial components.

CORE (COnnecting REpositories)