Abstract
Geometric feasibility (GF) of components is the precondition for assembly/disassembly sequence planning (ASP/DSP), and interference matrix is an important assembly relation model for GF discrimination. Extended interference matrix (EIM) is proposed to determine GF in the slanting directions, whose descriptive directions are extended to axes of a local coordinate system in each component. Turning interference matrix (TIM) is proposed to analyze the GF of the component that must be assembled with a multidirectional path, with the structure compact enough to describe the interference information from a turning point. The methods for acquiring EIM and TIM rapidly and automatically are proposed, including the stepping precise detection, the rough detection, and the accelerated detection based on bounding box. The measures for restraining static hard interference automatically are studied. An algorithm for discriminating GF comprehensively based on EIM and TIM is then presented. An ASP system “AutoAssem” is developed, with two instances illustrating the effectiveness of each interference detection method. EIM and TIM are testified to enrich the variety and variability of assembly directions, which provide great universality to the GF determination of large-scale assemblies, together with an effective foundation to ASP/DSP algorithms.
Similar content being viewed by others
References
Boothroyd G, Alting L (1992) Design for assembly and disassembly. CIRP Ann Manuf Technol 41(2):625–636
Wang LH, Keshavarzmanesh S, Feng HY, Buchal RO (2009) Assembly process planning and its future in collaborative manufacturing: a review. Int J Adv Manuf Technol 41(1):132–144
De Fazio TL, Whiteney DE (1987) Simplified generation of all mechanical assembly sequences. IEEE J Robot Autom 3(6):640–658
Homem de Mello LS, Sanderson AC (1991) A correct and complete algorithm for the generation of mechanical assembly sequences. IEEE Trans Robot Autom 7(2):228–240
Su Q (2007) Computer aided geometric feasible assembly sequence planning and optimizing. Int J Adv Manuf Technol 33(1–2):48–57
Su Q, Lai SJ (2010) 3D geometric constraint analysis and its application on the spatial assembly sequence planning. Int J Prod Res 8(5):1395–1414
Dini G, Santochi M (1992) Automated sequencing and subassembly detection in assembly planning. Annals of the CIRP 41(1):1–4
Sinanoglu C, Borklu HR (2004) An approach to determine geometric feasibility to assembly states by intersection matrices in assembly sequence planning. J Intell Manuf 15(4):543–559
Huang YM, Liao YC (2009) Disassembly processes with disassembly matrices and effects of operations. Assem Autom 29(4):348–357
Yu JP, Wang C, Yu H, Zhang WL (2009) Generation of optimized assembly sequences based on priority rules screening. Applied Mechanics and Materials 16–19:130–134
Hsu Y-Y, Tai P-H, Wang M-W, Chen W-C (2011) A knowledge-based engineering system for assembly sequence planning. Int J Adv Manuf Technol 55(5–8):763–782
Choi Y-K, Lee DM, Cho YB (2009) An approach to multi-criteria assembly sequence planning using genetic algorithms. Int J Adv Manuf Technol 42(1–2):180–188
Tseng Y-J, Chen JY, Huang F-Y (2010) A multi-plant assembly sequence planning model with integrated assembly sequence planning and plant assignment using GA. Int J Adv Manuf Technol 48(1–4):333–345
Cheng H, Li Y, Zhang KF (2009) Efficient method of assembly sequence planning based on GAAA and optimizing by assembly path feedback for complex product. Int J Adv Manuf Technol 42(11–12):1187–1204
Gao L, Qian WR, Li XY, Wang JF (2010) Application of memetic algorithm in assembly sequence planning. Int J Adv Manuf Technol 49(9–12):1175–1184
Lv HG, Lu C (2010) An assembly sequence planning approach with a discrete particle swarm optimization algorithm. Int J Adv Manuf Technol 50(5–8):761–770
Lu Z, Sun YC, Gabriel OE, Wu HQ (2011) Disassembly sequence planning for maintenance based on metaheuristic method. Aircraft Engineering and Aerospace Technology 83(3):138–145
Tseng Y-J, Yu F-Y, Huang F-Y (2011) A green assembly sequence planning model with a closed-loop assembly and disassembly sequence planning using a particle swarm optimization method. Int J Adv Manuf Technol 57(9–12):1183–1197
Failli F, Dini G (2000) Ant colony systems in assembly planning: a new approach to sequence detection and optimization. Proceedings of the 2nd CIRP International Seminar on Intelligent Computation in Manufacturing Engineering, 227–232
Wang JF, Liu JH, Zhong YF (2005) A novel ant colony algorithm for assembly sequence planning. Int J Adv Manuf Technol 25(11–12):1137–1143
Liu XH, Peng GL, Liu XM, Hou YF (2012) Disassembly sequence planning approach for product virtual maintenance based on improved max–min ant system. Int J Adv Manuf Technol 59(5–8):829–839
Jin CG, Wang YL, Zhang WH, Lin Y (2010) Study on semi-finished ship structural components assembly sequence optimization. Proceedings 2010 Sixth International Conference on Natural Computation, 2706–2709
Cao P-B, Xiao R-B (2007) Assembly planning using a novel immune approach. Int J Adv Manuf Technol 31(7–8):770–782
Pan CX, Smith SS, Smith GC (2005) Determining interference between parts in CAD STEP files for automatic assembly planning. J Comput Inf Sci Eng 5(1):56–62
Chung CH, Peng QJ (2006) A novel approach to the geometric feasibility analysis for fast assembly tool reasoning. Int J Adv Manuf Technol 31(1–2):125–134
Ilies HT (2009) Continuous collision and interference detection for 3D geometric models. J Comput Inf Sci Eng 9(2):1–7
Yu JP, Wang C, Zhang WL (2010) Method for automatic generation of exploded view based on assembly sequence planning. Journal of Mechanical Engineering 46(11):149–157
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Yu, J., Wang, C. Method for discriminating geometric feasibility in assembly planning based on extended and turning interference matrix. Int J Adv Manuf Technol 67, 1867–1882 (2013). https://doi.org/10.1007/s00170-012-4615-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4615-0