ALGORITHMS AND METHODS IN DYNAMIC PROBLEMS OF OPTIMAL TRACK PLACEMENT IN THREE-DIMENSIONAL PRINTING

Abstract

The work is devoted to the study of algorithms and methods for calculating optimal trajectories in 3-D printing in the formulation of a dynamic problem of the theory of optimal set partitioning. The relevance of this task lies in the significant actualization of 3-D printing, both in the manufacture of medical, military and dual-use products. Nowadays, technological solutions for 3-D printing allow users to manufacture parts from children's toys made of plas-tic to rocket parts made of high-alloy steel. In times of war, 3-D printing became a tool for improving weapons for Ukraine, allowing you to create experimental products in small quan-tities without resource-intensive research, investigate their effectiveness and applicability in practice, improve and launch them into mass production. This paper considers the mathe-matical aspects of constructing 3-D printing trajectories, taking into account the limitations put forward by manufacturers in the analytical formulation. This approach allows you to obtain optimal solutions, minimize the time and cost of refining parts, and generally reduce the time and cost of their manufacture. It should be noted that this approach is very relevant in the bowls of time, which is due to the large number of new inventions that are being devel-oped in various areas of human existence.