<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD Journal Publishing DTD v2.3 20070202//EN" "journalpublishing.dtd">
<article article-type="brief-report" dtd-version="2.3" xml:lang="EN" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Energy Res.</journal-id>
<journal-title>Frontiers in Energy Research</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Energy Res.</abbrev-journal-title>
<issn pub-type="epub">2296-598X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1129311</article-id>
<article-id pub-id-type="doi">10.3389/fenrg.2023.1129311</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Energy Research</subject>
<subj-group>
<subject>Brief Research Report</subject>
</subj-group>
</subj-group>
</article-categories>
<title-group>
<article-title>Automated method based on a neural network model for searching energy-efficient complex movement trajectories of industrial robot in a differentiated technological process</article-title>
<alt-title alt-title-type="left-running-head">Gorkavyy et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/fenrg.2023.1129311">10.3389/fenrg.2023.1129311</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Gorkavyy</surname>
<given-names>Mikhail A.</given-names>
</name>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<xref ref-type="fn" rid="fn1">&#x2020;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/1877305/overview"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gorkavyy</surname>
<given-names>Aleksandr I.</given-names>
</name>
<xref ref-type="fn" rid="fn1">
<sup>&#x2020;</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Egorova</surname>
<given-names>Valeria P.</given-names>
</name>
<xref ref-type="fn" rid="fn1">
<sup>&#x2020;</sup>
</xref>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Melnichenko</surname>
<given-names>Markel A.</given-names>
</name>
<xref ref-type="fn" rid="fn1">
<sup>&#x2020;</sup>
</xref>
</contrib>
</contrib-group>
<aff>
<institution>Faculty of Energy and Management</institution>, <institution>Komsomolsk-na-Amure State University</institution>, <addr-line>Komsomolsk-on-Amur</addr-line>, <country>Russia</country>
</aff>
<author-notes>
<fn fn-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/120925/overview">Luis Puigjaner</ext-link>, Universitat Politecnica de Catalunya, Spain</p>
</fn>
<fn fn-type="edited-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/194872/overview">Alaa Abdul-Ameer</ext-link>, British University in Dubai, United Arab Emirates</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1882421/overview">Arunesh Kumar Kumar Singh</ext-link>, Jamia Millia Islamia, India</p>
</fn>
<corresp id="c001">&#x2a;Correspondence: Mikhail A. Gorkavyy, <email>gorkavyy.mikhail@bk.ru</email>
</corresp>
<fn fn-type="other" id="fn1">
<label>
<sup>&#x2020;</sup>
</label>
<p>ORCID: Mikhail A. Gorkavyy, <ext-link ext-link-type="uri" xlink:href="http://orcid.org/0000-0001-8046-9906">orcid.org/0000-0001-8046-9906</ext-link>; Aleksandr I. Gorkavyy, <ext-link ext-link-type="uri" xlink:href="http://orcid.org/0000-0001-7240-4264">orcid.org/0000-0001-7240-4264</ext-link>; Valeria P. Egorova, <ext-link ext-link-type="uri" xlink:href="http://orcid.org/0000-0002-6749-6712">orcid.org/0000-0002-6749-6712</ext-link>; Markel A. Melnichenko, <ext-link ext-link-type="uri" xlink:href="http://orcid.org/0000-0003-4498-6804">orcid.org/0000-0003-4498-6804</ext-link>
</p>
</fn>
<fn fn-type="other">
<p>This article was submitted to Process and Energy Systems Engineering, a section of the journal Frontiers in Energy Research</p>
</fn>
</author-notes>
<pub-date pub-type="epub">
<day>04</day>
<month>10</month>
<year>2023</year>
</pub-date>
<pub-date pub-type="collection">
<year>2023</year>
</pub-date>
<volume>11</volume>
<elocation-id>1129311</elocation-id>
<history>
<date date-type="received">
<day>21</day>
<month>12</month>
<year>2022</year>
</date>
<date date-type="accepted">
<day>07</day>
<month>03</month>
<year>2023</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2023 Gorkavyy, Gorkavyy, Egorova and Melnichenko.</copyright-statement>
<copyright-year>2023</copyright-year>
<copyright-holder>Gorkavyy, Gorkavyy, Egorova and Melnichenko</copyright-holder>
<license xlink:href="http://creativecommons.org/licenses/by/4.0/">
<p>This is an open-access article distributed under the terms of the Creative Commons Attribution License (CC BY). The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</p>
</license>
</permissions>
<abstract>
<p>
<bold>Purpose of the work:</bold> Researching possibility of creating a method for improving the energy efficiency of differentiated robotic technological process (RTP) in the food industry. The high rates of development of production processes robotization, including in the food industry, leading to increase the cost of electrical energy, determine the research tasks relevance in finding energy-efficient methods for controlling industrial robots.</p>
<p>
<bold>Methodology:</bold> The proposed approach is based on principles of object-oriented design and possibility of classifying robotic technological process: Applying specific model sets and methods to improve energy efficiency to individual classes. The existing possibility of energy consumption synthesizing models of robots inside differentiated robotic technological process, such as stacking loads, in reduced form, made it possible to use neural network methods to identify non-linear dependencies. At the same time, training sample for intelligent modules was formed on the basis of classical experiment planning algorithms. The synthesis of methods, models and procedures was implemented on the basis of high-level programming languages C&#x2b;&#x2b;, MATLAB.</p>
<p>
<bold>Results:</bold> A mathematical model and automated algorithms for its synthesis are proposed, which make it possible to adjust robotic technological process simulation model taking into account its specifics and implement a method for finding the optimal parameters of its functioning. To confirm the effectiveness of proposed solution, the obtained neural network model and optimization method were tested on real robotic technological process, and the calculation of economic efficiency of proposed solution was also given.</p>
<p>
<bold>Conclusion/recommendations:</bold> The application of this approach will significantly reduce energy costs for robotic operations in the food industry.</p>
</abstract>
<kwd-group>
<kwd>technological process</kwd>
<kwd>robotization</kwd>
<kwd>food industry</kwd>
<kwd>industrial robot</kwd>
<kwd>neural network model</kwd>
<kwd>energy efficiency</kwd>
<kwd>optimization</kwd>
</kwd-group>
</article-meta>
</front>
<body>
<sec id="s1">
<title>1 Introduction</title>
<p>In the conditions of an unstable world economy, increasing tensions at the geopolitical level and global climate change, the likelihood of emergency situations in the country is increasing. In order to reduce the impact of negative consequences, specialized services and structures are working to improve the national security systems of the country, including in the field of food security, which is one of the main goals of the agrarian and economic policy of the country. Thus, one of the important subsystems of ensuring food security is the warehousing and storage of products, essentials, devices, mechanisms, <italic>etc.</italic> At the same time, due to the constant correction of the nomenclature of stored objects towards its expansion, the issues of increasing the &#xab;productivity&#xbb; of specialized warehouses are becoming more urgent. Qualitative indicators can be achieved by solving logistical problems inside a specialized room, as shown in (<xref ref-type="bibr" rid="B9">Ivanov et al., 2021</xref>), which can be achieved through the development of adequate mathematical models of processes and the use of modern automation tools, in particular, industrial robots (IR), sensor systems and intelligent control algorithms. Thus, the performance indicator of the removal, loading, reassembly subsystems, location changes, confirmation of the quality of objects and storage classes will be determined, among other things, at the stage of technological design processes at manufacturing enterprises, for example, the weight and size indicators of the combined cargo on a pallet, options for laying, packaging and fastening. Palletizing, packaging and fastening operations also make a significant contribution to the formation of the cost of storage of products. To date, the quality indicators of these operations are achieved through the use of automation tools&#x2014;IR, which is confirmed by the results of work (<xref ref-type="bibr" rid="B10">Kaczmarek and Borys, 2016</xref>). Nevertheless, due to the specifics of their device, there is an increase in electric energy costs, which ultimately negatively affects the cost of product storage. Thus, the issues of searching for algorithms for optimizing the process of assembling cargo intended for the formation of a strategic reserve, in the direction of reducing the cost of storage by reducing the electric power costs of IR, are very relevant. The approach proposed in this paper is based on the results obtained earlier by the authors of the study of the processes of increasing the energy efficiency of robotic machining and welding (<xref ref-type="bibr" rid="B3">Efimov et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Gorkavyy et al., 2021</xref>).</p>
</sec>
<sec sec-type="materials|methods" id="s2">
<title>2 Materials and methods</title>
<p>A distinctive feature of robotic technological complex (RTC) from other technological complexes is their high versatility and the ability to quickly adapt to changing working environment conditions. In this regard, universal automated technological complexes in production can be used, among other things, for the execution of simple technological operations characterized by a limited set of complexes of movement trajectories. Examples of such processes are: palletizing/depalletization, loading/unloading of machines, contact welding (<xref ref-type="bibr" rid="B13">Kozhevnikov et al., 2016</xref>; <xref ref-type="bibr" rid="B11">Kozhevnikov et al., 2019</xref>), trimming of contours of parts (<xref ref-type="bibr" rid="B12">Kozhevnikov et al., 2020</xref>), various test operations. In such cases, the RTC functionality is redundant to perform the operation, and the complex itself can be described by a reduced model based on intelligent tools. The advantage of using a reduced model when describing the above simple technological operations is the ability to quickly adjust the model to the changed working conditions of the RTC.</p>
<p>Thus, a typical RT&#x421; of laying blocks can be described by a reduced model reflecting only the indicators of energy and time spent on performing a robotic operation. The developed models can be aggregated in the future to build models of more complex processes with the aim of further optimization due to modularity and the possibility of quick readjustment of models to the changed requirements of the technological task.</p>
<p>A typical technological process of robotic loading of pallets with loads passing through a conveyor belt is shown in the figure (see <xref ref-type="fig" rid="F1">Figure 1</xref>).</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>Robotized technological complex virtual model: 1&#x2014;Industrial robot-manipulator, 2&#x2014;Conveyor belt, 3&#x2014;Robotic cart (RC), 4&#x2014;Pallet, 5&#x2014;Base unit in the loading zone. Source Compiled by the authors.</p>
</caption>
<graphic xlink:href="fenrg-11-1129311-g001.tif"/>
</fig>
<p>The main elements of RTP are: An industrial robot-manipulator, the working area of which is described by the set <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, global coordinate system <italic>G</italic> is fixed in the center of the robot base according to the figure. <inline-formula id="inf2">
<mml:math id="m2">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0,0,0</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
<italic>&#x2013;</italic> center of the global coordinate system. Another element of the presented scheme is the loading block (hereinafter referred to as the block) in its original position on the conveyor belt. Local coordinate system <italic>L</italic> is attached to the block. Its center is the position of the robot working body - the robot end effector (REE) at the moment of capturing the block. In the work, <italic>L</italic> was obtained by shifting the origin of coordinates without rotating the axes, therefore, the plane <inline-formula id="inf3">
<mml:math id="m3">
<mml:mrow>
<mml:mi>Z</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>X</mml:mi>
<mml:mo>&#x2016;</mml:mo>
<mml:msup>
<mml:mi>Z</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:msup>
<mml:mi>O</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
<mml:msup>
<mml:mi>X</mml:mi>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, axis <inline-formula id="inf4">
<mml:math id="m4">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> runs along the axis of symmetry of the block and the conveyor belt. The block has dimensions <inline-formula id="inf5">
<mml:math id="m5">
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>h</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> axial length <inline-formula id="inf6">
<mml:math id="m6">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>X</mml:mi>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, width&#x2014;along <inline-formula id="inf7">
<mml:math id="m7">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and height&#x2014;along the axis <inline-formula id="inf8">
<mml:math id="m8">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>Z</mml:mi>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>. In the case of obtaining <italic>L</italic> by shifting the origin and rotating the axes, the direction cosines <inline-formula id="inf9">
<mml:math id="m9">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf10">
<mml:math id="m10">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf11">
<mml:math id="m11">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:mi>L</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> should be determined.</p>
<p>Robotic cart 3 height <inline-formula id="inf12">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> performs positioning the pallet 4 height <inline-formula id="inf13">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> within the loading area defined by the 2D set <italic>S</italic>, robotic cart has the ability to lift the pallet to a height <inline-formula id="inf14">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Then the 3D loading zone, i.e., the set of points at which, there may be a groupage cargo on a pallet, is described by a set <inline-formula id="inf15">
<mml:math id="m15">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mi>b</mml:mi>
</mml:msub>
<mml:mo>&#x2229;</mml:mo>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf16">
<mml:math id="m16">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;Cylindrical body bounded from below by a plane <inline-formula id="inf17">
<mml:math id="m17">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
<mml:mo>&#x2016;</mml:mo>
<mml:mi>X</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, passing from her at a distance <inline-formula id="inf18">
<mml:math id="m18">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>y</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>f</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>; above the ceiling of the technological area; along the edges&#x2014;Generators of a cylindrical body, passing through the boundaries of the set <italic>S</italic> and perpendicular to <inline-formula id="inf19">
<mml:math id="m19">
<mml:mrow>
<mml:mi>&#x3bb;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. Pallet dimensions: Length <inline-formula id="inf20">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, width <inline-formula id="inf21">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>p</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf22">
<mml:math id="m22">
<mml:mrow>
<mml:msub>
<mml:mi>h</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The technological height of the cargo on the pallet makes it possible to determine the number of blocks placed on the pallet and their number in each row <inline-formula id="inf23">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>w</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Coordinate system attached to base unit <inline-formula id="inf24">
<mml:math id="m24">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> with center coordinates <inline-formula id="inf25">
<mml:math id="m25">
<mml:mrow>
<mml:msub>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, all other blocks are considered relative to it, the mathematical description of the set of points of the block <inline-formula id="inf26">
<mml:math id="m26">
<mml:mrow>
<mml:msub>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is presented as:<list list-type="simple">
<list-item>
<p>- <inline-formula id="inf27">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;Center of the local coordinate system, as well as the position of the working body of the robot at the moment the grip is released;</p>
</list-item>
<list-item>
<p>- For <inline-formula id="inf28">
<mml:math id="m28">
<mml:mrow>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>A</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2208;</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> the system of inequalities is fulfilled<disp-formula id="equ1">
<mml:math id="m29">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mn>0</mml:mn>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>l</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x2264;</mml:mo>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msup>
<mml:mo>&#x2264;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>w</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</disp-formula>
</p>
</list-item>
<list-item>
<p>- direction cosines <inline-formula id="inf29">
<mml:math id="m30">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>x</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf30">
<mml:math id="m31">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>y</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf31">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi mathvariant="italic">cos</mml:mi>
<mml:msup>
<mml:mi>R</mml:mi>
<mml:msup>
<mml:mi>z</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msup>
</mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</list-item>
<list-item>
<p>- <inline-formula id="inf32">
<mml:math id="m33">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>c</mml:mi>
<mml:mi>y</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>: <inline-formula id="inf33">
<mml:math id="m34">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2192;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>;</p>
</list-item>
<list-item>
<p>
<inline-formula id="inf34">
<mml:math id="m35">
<mml:mrow>
<mml:msub>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>: <inline-formula id="inf35">
<mml:math id="m36">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2192;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>r</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3b8;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>
</p>
</list-item>
</list>
</p>
<p>The last two functions are necessary if the RC does not position the pallet parallel to one of the planes of the global system <inline-formula id="inf36">
<mml:math id="m37">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>Z</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mi>O</mml:mi>
<mml:mi>Z</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>. The paper further considers the situation when <inline-formula id="inf37">
<mml:math id="m38">
<mml:mrow>
<mml:msub>
<mml:mi>L</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is obtained by only transferring the origin of the coordinate system without rotating its axes.</p>
<p>The set of all blocks on the pallet together with the set <inline-formula id="inf38">
<mml:math id="m39">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:mi>t</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> must be included in the loading area: <inline-formula id="inf39">
<mml:math id="m40">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>P</mml:mi>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>&#x222a;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msubsup>
<mml:mo>&#x222a;</mml:mo>
<mml:msubsup>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mn mathvariant="bold">2</mml:mn>
</mml:msubsup>
<mml:mo>&#x222a;</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:mo>&#x222a;</mml:mo>
<mml:msubsup>
<mml:mi>U</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mi>j</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mi>m</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2201;</mml:mo>
<mml:mi>W</mml:mi>
<mml:mo>&#x27f9;</mml:mo>
<mml:mi>t</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf40">
<mml:math id="m41">
<mml:mrow>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>- number of blocks on pallet, where <inline-formula id="inf41">
<mml:math id="m42">
<mml:mrow>
<mml:mi>m</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>w</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Technological operations of placing loads (blocks) on pallets, as well as other operations of a similar class, such as conveyor assembly operations (for example, in the automotive industry, aircraft manufacturing), painting, radiography, <italic>etc.</italic>, are characterized by a narrow range of changes and can be, in most restrictions, a small number of typical movements (<xref ref-type="bibr" rid="B20">Parisi et al., 2020</xref>), in contrast to the processes of machining and welding (<xref ref-type="bibr" rid="B5">Frolov, 2021a</xref>; <xref ref-type="bibr" rid="B3">Efimov et al., 2021</xref>; <xref ref-type="bibr" rid="B8">Gorkavyy et al., 2021</xref>). In such technological processes, the movements of the robot are carried out in a very limited segment of its working area. So for the considered RTP (see <xref ref-type="fig" rid="F1">Figure 1</xref>), one of the typical complexes of REE movement trajectories for loading one block can be a complex of ten trajectories, shown in <xref ref-type="fig" rid="F2">Figure 2A</xref>.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>The REE trajectories. <bold>(A)</bold> Typical block movement trajectory, <bold>(B)</bold> Complex of trajectories for measurements. Source Compiled by the authors.</p>
</caption>
<graphic xlink:href="fenrg-11-1129311-g002.tif"/>
</fig>
<p>The set of trajectories consists of five trajectories <inline-formula id="inf42">
<mml:math id="m43">
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>B</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula>, and <inline-formula id="inf43">
<mml:math id="m44">
<mml:mrow>
<mml:msup>
<mml:mi>D</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, realizing the movement of the captured block to the point of unloading, and five trajectories <inline-formula id="inf44">
<mml:math id="m45">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:msup>
<mml:mi>D</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msup>
<mml:mi>D</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi>D</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>D</mml:mi>
<mml:mi>C</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
<mml:mi>B</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>B</mml:mi>
<mml:mi>A</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>, ensuring the return of the REE to its original position in the loading area. On the IR KUKA there are two types of commands that generally used to implement such motion paths: LIN - moving REE in a straight line and CIRC - moving REE by a circle (<xref ref-type="bibr" rid="B15">KUKA Roboter GmbH, 2014</xref>; <xref ref-type="bibr" rid="B16">KUKA Roboter GmbH, 2016a</xref>; <xref ref-type="bibr" rid="B1">Anistrantsev and Bespalova, 2021</xref>). <xref ref-type="fig" rid="F2">Figure 2A</xref> shows the commands of the programming language Kuka Robot Language (KRL) (<xref ref-type="bibr" rid="B14">KUKA Roboter GmbH, 2016b</xref>), that implement REE movements. Each REE movement is characterized by energy costs <inline-formula id="inf45">
<mml:math id="m46">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>A</mml:mi>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>B</mml:mi>
<mml:mi>C</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mi>P</mml:mi>
<mml:mi>P</mml:mi>
</mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msub>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:msup>
<mml:mi>P</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
<mml:mi>E</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>
<italic>,</italic> at the same time, the studies reflected in (<xref ref-type="bibr" rid="B1">Anistrantsev and Bespalova, 2021</xref>) show that the values of energy consumption by the robot when implementing the same movements in different areas of the working area are not the same. This fact is physically and mathematically described in (<xref ref-type="bibr" rid="B2">Cao et al., 2020</xref>), in the form of models that require significant computing resources for their processing. Without a mathematical model, relying only on empirical experience, it is extremely difficult to establish the most energy efficient zone for performing operations. On the other hand, it is not economically feasible to use complex identification mechanisms and build a detailed high-dimensional mathematical model based on the physical laws underlying the processes occurring in the robot mechanisms for RTP, which is characterized by relative simplicity and limited REE movement (see <xref ref-type="fig" rid="F1">Figure 1</xref>). Thus, the paper sets the task of developing a reduced model of IR energy consumption in RTP, characterized by a limited number of types of motion trajectories (differentiated RTP), as well as a method for synthesizing a control program that ensures minimization of RTC energy consumption by searching for the optimal set of robot and RC motion trajectories (positioning option, pallet height adjustment).</p>
<p>In order to be able to estimate the energy consumption of the robot associated with the trajectory of movement, it is necessary to have the function <inline-formula id="inf46">
<mml:math id="m47">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>g</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. It is proposed to restore (identify) a non-linear dependence using well-established tools of neural networks (<xref ref-type="bibr" rid="B18">Mart&#xed;nez and Vel&#xe1;squez, 2011</xref>; <xref ref-type="bibr" rid="B7">Gordin et al., 2020</xref>; <xref ref-type="bibr" rid="B9">Ivanov et al., 2021</xref>), fuzzy logic (<xref ref-type="bibr" rid="B25">Voskoglou, 2022</xref>) or hybrid (neuro-fuzzy systems) (<xref ref-type="bibr" rid="B17">Marakhimov et al., 2018</xref>) in the automatic synthesis mode based on the training sample. To obtain a training sample, it was decided to perform a limited but sufficient number of movement trajectories, representing the set <italic>W</italic> and the loading zone (<xref ref-type="fig" rid="F2">Figure 2B</xref>), having carried out all the necessary measurements. In each trajectory, the movement <inline-formula id="inf47">
<mml:math id="m48">
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mi>D</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> was combined with the movement <inline-formula id="inf48">
<mml:math id="m49">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>D</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>In the KRL language, the REE movement commands would be: <inline-formula id="inf49">
<mml:math id="m50">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>A</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>A</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> <italic>C_DIS</italic> &#x2013; command to move to the starting point; <inline-formula id="inf50">
<mml:math id="m51">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>B</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>A</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> <italic>C_DIS</italic>; <inline-formula id="inf51">
<mml:math id="m52">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>C</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>c</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>A</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>B</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>C</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>&#x3b1;</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> <italic>C_DIS</italic>; <inline-formula id="inf52">
<mml:math id="m53">
<mml:mrow>
<mml:mi>C</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>R</mml:mi>
<mml:mi>C</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:msup>
<mml:mi>C</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:msup>
<mml:mi>C</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:msup>
<mml:mi>C</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:msub>
<mml:mo>&#x2026;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>D</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>D</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>D</mml:mi>
</mml:msub>
<mml:mo>&#x2026;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> <italic>C_DIS;</italic> <inline-formula id="inf53">
<mml:math id="m54">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>I</mml:mi>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>E</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>E</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>Z</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>E</mml:mi>
</mml:msub>
<mml:mo>&#x2026;</mml:mo>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> <italic>C_DIS.</italic>
</p>
<p>The number of trajectories required to form a training sample is determined empirically by setting the discreteness of changing parts of the trajectory. For example, <xref ref-type="fig" rid="F2">Figure 2B</xref> defines the possibility of existence of 4&#xb7;9&#xb7;5&#xb7;4 &#x3d; 720 movement paths. The arguments <inline-formula id="inf54">
<mml:math id="m55">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="italic">arg</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> were taken as <inline-formula id="inf55">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The implicant of point <italic>B</italic> in the linear coordinate system of global <italic>L</italic>, <inline-formula id="inf56">
<mml:math id="m57">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The abscissa of point <italic>C</italic> in global coordinate system <italic>L</italic>, <inline-formula id="inf57">
<mml:math id="m58">
<mml:mrow>
<mml:mi>&#x3c6;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The angle of rotation of the robot arm relative to the center of the global coordinate system in the XOY plane and <inline-formula id="inf58">
<mml:math id="m59">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> in the global coordinate system pallets. Measurements are performed when the robot passes all the given trajectories by the electrical energy consumption recorder according to <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Presentation format of measurement results.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Rise index</th>
<th align="center">Shift index</th>
<th align="center">Turn index</th>
<th align="center">Descent index</th>
<th align="center">z<sub>up</sub>
</th>
<th align="center">x<sub>side</sub>
</th>
<th align="center">&#x3c6;<sub>0</sub>
</th>
<th align="center">z<sub>down</sub>
</th>
<th align="center">E (W&#xb7;h)</th>
<th align="center">T (ms)</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">400</td>
<td align="center">400</td>
<td align="center">&#x2212;86.8699</td>
<td align="center">200</td>
<td align="center">1,059668</td>
<td align="center">8881</td>
</tr>
<tr>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">2</td>
<td align="center">400</td>
<td align="center">400</td>
<td align="center">&#x2212;86.8699</td>
<td align="center">250</td>
<td align="center">1,070366</td>
<td align="center">8725</td>
</tr>
<tr>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">1</td>
<td align="center">3</td>
<td align="center">400</td>
<td align="center">400</td>
<td align="center">&#x2212;86.8699</td>
<td align="center">300</td>
<td align="center">1,023373</td>
<td align="center">8533</td>
</tr>
<tr>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
<td align="center">. . .</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">9</td>
<td align="center">5</td>
<td align="center">2</td>
<td align="center">250</td>
<td align="center">800</td>
<td align="center">&#x2212;30.556</td>
<td align="center">100</td>
<td align="center">0,98745</td>
<td align="center">8100</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">9</td>
<td align="center">5</td>
<td align="center">3</td>
<td align="center">250</td>
<td align="center">800</td>
<td align="center">&#x2212;30.556</td>
<td align="center">150</td>
<td align="center">0,973699</td>
<td align="center">7909</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">9</td>
<td align="center">5</td>
<td align="center">4</td>
<td align="center">250</td>
<td align="center">800</td>
<td align="center">&#x2212;30.556</td>
<td align="center">200</td>
<td align="center">0,937983</td>
<td align="center">7693</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>
<italic>Source</italic> Compiled by the authors.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>The KRL program for performing the necessary set of movements is formed automatically using specially developed software in C&#x2b;&#x2b; (<xref ref-type="bibr" rid="B4">Frolov, 2021b</xref>; <xref ref-type="bibr" rid="B24">Tretyak et al., 2021</xref>). Taking into account the specifics of the training sample, it is proposed to identify a non-linear dependence by a neural network of the feed-forward backprop type, as discussed in (<xref ref-type="bibr" rid="B6">Glorot and Bengio, 2010</xref>; <xref ref-type="bibr" rid="B22">Sozykin, 2017</xref>). An analysis of the effectiveness of using neural networks of different types in the framework of complex tasks is presented in (<xref ref-type="bibr" rid="B18">Mart&#xed;nez and Vel&#xe1;squez, 2011</xref>). After the dependence <inline-formula id="inf59">
<mml:math id="m60">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>f</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>,</mml:mo>
</mml:mrow>
</mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, has been established, it seems possible to obtain the optimal set of motion trajectories within the working area, ensuring the loading of the entire volume of blocks on a pallet. The search for the optimal set of REE movement trajectories, as well as the option of positioning the pallet with a robotic cart is presented below. In this case, it is assumed that the axes of the local coordinate system of the pallet are aligned with the axes of the global coordinate system. To simplify the search algorithm, it is proposed to enclose the set <italic>W</italic> in a parallelepiped bounded by planes <inline-formula id="inf60">
<mml:math id="m61">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>z</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, where <inline-formula id="inf61">
<mml:math id="m62">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf62">
<mml:math id="m63">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The smallest values of all coordinates of all points belonging to <italic>W</italic> and <inline-formula id="inf63">
<mml:math id="m64">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf64">
<mml:math id="m65">
<mml:mrow>
<mml:mi>z</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;The largest value of the coordinates, respectively. The next step is to set <inline-formula id="inf65">
<mml:math id="m66">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>y</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;Which determine the search step along three axes: <inline-formula id="inf66">
<mml:math id="m67">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>X</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>O</mml:mi>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf67">
<mml:math id="m68">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mi>Z</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> respectively. Then for each point <inline-formula id="inf68">
<mml:math id="m69">
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, determined by the step <inline-formula id="inf69">
<mml:math id="m70">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>,</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> on each integration, a four-dimensional array <inline-formula id="inf70">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>l</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is built, where <inline-formula id="inf71">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>f</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>g</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf72">
<mml:math id="m73">
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c6;</mml:mi>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>&#x2014;Function argument <inline-formula id="inf73">
<mml:math id="m74">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mo>(</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>d</mml:mi>
<mml:mi>e</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>&#x3c6;</mml:mi>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, under which it takes the minimum value <inline-formula id="inf74">
<mml:math id="m75">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> under the constraints caused by the need to move the block to the point <inline-formula id="inf75">
<mml:math id="m76">
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, that is, for this point <italic>&#x3c6; &#x3d; const, x</italic>
<sub>
<italic>side</italic>
</sub> <italic>&#x3d; const, z</italic>
<sub>
<italic>down</italic>
</sub> <italic>&#x3d; const</italic>, while <italic>z</italic>
<sub>
<italic>up</italic>
</sub> bound by limitation <disp-formula id="equ2">
<mml:math id="m77">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mo>&#x2206;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mo>&#x2026;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi mathvariant="italic">max</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3e;</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>w</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</disp-formula>if <inline-formula id="inf76">
<mml:math id="m78">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2209;</mml:mo>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> the value of <italic>flag</italic> is set to 0. After for each <inline-formula id="inf77">
<mml:math id="m79">
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, all elements except <inline-formula id="inf78">
<mml:math id="m80">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are calculated, the optimal trajectory and the energy consumption associated with it are found, the search for the optimal set of movement trajectories and the energy consumption associated with it <inline-formula id="inf79">
<mml:math id="m81">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:msub>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> by the formulas:<disp-formula id="equ3">
<mml:math id="m82">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>i</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>l</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>h</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>j</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>h</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>w</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>k</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:munderover>
</mml:mstyle>
<mml:mrow>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>5</mml:mn>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>;</mml:mo>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mo>&#x2200;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>6</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>;</mml:mo>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:msub>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:msub>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi mathvariant="normal">i</mml:mi>
<mml:mi mathvariant="normal">f</mml:mi>
<mml:mo>&#x2203;</mml:mo>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>;</mml:mo>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>6</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0</mml:mn>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</disp-formula>
</p>
<p>After the array is completely calculated, it is necessary to search <inline-formula id="inf80">
<mml:math id="m83">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>l</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>h</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>w</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>7</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2192;</mml:mo>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and restore the base point <inline-formula id="inf81">
<mml:math id="m84">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mrow>
<mml:mi>o</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mfenced open="{" close="}" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>x</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>y</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>z</mml:mi>
<mml:mi>k</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, determine from it the set of installation points for all blocks and, accordingly, the optimal trajectories for moving blocks. Also, it seems appropriate to rank the options for movement complexes, taking into account the increase <inline-formula id="inf82">
<mml:math id="m85">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>. Such a rank can be useful in case of additional restrictions or optimization criteria, for example, minimizing the execution time of a set of motion trajectories. In this case, it is necessary to expand the element <inline-formula id="inf83">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, with two variables <inline-formula id="inf84">
<mml:math id="m87">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf85">
<mml:math id="m88">
<mml:mrow>
<mml:msub>
<mml:mi>t</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, determined by analogy with <inline-formula id="inf86">
<mml:math id="m89">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi mathvariant="italic">min</mml:mi>
</mml:msub>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, and perform optimization according to the required criteria, for example, minimizing the implementation time of a set of movement trajectories with minimal energy costs.</p>
<p>It should be noted that as a result of the optimization, a set of trajectories of movement will be obtained only in the forward direction, while the trajectories of movement in the opposite direction are taken as &#x201c;mirror&#x201d; or return to point A using the PTP command. Energy consumption work when moving back is not taken into account in optimization algorithms, since the results of studies (<xref ref-type="bibr" rid="B19">Paesa et al., 2014</xref>; <xref ref-type="bibr" rid="B21">Qiu et al., 2021</xref>) showed a slight deviation in energy consumption in the forward and reverse directions.</p>
<p>In addition, it is possible, in case of energy expediency, to lay blocks by a robot in one layer, while the depth of laying is regulated by layer-by-layer lowering of RT pallets with cargo. At the same time, it is also necessary to take into account the difference between the saved energy for moving the REE to a depth and the energy required for the initial lifting of the pallet and its subsequent lowering.</p>
</sec>
<sec sec-type="results" id="s3">
<title>3 Results</title>
<p>To confirm the effectiveness of the proposed solutions, an experiment was conducted under conditions close to industrial production using KUKA equipment (<xref ref-type="table" rid="T2">Table 2</xref>). <xref ref-type="table" rid="T3">Table 3</xref> presents the initial data of experimental researches.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Geometric and physical parameters of experimental objects.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">No</th>
<th align="center">Name</th>
<th align="center">Main characteristics</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td rowspan="7" align="left">1</td>
<td rowspan="7" align="left">Coordinates of key points, coordinates of systems and offsets</td>
<td align="left">- x_start &#x3d; 600; y_start &#x3d; 300; z_start &#x3d; 200.</td>
</tr>
<tr>
<td align="left">- L { 600, 300, 200 }, cos R<sup>x`</sup>
<sub>L</sub> &#x3d; 1, cos R<sup>y`</sup>
<sub>L</sub> &#x3d; 1, cos R<sup>z`</sup>
<sub>L</sub> &#x3d; 1</td>
</tr>
<tr>
<td align="left">- &#x394;x &#x3d; 0.01; &#x394;y &#x3d; 0.01; &#x394;z &#x3d; 0.01.</td>
</tr>
<tr>
<td align="left">- dimensions of RC (l &#xd7; w &#xd7; h) &#x3d; 0.58 &#xd7; 0.376 &#xd7; 0.14 (m)</td>
</tr>
<tr>
<td align="left">- dimensions of pallet (l &#xd7; w &#xd7; h) &#x3d; 0.6 &#xd7; 0.4 &#xd7; 0.145 (m)</td>
</tr>
<tr>
<td align="left">- dimensions of loading block (l &#xd7; w &#xd7; h) &#x3d; 0.05 &#xd7; 0.05 &#xd7; 0.05 (m)</td>
</tr>
<tr>
<td align="left">- dimensions of cargo (l &#xd7; w &#xd7; h) &#x3d; 0.15 &#xd7; 0.15 &#xd7; 0.15 (m)</td>
</tr>
<tr>
<td rowspan="5" align="left">2</td>
<td rowspan="5" align="left">Loading area restrictions</td>
<td align="left">y &#x3c; y<sub>0</sub>_zone</td>
</tr>
<tr>
<td align="left">z &#x2265; z start &#x2013; 4&#xb7;&#x394;z</td>
</tr>
<tr>
<td align="left">z &#x2264; z start &#x2b; 4&#xb7;&#x394;z</td>
</tr>
<tr>
<td align="left">x<sup>2</sup> &#x2b; y<sup>2</sup> &#x2264; r<sup>2</sup>
<sub>max</sub> &#x2192; (r<sub>max</sub> &#x2013; radius of outermost arc)</td>
</tr>
<tr>
<td align="left">x<sup>2</sup> &#x2b; y<sup>2</sup> &#x2265; r<sup>2</sup>
<sub>min</sub> &#x2192; (r<sub>min</sub> &#x2013; radius of closest arc)</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Robot movement parameters</td>
<td align="left">Speed V &#x3d; 2&#xa0;m/s; acceleration a &#x3d; 2&#xa0;m/s<sup>2</sup>; smoothing type - along the arc; operating mode &#x2013; AUT (automatic); time spent on executing the code for the formation of the training sample - 3.5&#xa0;h; energy spent on the execution of the code for the formation of the training sample is 1.36&#xa0;kW&#xb7;h</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>Source Compiled by the authors. As a result of the optimization method, the base point <italic>D</italic>
<sub>
<italic>opt</italic>
</sub> {530; &#x2212;300; 200}&#x2014;The center of the local coordinate system of loading blocks, which determines the set of trajectories of movements, characterized by the lowest consumption of electrical energy equal to: 22.35&#xa0;W&#xb7;h per movement in one direction.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Used hardware and software.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="left">No.</th>
<th align="center">Title</th>
<th align="center">Main characteristics</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="left">1</td>
<td align="left">Industrial robot-manipulator</td>
<td align="left">KUKA KR10 R1100 sixx</td>
</tr>
<tr>
<td align="left">2</td>
<td align="left">Robotic cart</td>
<td align="left">KUKA YouBot Platform</td>
</tr>
<tr>
<td align="left">3</td>
<td align="left">Conveyor belt</td>
<td align="left">Imitator, steel table with PVC substrate, substrate dimensions (l &#x445; w &#x445; h) &#x3d; 0.8 &#x445; 0.3 &#x445; 0.005 (m)</td>
</tr>
<tr>
<td rowspan="4" align="left">4</td>
<td rowspan="4" align="left">Measuring device</td>
<td align="left">- Components: Arduino UNO platform, AC voltage sensor ZMPT101B, current sensor TA12-200.</td>
</tr>
<tr>
<td align="left">- Measured quantities</td>
</tr>
<tr>
<td align="left">1) I (&#x410;), U (V) &#x2013; current, input voltage (instantaneous values); 2) t(s) &#x2013; time (processor readings).</td>
</tr>
<tr>
<td align="left">- Programming language: Arduino IDE.</td>
</tr>
<tr>
<td align="left">5</td>
<td align="left">Programming language &#x41f;&#x420;/automated synthesis of KRL commands/neural network generation</td>
<td align="left">KUKA Robot Language (KRL)/&#x421;&#x2b;&#x2b;/MATLAB</td>
</tr>
</tbody>
</table>
<table-wrap-foot>
<fn>
<p>Source Compiled by the authors.</p>
</fn>
</table-wrap-foot>
</table-wrap>
<p>
<xref ref-type="fig" rid="F3">Figure 3</xref> (a) shows a sweep of the graph of the function <inline-formula id="inf87">
<mml:math id="m90">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> for the loading area when laying one block at the base point; <xref ref-type="fig" rid="F3">Figure 3</xref> (b) - when laying a complex of blocks relative to this base point. This dependence is non-linear, the nature determines the difficulty of finding the optimal point empirically. So, for example, the intuitively set point <italic>D</italic>
<sub>
<italic>operator</italic>
</sub> {540; &#x2212;390; 290} is characterized by total energy costs equal to: 23,91&#xa0;W&#xb7;h, and the point <italic>D</italic>
<sub>max</sub> {760; &#x2212;300; 290} is characterized by maximum energy costs equal to: 24.69&#xa0;W&#xb7;h.</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Graph of functions <inline-formula id="inf88">
<mml:math id="m91">
<mml:mrow>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>x</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>y</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>z</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>. <bold>(A)</bold> IR energy consumption map when laying one block, <bold>(B)</bold> IR energy consumption map when stacking a groupage cargo. Source Calculated and built by the authors.</p>
</caption>
<graphic xlink:href="fenrg-11-1129311-g003.tif"/>
</fig>
<p>Thus, as a result of the optimal choice of a set of movement trajectories, an effect is achieved, expressed in saving 1.56&#xa0;W&#xb7;h of electrical energy for laying one complete set of blocks.</p>
<p>
<xref ref-type="fig" rid="F4">Figure 4</xref> shows in the form of a graph the energy values for assembling a complex of blocks relative to the base point with minimum and maximum costs.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>Energy values for the assembly of a complex of blocks relative to the base point. Source Calculated and built by the authors.</p>
</caption>
<graphic xlink:href="fenrg-11-1129311-g004.tif"/>
</fig>
<p>The energy value for the point selected by the operator is within the interval E<sub>sum_max</sub> - E<sub>sum_min</sub>, so the energy savings can reach<disp-formula id="equ4">
<mml:math id="m92">
<mml:mrow>
<mml:mo>&#x2206;</mml:mo>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>24.69</mml:mn>
<mml:mo>&#x2013;</mml:mo>
<mml:mn>22.35</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>24.69</mml:mn>
<mml:mo>&#x2219;</mml:mo>
<mml:mn>100</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>9.48</mml:mn>
<mml:mo>%</mml:mo>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
</p>
<p>The total costs for the implementation of optimization measures can be found using the formula:<disp-formula id="equ5">
<mml:math id="m93">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mi mathvariant="normal">exp</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">p</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">m</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
</disp-formula>where E<sub>alg</sub> is the total energy costs for the implementation of the algorithm; E<sub>exp</sub> is the energy spent on conducting an experiment to measure the energy and time costs for each movement within a certain complex of movements; E<sub>program</sub> is the energy spent on the operation of the software of an external device (user PC) that implements the developed optimization algorithms and forms the RTC control program optimized according to the selected criterion (minimum time or energy).</p>
<p>The cost of electrical energy for each movement (<xref ref-type="table" rid="T1">Table 1</xref>) in total with the cost of return movements to the home position amounted to<disp-formula id="equ6">
<mml:math id="m94">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mi>exp</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>680.8</mml:mn>
<mml:mo>&#x2219;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1361.6</mml:mn>
<mml:mi mathvariant="normal">W</mml:mi>
<mml:mo>&#x2219;</mml:mo>
<mml:mi mathvariant="normal">h</mml:mi>
</mml:mrow>
</mml:math>
</disp-formula>Since the time spent on the implementation of the optimization algorithm on a PC is 1&#xa0;h, the cost of electrical energy for computing operations is equal to E<sub>program</sub> &#x3d; 250&#xa0;W&#x2219;h (the average value is assumed).</p>
<p>Then the total cost of optimization measures is equal to<disp-formula id="equ7">
<mml:math id="m95">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">l</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:mo>&#x3d;</mml:mo>
</mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mi>exp</mml:mi>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi mathvariant="normal">E</mml:mi>
<mml:mrow>
<mml:mi mathvariant="normal">p</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
<mml:mi mathvariant="normal">o</mml:mi>
<mml:mi mathvariant="normal">g</mml:mi>
<mml:mi mathvariant="normal">r</mml:mi>
<mml:mi mathvariant="normal">a</mml:mi>
<mml:mi mathvariant="normal">m</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1361.6</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>250</mml:mn>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1611.6</mml:mn>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi mathvariant="normal">W</mml:mi>
<mml:mo>&#x2219;</mml:mo>
<mml:mi mathvariant="normal">h</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</disp-formula>
</p>
<p>Since the obtained value of the cost of electrical energy for a single implementation of the proposed algorithm is comparable to the cost of conducting a robotic operation, the use of the algorithm seems to be the most profitable in conditions of continuous in-line production.</p>
<p>Because E<sub>sum_max</sub> &#x3d; 24.69&#xa0;W&#x2219;h, and E<sub>sum_min</sub> &#x3d; 22.35&#xa0;W&#x2219;h, the one-time energy costs for the implementation of the algorithm (E<sub>alg</sub>) will pay off in<disp-formula id="equ8">
<mml:math id="m96">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>g</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>x</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>u</mml:mi>
<mml:mi>m</mml:mi>
<mml:mo>_</mml:mo>
<mml:mi>m</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mn>1611.6</mml:mn>
<mml:mrow>
<mml:mn>24.69</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>22.35</mml:mn>
</mml:mrow>
</mml:mfrac>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>688.71</mml:mn>
<mml:mo>.</mml:mo>
</mml:mrow>
</mml:math>
</disp-formula>
</p>
<p>Thus, the implementation of the proposed algorithm will pay off after 689 technological cycles and then will bring net profit.</p>
</sec>
<sec sec-type="conclusion" id="s4">
<title>4 Conclusion</title>
<p>Thus, the presented research results demonstrate the possibility of a significant reduction in the energy intensity of the process of robotic stacking of blocks on a pallet, which ultimately reduces the cost of storing cargo in specialized premises within the strategic reserve, including through the use of the proposed solutions not only at the stage of primary assembly at the manufacturer, but also on robotic cargo sorting sites inside specialized storage locations. Thus, the potential for saving electrical energy with a typical variant of assembling cargo on a pallet can be up to 10%.</p>
<p>The proposed mathematical model and automated algorithms for its synthesis allow, with minimal time, information and intellectual costs, to set up a simulation model of RTP taking into account its specifics and implement a method for finding optimal parameters of its functioning: An optimal set of motion trajectories, energy consumption, execution time, RC positioning point.</p>
<p>As promising tasks for the development of the proposed topic, it seems appropriate to consider the influence of the rotation angle of the local coordinate system of the loading unit in the loading zone. In addition, it would be appropriate to ensure synchronization of RC consumption models and the robot in the case of laying a single layer by the robot with subsequent positioning of the RC of the local cargo base.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s5">
<title>Data availability statement</title>
<p>The original contributions presented in the study are included in the article/supplementary material, further inquiries can be directed to the corresponding author.</p>
</sec>
<sec id="s6">
<title>Author contributions</title>
<p>All authors listed have made a substantial, direct, and intellectual contribution to the work and approved it for publication.</p>
</sec>
<sec id="s7">
<title>Funding</title>
<p>The study was carried out as part of the activities of the Consortium for Sustainable Development and Technological Leadership and Research and Development Work No &#x412;&#x41d;002/2020, funded by Komsomolsk-na-Amure State University. The study was carried out using the equipment of the Scientific educational center &#xab;Industrial robotics and advanced industrial technologies&#xbb;.</p>
</sec>
<sec sec-type="COI-statement" id="s8">
<title>Conflict of interest</title>
<p>The authors declare that the research was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="disclaimer" id="s9">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Anistrantsev</surname>
<given-names>A. A.</given-names>
</name>
<name>
<surname>Bespalova</surname>
<given-names>O. N.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Optimization of trajectories of robotic system manipulator for vegetable crop harvesting</article-title>. <source>Casp. Past. future, present</source> <volume>12</volume>, <fpage>75</fpage>&#x2013;<lpage>80</lpage>.</citation>
</ref>
<ref id="B2">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Cao</surname>
<given-names>H. J.</given-names>
</name>
<name>
<surname>Zhou</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Jiang</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Hon</surname>
<given-names>K. K. B.</given-names>
</name>
<name>
<surname>Yi</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Dong</surname>
<given-names>C. Y.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>An integrated processing energy modeling and optimization of automated robotic polishing system</article-title>. <source>Robot. Comput. Integr. Manuf.</source> <volume>65</volume>, <fpage>101973</fpage>. <pub-id pub-id-type="doi">10.1016/j.rcim.2020.101973</pub-id>
</citation>
</ref>
<ref id="B3">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Efimov</surname>
<given-names>A. Y.</given-names>
</name>
<name>
<surname>Gorkavyy</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Egorova</surname>
<given-names>V. P.</given-names>
</name>
<name>
<surname>Gorkavyy</surname>
<given-names>A. I.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Optimization of technological parameters of robotized mechanical processing processes of aviation products. Current problems and ways of industry development: Equipment and technologies</article-title>. <source>Lect. Notes Netw. Syst.</source> <volume>200</volume>. <pub-id pub-id-type="doi">10.1007/978-3-030-69421-0_22</pub-id>
</citation>
</ref>
<ref id="B4">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Frolov</surname>
<given-names>A. V.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Installation of automatic welding of elements of ship pipelines</article-title>. <source>Marine Intellectual Technologies</source>, &#x422;. 2. &#x2013; &#x2116; <volume>2</volume> (<issue>52</issue>), <fpage>91</fpage>&#x2013;<lpage>96</lpage>. <pub-id pub-id-type="doi">10.37220/MIT.2021.52.2.057</pub-id>
</citation>
</ref>
<ref id="B5">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Frolov</surname>
<given-names>A. V.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>The experience of the portal machine control system modernizing for automatic arc welding and surfacing in a shielded gas</article-title>. <source>Lect. Notes Netw. Syst.</source> <volume>200</volume>, <fpage>622</fpage>&#x2013;<lpage>631</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-69421-0_66</pub-id>
</citation>
</ref>
<ref id="B6">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Glorot</surname>
<given-names>X.</given-names>
</name>
<name>
<surname>Bengio</surname>
<given-names>Y.</given-names>
</name>
</person-group> (<year>2010</year>). &#x201c;<article-title>Understanding the difficulty of training deep feedforward neural networks</article-title>,&#x201d; in <conf-name>Proceedings of the International Conference on Artificial Intelligence and Statistics (AISTATS&#x2019;10). Society for Artificial Intelligence and Statistics</conf-name>, <conf-loc>venue</conf-loc>, <fpage>249</fpage>&#x2013;<lpage>256</lpage>.</citation>
</ref>
<ref id="B7">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gordin</surname>
<given-names>S. A.</given-names>
</name>
<name>
<surname>Kozlova</surname>
<given-names>O. V.</given-names>
</name>
<name>
<surname>Zaychenko</surname>
<given-names>I. V.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Using the capabilities of neural networks to adapt the parameters of PID regulation in automatic control systems of low-power boilers</article-title>. <source>Int. Multi-Conference Industrial Eng. Mod. Technol. FarEastCon</source> <volume>2020</volume>, <fpage>9271418</fpage>. <pub-id pub-id-type="doi">10.1109/FarEastCon50210.2020.9271418</pub-id>
</citation>
</ref>
<ref id="B8">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gorkavyy</surname>
<given-names>M. A.</given-names>
</name>
<name>
<surname>Egorova</surname>
<given-names>V. P.</given-names>
</name>
<name>
<surname>Efimov</surname>
<given-names>A. Y.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Process automation for robot-based manufacturing components of prospective aviation complexes. Current problems and ways of industry development: Equipment and technologies</article-title>. <source>Lect. Notes Netw. Syst.</source> <volume>200</volume>. <pub-id pub-id-type="doi">10.1007/978-3-030-69421-0_20</pub-id>
</citation>
</ref>
<ref id="B9">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Ivanov</surname>
<given-names>Y. S.</given-names>
</name>
<name>
<surname>Zhiganov</surname>
<given-names>S. V.</given-names>
</name>
<name>
<surname>Ivanova</surname>
<given-names>T. I.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Intelligent deep neuro-fuzzy system of abnormal situation recognition for transport systems</article-title>. <source>Lect. Notes Netw. Syst.</source> <volume>200</volume>, <fpage>224</fpage>&#x2013;<lpage>233</lpage>. <pub-id pub-id-type="doi">10.1007/978-3-030-69421-0_24</pub-id>
</citation>
</ref>
<ref id="B10">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kaczmarek</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Borys</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2016</year>). <source>Wykorzystanie robot&#xf3;w przemys&#x142;owych w przemy&#x15b;le spo&#x17c;ywczym. Mechanik nr 07/2016 - XX mi&#x119;dzynarodowa szko&#x142;a komputerowego wspomagania projektowania, wytwarzania i eksploatacji</source>. <publisher-loc>China</publisher-loc>.</citation>
</ref>
<ref id="B11">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kozhevnikov</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Chumakov</surname>
<given-names>O. A.</given-names>
</name>
<name>
<surname>Ilyushin</surname>
<given-names>I. E.</given-names>
</name>
<name>
<surname>Loboreva</surname>
<given-names>L. A.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Methods and algorithms for generating program trajectories of robotic manipulators in the process of arc welding</article-title>. <source>Rep. Belarusian State Univ. Inf. Radioelectron.</source>, &#x2116; <volume>1</volume> (<issue>119</issue>)., <fpage>19</fpage>&#x2013;<lpage>25</lpage>.</citation>
</ref>
<ref id="B12">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kozhevnikov</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Chumakov</surname>
<given-names>O. A.</given-names>
</name>
<name>
<surname>Shemenkov</surname>
<given-names>V. M.</given-names>
</name>
<name>
<surname>Ilyushin</surname>
<given-names>I. E.</given-names>
</name>
<name>
<surname>Yurkina</surname>
<given-names>A. A.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Optimization of trajectories of industrial robotic manipulators for laser cutting</article-title>. <source>Bull. Belarusian-Russian Univ.</source>, &#x2116; <volume>2</volume> (<issue>67</issue>)., <fpage>21</fpage>&#x2013;<lpage>30</lpage>.</citation>
</ref>
<ref id="B13">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kozhevnikov</surname>
<given-names>M. M.</given-names>
</name>
<name>
<surname>Ilyushin</surname>
<given-names>I. E.</given-names>
</name>
<name>
<surname>Starovoitov</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Kosyrev</surname>
<given-names>V. N.</given-names>
</name>
</person-group> (<year>2016</year>). <article-title>Planning the trajectories of robot manipulators in the technological process of point contact welding</article-title>. <source>Bull. Gomel State Tech. Univ. named after P.O. Sukhoi</source>, &#x2116; <volume>2</volume> (<issue>65</issue>)., <fpage>3</fpage>&#x2013;<lpage>10</lpage>.</citation>
</ref>
<ref id="B14">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kuka Roboter GmbH</surname>
</name>
</person-group> (<year>2016</year>) <source>KUKA Robot Language (KRL) reference guide realise</source> 4.1. <publisher-loc>Augsburg, Germany.</publisher-loc>
</citation>
</ref>
<ref id="B15">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kuka Roboter GmbH</surname>
</name>
</person-group> (<year>2014</year>). <source>KUKA system software 8.3 operating and programming instructions for system integrators</source>. <publisher-loc>Augsburg, Germany</publisher-loc>. <comment>(KSS 8.3 SI V3)</comment>.</citation>
</ref>
<ref id="B16">
<citation citation-type="book">
<person-group person-group-type="author">
<name>
<surname>Kuka Roboter GmbH</surname>
</name>
</person-group> (<year>2016</year>). <source>KUKA System Software 8.3 Programming and operating instruction for end user</source>. <publisher-loc>Augsburg, Germany</publisher-loc>. <comment>(KSS 8.3 END V5)</comment>.</citation>
</ref>
<ref id="B17">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Marakhimov</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Avazjon</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Khudaybergenov</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>2018</year>). <article-title>Neuro-fuzzy identification of nonlinear dependencies</article-title>. <source>Bull. Natl. Univ. Uzbekistan Math. Nat. Sci.</source> <volume>1</volume>.</citation>
</ref>
<ref id="B18">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mart&#xed;nez</surname>
<given-names>C. A.</given-names>
</name>
<name>
<surname>Vel&#xe1;squez</surname>
<given-names>J. D.</given-names>
</name>
</person-group> (<year>2011</year>). <article-title>Analysis of nonlinear dependences using artificial neural networks</article-title>. <source>Rev. Fac. Ing. Univ. Antioquia, N.</source> <volume>60</volume>, <fpage>182</fpage>&#x2013;<lpage>193</lpage>.</citation>
</ref>
<ref id="B19">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Paesa</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Dewulfa</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Vander Elsta</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Kellensb</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Slaetsa</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2014</year>). <article-title>Energy efficient trajectories for an industrial ABB robot</article-title>. <source>Procedia CIRP</source> <volume>15</volume>, <fpage>105</fpage>&#x2013;<lpage>110</lpage>. <pub-id pub-id-type="doi">10.1016/j.procir.2014.06.043</pub-id>
</citation>
</ref>
<ref id="B20">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Parisi</surname>
<given-names>F.</given-names>
</name>
<name>
<surname>Mangini</surname>
<given-names>A. M.</given-names>
</name>
<name>
<surname>Fanti</surname>
<given-names>M. P.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Optimal trajectory planning for a robotic manipulator palletizing tasks</article-title>. <conf-name>Proceedings of the 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC)</conf-name>, 2901&#x2013;2906. <conf-loc>Toronto, ON, Canada</conf-loc> .</citation>
</ref>
<ref id="B21">
<citation citation-type="confproc">
<person-group person-group-type="author">
<name>
<surname>Qiu</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Chen</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Xiao</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Gu</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>C.</given-names>
</name>
<name>
<surname>Yang</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2021</year>). &#x201c;<article-title>A feasible method for evaluating energy consumption of industrial robots</article-title>,&#x201d; in <conf-name>Proceedings of the 2021 IEEE 16th Conference on Industrial Electronics and Applications (ICIEA)</conf-name>, <conf-loc>Chengdu, China</conf-loc>, <fpage>1073</fpage>&#x2013;<lpage>1078</lpage>. <pub-id pub-id-type="doi">10.1109/ICIEA51954.2021.9516218</pub-id>
</citation>
</ref>
<ref id="B22">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sozykin</surname>
<given-names>A. V.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Review of methods for training deep neural networks</article-title>. <source>Bull. South Ural State Univ. Ser. Comput. Math. Inf.</source> <volume>6</volume> (<issue>3</issue>), <fpage>28</fpage>&#x2013;<lpage>59</lpage>.</citation>
</ref>
<ref id="B24">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tretyak</surname>
<given-names>A. V.</given-names>
</name>
<name>
<surname>Kapezkiy</surname>
<given-names>I. O.</given-names>
</name>
<name>
<surname>Vereschagina</surname>
<given-names>E. A.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Taking advantage of low-level programming languages for a new developing programming language</article-title>. <source>Mod. Sci. Actual Problems Theory Pract. Ser. Nat. Tech. Sci.</source>, &#x2116; <volume>2</volume>., <fpage>104</fpage>&#x2013;<lpage>107</lpage>.</citation>
</ref>
<ref id="B25">
<citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname>Voskoglou</surname>
<given-names>M. G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Fuzzy logic in control theory. Digital transformation technology</article-title>. <source>Lect. Notes Netw. Syst.</source> <volume>224</volume>.</citation>
</ref>
</ref-list>
</back>
</article>