|

Synthesizing Design Solutions for Assembling Complex Items on the Basis of Hypergraph Cutting

Authors: Bozhko A.N., Karpenko A.P. Published: 13.06.2018
Published in issue: #3(120)/2018  
DOI: 10.18698/0236-3933-2018-3-17-32

 
Category: Informatics, Computer Engineering and Control | Chapter: Systems of Computer-Aided Design (CAD Systems)  
Keywords: computer-aided design, assembly, assembly sequence, assembly unit, decomposition, mechanical structure, geometric solvability, hypergraph

The study deals with the problem of computer aided assembly planning for complex items. The main trends in this area of information technology are briefly reviewed and as a result, a hypergraph model for the mechanical structure of the item is proposed. The study shows that the model correctly describes coordination of product parts through assembly bases. Within the research we introduce the concepts of s-hypergraph and s-hypergraph cutting and show that cutting works as a correct mathematical description for assembly and disassembly operations and test configurations of the item that allow for and require checking for geometric solvability. We introduce a combinatorial space of all s-hypergraph cuts and show that it is a universal generating medium for synthesising assembly sequences and diagrams of decomposition into units. Hence, a property called geometric inheritance during assembly is formalised. Moreover, we state the problem of analysing geometric obstructions during complex item assembly as a two-player (decision maker against nature) non-zero-sum game of colouring vertices of an ordered set using two colours. Rational colouring strategies will minimise the number of direct geometrical checks. Finally, we prove a theorem on the structure of ordered sets generated from s-hypergraph cutting and a theorem on characterisation of correct ordered set colouring options

References

[1] Bahubalendruni R., Biswal B. A review on assembly sequence generation and its automation. Proc. Institution of Mechanical Engineers, Part C: Journal of Mechanical Engineering Science, 2016, vol. 230, iss. 5, pp. 824–838. DOI: 10.1177/0954406215584633

[2] Ghandi S., Masehian El. Review and taxonomies of assembly and disassembly path planning problems and approaches. Computer-Aided Design, 2015, vol. 67–68, pp. 58–86. DOI: 10.1016/j.cad.2015.05.001

[3] Homem de Mello L., Sanderson A. A basic algorithm for the generation of mechanical assembly sequences. Homem de Mello L., Lee M., eds. In: Computer-aided mechanical assembly planning. Springer, 1991. Pp. 163–190.

[4] Rashid M., Hutabarat W., Tiwari A. A review on assembly sequence planning and assembly line balancing using soft computing approaches. The International Journal of Advanced Manufacturing Technology, 2012, vol. 59, no. 1-4, pp. 335–349. DOI: 10.1007/s00170-011-3499-8

[5] Wang L., Keshavarzmanesh S., Feng H.-Y., Buchal R. Assembly process planning and its future in collaborative manufacturing: a review. The International Journal of Advanced Manufacturing Technology, 2009, vol. 41, no. 1-2, pp. 132–144. DOI: 10.1007/s00170-008-1458-9

[6] Bozhko A.N., Rodionov S.V. Artificial intelligence methods in computer aided design of assembly processes. Nauka i obrazovanie: nauchnoe izdanie [Science and Education: Scientific Publication], 2016, no. 8 (in Russ.). DOI: 10.7463/0816.0844719

[7] Bozhko A.N. Methods of analysis of geometric obstacles in the assembly of products. Naukovedenie, 2016, vol. 8, no. 5 (in Russ.). DOI: 10.15862/82TVN516 Available at: https://naukovedenie.ru/PDF/82TVN516.pdf

[8] Bozhko A.N. Structural models of product assembly. Nauka i obrazovanie: nauchnoe izdanie [Science and Education: Scientific Publication], 2013, no. 10 (in Russ.). DOI: 10.7463/1013.0622946 Available at: http://old.technomag.edu.ru/doc/622946.html

[9] Karpenko A.P. Sovremennye algoritmy poiskovoy optimizatsii. Algoritmy, vdokhnovlennye prirodoy [Modern search optimization algorithms. Algorithms inspired by nature]. Moscow, Bauman MSTU Publ., 2014. 446 p.

[10] Bozhko A.N. Combinatorial models for assembly and decomposition of products. Nauka i obrazovanie: nauchnoe izdanie [Science and Education: Scientific Publication], 2015, no. 10 (in Russ.). DOI: 10.7463/1015.0817524 Available at: http://old.technomag.edu.ru/doc/817524.html

[11] Bozhko A.N. Geometrical resolvability of three-dimensional scenes. Vestn. Mosk. Gos. Tekh. Univ. im. N.E. Baumana, Priborostr. [Herald of the Bauman Moscow State Tech. Univ., Instrum. Eng.], 2013, no. 3, pp. 76–89 (in Russ.).

[12] Gurov S.I. Bulevy algebry, uporyadochennye mnozhestva, reshetki. Opredeleniya, svoystva, primery [Boolean algebras, ordered sets, lattices. Definitions, properties, examples]. Moscow, Librokom Publ., 2013. 352 p.