The document presents a novel algorithm for automatically generating assembly sequences with minimal human interference. It extracts information like mating relations from CAD models and stores it in a database. The algorithm then selects the base component and sequentially assigns other components based on their relationships and collisions, outputting an assembly sequence. It was tested on a pulley assembly example. The results showed the algorithm could generate feasible assembly sequences faster than traditional expert-dependent methods.
6. • Hierarchical process
• Information and complex
relationships
• Consists of combination of
sub assembly
• Assembly accounts for 50%
of manufacturing cost
Assembly
7. Need
• Complex assembly = Number
of subassembly
• Assembly planning
• Assembly cost
• Frequent changes in design
• Automatic Assembly planning
9. • Several papers have been published
• Several types of Assembly sequence
generation techniques have been formulated
• Automation of Assembly sequence generation
• Reducing human interference
Literature review
10. • Algorithm based on a mathematical model
based on product development processDemoly
• Relational model for assembly based on
disassemblyLuiz S. Homem
• Disassembly analysis (stability, fixturing,
orientation, refixturing and reorientation count)Daniel F. Baldwin
• Using haptic information in virtual
environmentsJungwon Yoon
• Assembly system design, planning and
operations in the presence of product varietyS.J. Hu
• Chaotic particle swarm optimization (stability,
assembly time and assembly cost)Y. Wang
11. • Several optimization techniques used are
mathematical models, disassembly, stability
and product development .
• Predominantly done manually
• Need to develop better Optimization
technique
Outcomes
13. • Commercial systems available make use
expert assembly sequence planner
• Requires more time and expert knowledge
• Assembly sequence plans generated may not
even be the most efficient.
Problem statement
14. • Extracting information from computer
database
• Building of liaisons
• Use of API of CAD Software
• Develop an algorithm
Objective
16. 1. Generation of database
2. Development of Algorithm
3. Implementation
Methodology
17. • Mating relations in the assembly are required
to compute the feasible assembly sequence
• Code is written which extracts the mating
relations
• It is stored in the database
Generation of Database
20. Select the Base
Component
Select an
unassigned
Component
Check the
Component
Relationship
Check for
Collision
Check all
components have
been assigned
NO
YES
NO
NO
YES
Assembly Sequence
Generation
Finish
24. PART RANK
Hook 1
Pulley 2
Cross Head Block 3
Thrust Bearing 4
Cover Plate 5
Pulley Pin 6
Bush 7
Lock Plate 8
Dust Cover 9
Volume Matrix
25. Part Name Direction to be assembled
Hook Y
Cross Head Block Y
Thrust Bearing Y
Dust Cover Y
Pulley X
Pulley Pin X
Bush-1 X
Bush-2 X
Cover plate-2 X
Lock Plate-4 Z
Lock Plate-3 Z
Cover Plate-1 X
Lock Plate-2 Z
Lock Plate-1 Z
User Input
27. Ranking
• If two parts passes the test then we select one
part based on the below equation
Score (i) = (X*2) + (Y *1)
Where
X= Rank based on Mate Matrix
Y= Rank based on Volume Matrix
Hook Pulley
Hook x 1
Pulley 0 x
30. Result & Discussion
• A new algorithm is developed to generate
feasible assembly sequence
• Various information of the assembly is
extracted and stored in proper database
(matrices)
• Output is a assembly sequence plan
• No human interference
• Reduction in time and hence money
31. REFRENCES
• 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.
32. REFRENCES
• 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
• Demoly a,n, Xiu-TianYan, “An assembly oriented design framework for
product structure engineering and assembly sequence planning “
journal of Robotics and Computer-Integrated Manufacturing 27 (2011)
33–46
33. REFRENCES
• Daniel F. Baldwin,Daniel E. Whitney, “An Integrated Computer Aid
for Generating and Evaluating Assembly Sequences forMechanical
Products”, IEEE transactions on robotics and automation, vol. 7. no.
i . february 1991
• Jungwon Yoon , “Assembly simulations in virtual environments with
optimized haptic path and sequence”, Journal of Robotics and
Computer-Integrated Manufacturing 27 (2011) 306–317
• S.J. Hu, “Assembly system design and operations for product
variety”, journal of Manufacturing Technology 60 (2011) 715–733
• Y. Wang, J.H. Liu, “Chaotic particle swarm optimization for assembly
sequence planning”, Journal of Robotics and Computer-Integrated
Manufacturing 26 (2010) 212–222