Другие журналы

scientific edition of Bauman MSTU


Bauman Moscow State Technical University.   El № FS 77 - 48211.   ISSN 1994-0408

Algebraic Models of Product Assembly Process

# 12, December 2016
DOI: 10.7463/1216.0852565
Article file: SE-BMSTU...o232.pdf (1212.08Kb)
author: A.N. Bojko1,*

1 Bauman Moscow State Technical University, Moscow, Russia

Assembly process engineering is one of the biggest challenges in modern preproduction engineering. The quality of the process largely depends on the sequence of machine or device assembly. With increasing number of parts in the engineering system the number of allowable assembly sequences is rapidly increasing. It is impossible to analyse this copious combinatorial space without using the cutting-edge methods of mathematical modelling. The paper offers the algebraic models that can be used to select the rational design solutions at the preproduction engineering stage of the assembly operation.
When assembling any engineering system the coherence and sequence conditions should be met. It is shown that an adequate mathematical description of sequential and coherent assembly operation is shrinkage of edges of the hyper-graph, which describes a mechanical structure of the product. For the product and its parts must be provided a property of the independent assembly. It is shown that this property can be represented as an action of the closure operator on a set of the product parts. The representations of this operator are parts to be assembled independently (the s-sets). Arranged by inclusion, an aggregate of all the sets is a lattice. The lattice is an algebraic structure where are specified two stable operations, namely: lattice intersection and lattice jog. It turned out that it is possible to use this structure, as a universal generating medium to a diversity of design options for the assembly conversion. The lattice terms are used to describe the sequences of product assembly and disassembly, the sequences of assembly and disassembly of the assembly units, the multi-level diagrams of the assembly decomposition, etc. The properties of the independent assembly are required not only to provide the assembly.
A lot of design and technology operations can be performed, provided that a set of the parts has a stable and coordinated configuration within the product, i.e. an s-set of the lattice. For example, those are adjustment operation, various types of tests, fitting and trial assembly, etc. One of the most important operations when designing the engineering system is the synthesis of a rational system of design dimension chains. It is shown that the lattice operations can be used to find the minimum length design chains.
The lattice structure allows us to state and solve a problem of minimizing the number of tests for geometric solvability (geometric access) while assembling the products of complicated configuration. It is shown that the set of all solvable configurations is the sub-lattice within the lattice of all the assembled configurations. This allows us to solve the problem of minimizing the number of geometrical tests through the algebraic lattice restoration methods.

  1. Bahubalendruni R., Biswal B. A review on assembly sequence generation and its automation. Journal of Mechanical Engineering Science. Proceedings of the Institution of Mechanical Engineers, Part C. 2015. DOI: 10.1177/0954406215584633
  2. De Fazio T., Whitney D. Simplified generation of all mechanical assembly sequences. Robotics and Automation, IEEE Journal. 1987. Vol. 3(6). Pp. 640-658. DOI: 10.1109/JRA.1987.1087132
  3. 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
  4. Henrioud J.M., Bonneville F., Bourjault A. Evaluation and selection of assembly plans. Advances in Production Management Systems. 1991. Pp. 489-496. DOI: 10.1016/B978-0-444-88919-5.50055-X
  5. Homem de Mello L., Sanderson A. A basic algorithm for the generation of mechanical assembly sequences. Computer-Aided Mechanical Assembly Planning. 1991. Volume 148 of the series The Springer International Series in Engineering and Computer Science. Pp. 163-190. DOI: 10.1007/978-1-4615-4038-0_7
  6. Kavraki L.E., Latombe J-C., Wilson R.H. On the Complexity of Assembly Partitioning. Information Processing Letters. 1993. V. 48(5). Pp. 229-235. DOI: 10.1016/0020-0190(93)90085-n
  7. Lambert A. J. D. Optimal disassembly of complex products. International Journal of Production Research. 1997. V. 35(9). P. 2509-2524. DOI: 10.1080/002075497194633
  8. Lozano-Perez T., Wilson R.H. Assembly sequencing for arbitrary motions. Robotics and Automation. Proceedings 1993 IEEE International Conference. 1993. V. 2. Pp. 527-532. DOI: 10.1109/ROBOT.1993.291904
  9. Bozhko A.N. Igrovoe modelirovanie geometricheskogo dostupa. Nauka i obrazovanie = Science and education. Electronic scientific and technical publication. 2009. No. 12. Available at: http://technomag.neicon.ru/doc/134322.html, accessed 21.1.2016.
  10. Bozhko A.N. Metody analiza geometricheskoi razreshimosti pri sborke izdelii. Scientific open access journal «Naukovedenie». 2016. Vol. 8, No. 5. DOI: 10.15862/82TVN516
  11. Bozhko A.N., Rodionov S.V. Metody iskusstvennogo intellekta v avtomatizirovannom proektirovanii protsessov sborki. Nauka i obrazovanie = Science and education. Electronic scientific and technical publication. 2016. No. 8. DOI: 10.7463/0816.0844719
  12. Bozhko A.N. Modelirovanie mekhanicheskikh sviazei. Usloviia stiagivaemosti. Nauka i obrazovanie = Science and education. Electronic scientific and technical publication. 2011. No. 5. Available at: http://technomag.neicon.ru/doc/182518.html, accessed 21.11.2016.
  13. Bozhko A.N. Modelirovanie pozitsionnykh sviazei v mekhanicheskikh sistemakh. Informatsionnye tekhnologii = Information Technologies. 2012. No. 10. P. 27-33.
  14. Bozhko A.N. Teoretiko-reshetochnaia model' konstruktsii. Nauka i obrazovanie = Science and education. Electronic scientific and technical publication. 2011. No. 9. Available at: http://technomag.neicon.ru/doc/207577.html, accessed 21.11.2016.
  15. Grettser G. Obshchaia teoriia reshetok. Mir. Moscow, 1982. 465 p.
  16. Gurov S.I. Bulevy algebry, uporiadochennye mnozhestva, reshetki. Opredeleniia, svoistva, primery. Librokom. Moscow, 2013. 352 p.
  17. Pavlov V.V. Matematicheskoe obespechenie SAPR v proizvodstve letatel'nykh apparatov. MFTI = Moscow Institute of Physics and Technology. Moscow, 1978. 68 p.
elibrary crossref ulrichsweb neicon rusycon

About Project
Rambler's Top100
Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)
© 2003-2019 «Наука и образование»
Перепечатка материалов журнала без согласования с редакцией запрещена
 Phone: +7 (915) 336-07-65 (строго: среда; пятница c 11-00 до 17-00)