Sub assemblies

IshanKossambe 728 views 22 slides Apr 16, 2014
Slide 1
Slide 1 of 22
Slide 1
1
Slide 2
2
Slide 3
3
Slide 4
4
Slide 5
5
Slide 6
6
Slide 7
7
Slide 8
8
Slide 9
9
Slide 10
10
Slide 11
11
Slide 12
12
Slide 13
13
Slide 14
14
Slide 15
15
Slide 16
16
Slide 17
17
Slide 18
18
Slide 19
19
Slide 20
20
Slide 21
21
Slide 22
22

About This Presentation

Automatic identification of Sub Assemblies in an assembly.


Slide Content

A utomatic I dentification o f S ub A ssembly i n a n A ssembly Ishan Kossambe

Content Introduction Literature review Methodology Implementation Conclusion

Introduction Assembly Need Objectives

Assembly Hierarchical process I nformation and complex relationships Consists of combination of sub assembly Better final assembly

Need Complex assembly = Number of subassembly Assembly planning Assembly cost Frequent changes in design Automatic Assembly planning

Objective Extracting information from computer database Building of liaisons Use of API of CAD Software Develop an algorithm

Literature Review Several papers have been published Most of the sub assembly detection techniques makes use of mathematical models Automation of subassembly detection Reducing human interference

Methodology Generation of database Development of Algorithm Implementation

Generation of Database Mating relations in the assembly are required to decide about the sub-assemblies Code is written which extracts the mating relations It is stored in the database

Algorithm start EXTRACT INFORMATION STORE IN DATABASE EXTRACT THE MATE INFORMATION AND NUMBER OF PARTS A

A DOES PART i HAS A MATE WITH PART j DOES PART j HAS A MATE WITH THE i UNSAVED PART COUNT DON’T COUNT B B COUNT=1 PART i AND SAVED j PARTS IS NOT A SUB ASSEMBLY SUB ASSEMBLY END DON’T SAVE REPEAT TILL i ≤ NUMBER OF PARTS REPEAT TILL j ≤ NUMBER OF PARTS SAVED NO YES YES NO YES NO

Implementation Crane Hook Assembly Extraction of mating relations using AME Algorithm Execution of Sub-assembly detection algorithm

Crane Hook Assembly

Extraction Of Mating Relations

Conclusion Reduction in number of parts to be handled during assembly. Assembly cost and time. Automation. Feasible sub-assembly detection.

Future Scope Validating assemblies . Feasible sub-assembly detection.

References J. L. Nevins and D. E. Whitney , “Concurrent design of product and processes,” McGraw-Hill, New York, 1989.   U. Rembold , C. Blume , and R. Dillmann , “Computer- integrated manufacturing technology and systems,” Mar- cel Dekker, New York, 1985.   S. S. F. Smith , “Using multiple genetic operators to re-duce premature convergence in genetic assembly plan- ning ,” Computers in Industry, Vol. 54, Iss . 1, pp. 35–49, May 2004.   E. Zussman , E. Lenz and M. Shpitalni , “An approach to the automatic assembly planning problem”, Annals CIRP, 39(1), pp. 33–36, 1990.   Dini , G.; Santochi , M ., “Automated sequencing and sub-assembly detection in assembly planning”, Annals of the CIRP, Vol.41, 1992.   Ong , N.S.; Wong, Y.C ., “Automatic Sub-assembly detection from a product Model for disassembly sequence generation”, International journal of Advanced Manufacturing technology, Vol.15, 1999, pp. 425-431.   Y.Z. Zhang, J. Ni, Z.Q. Lin, X.M. Lai , “Automated sequencing and sub-assembly detection in automobile body assembly planning”, Journal of Materials Processing Technology, 129 (2002) 490–494.   Arun Tom Mathew; C. S. P. Rao , “A Novel Method of Using API to Generate Liaison Relationships from an Assembly”, Journal of Software Engineering & Applications, 2010, 3: 167-175

Thank You