Skip to main content
SpringerLink
Log in

Liaison concatenation – A method to obtain feasible assembly sequences from 3D-CAD product

  • Published:
Sadhana Aims and scope Submit manuscript

Abstract

Selection of optimized assembly sequence from the available feasible assembly sequences is significantly essential to achieve cost-effective manufacturing process. To achieve this, at the outset, generation of feasible assembly sequences with topological, geometrical, precedence and stability conditions should be generated. The increase of part count in a product results huge number of assembly sequences, the Liaison matrix/Liaison graph generated based on the connections between the assembly components eliminates non-possible assembly sequences at the initial phase. There exist methods namely cut-set method to eliminate the non-possible assembly sequences using liaison graph. In this paper a new approach to eliminate the non-possible assembly sequences based on liaisons is described and the correctness of the methodology is illustrated with an example. The methodology to obtain the feasible assembly sequences is also briefly described and presented. An algorithm to interface with the CAD environment is described briefly.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8

Similar content being viewed by others

References

  1. Homem de Mello L S and Sanderson A C 1986 AND/OR graph representation of assembly plans. In: Proceedings AAAI-86 Fifth National Conference on Artificial Intelligence, American Association for Artificial Intelligence, Morgan Kaufmann Publishers, 1113–1119

  2. Homem de Mello L S and Sanderson A C 1988a Automatic generation of mechanical assembly sequences. Technical Report, CMU-RI-TR-88-19, The Robotics Institute, Carnegie-Mellon University

  3. Homem de Mello L S and Sanderson A C 1988b Task sequence planning for assembly. In: IMACS World Congress ’88 on Scientific Computation, Paris

  4. Bourjault A 1984 Contribution a uneApprocheMethodologique de L’AssemblageAutomatise: Elaboration Automatique des Sequences Operatoires (“Contribution to the Methodology of Automated Assembly: Automatic Generation of Operations Sequences”), Ph.D. thesis, Université de Franche-Comté, Besançon, France (in French)

  5. De Fazio T L and Whitney D E 1987 Simplified generation of all mechanical assembly sequences. IEEE J. Robotics Autom. 3 (6): 640–658

    Article  Google Scholar 

  6. Dini G and Santochi M 1992 Automated sequencing and subassembly detection in assembly planning. CIRP Annals – Manuf. Technol. 41 (1): 1–4

    Article  Google Scholar 

  7. Homem de Mello L S 1991 A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans. Robotics Autom. 7 (2): 228–240

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Industrial Design, National Institute of Technology, Rourkela, 769008, India

    M V A RAJU BAHUBALENDRUNI & BIBHUTI BHUSAN BISWAL

Authors
  1. M V A RAJU BAHUBALENDRUNI
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. BIBHUTI BHUSAN BISWAL
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to M V A RAJU BAHUBALENDRUNI.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

RAJU BAHUBALENDRUNI, M.V.A., BISWAL, B.B. Liaison concatenation – A method to obtain feasible assembly sequences from 3D-CAD product. Sadhana 41, 67–74 (2016). https://doi.org/10.1007/s12046-015-0453-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12046-015-0453-8

Keywords

Search

Navigation