Automatic Generation of Mechanical Assembly Sequences

Abstract

This paper presents an algorithm for the generation of mechanical assembly sequences and a proof of its correctness and completeness. The algorithm employs a relational model of assemblies. In addition to the geometry of the assembly, this model includes a representation of the attachments that bind one part to another. The problem of generating the assembly sequences is transformed into the problem of generating disassembly sequences in which the disassembly tasks are the inverse of feasible assembly tasks. This transformation leads to a decomposition approach in which the problem of dissassembling one assembly is decomposed into distinct subproblems, each being to disassemble one subassembly. It is assumed that exactly two parts or subassemblies are joined at each time, and that whenever parts are joined forming a subassembly, all contacts between the parts in the subassembly are established. Mechanical assembly sequences, Disassembly sequences.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 01, 1988
Accession Number
ADA204234

Entities

People

  • A. C. Sanderson
  • L. S. Homem De Mello

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • Air Platforms
  • Autonomy

DTIC Thesaurus Topics

  • Algorithms
  • Artificial Intelligence
  • Assembly
  • Composite Materials
  • Computational Complexity
  • Computations
  • Computer Programming
  • Computer Programs
  • Computers
  • Disassembly
  • Engineers
  • Geometry
  • Jet Propulsion
  • Joining
  • Relational Database Management Systems
  • Robots
  • Systems Engineering

Readers

  • Mathematical Modeling and Probability Theory.
  • Software Engineering