A basic algorithm for the generation of mechanical assembly sequences

This chapter presents an algorithm for the generation of mechanical assembly sequences that is correct and complete. The algorithm takes a description of the assembly and returns the AND/OR graph representation of assembly sequences[10]. It is assumed that exactly two parts or subassemblies are joined at each time, and that after parts have been put together they remain together. It is also assumed that whenever parts are joined forming a subassembly, all contacts between the parts in that subassembly are established. Furthermore, it is assumed that the feasibility of joining two subassemblies is independent of how those subassemblies were built. These assumptions are consistent with the trend towards product designs that are suitable for automatic assembly[1,3].