Наукові статті кафедри автоматизації та енергоменеджменту
Permanent URI for this collectionhttp://er.nau.edu.ua/handle/NAU/19603
Browse
Browsing Наукові статті кафедри автоматизації та енергоменеджменту by Author "Tachinina, O.M."
Now showing 1 - 3 of 3
- Results Per Page
- Sort Options
Item Method of dynamic programming for information robot’s branching path optimization(Electronics and control systems.– K.: NAU, 2017. – № 3(53). – P. 100-105., 2017) Tachinina, O.M.The article describes and proves the necessary and sufficient conditions for optimality of information robot’s branching path with branching profile containing the central and lateral branches without interaction of subsystems after separation. The formulated conditions make it possible to determine the optimal coordinates and instants of the branching time of the trajectory, as well as the optimal controls and trajectories of the components of the information robot to the specified purposes along the hotel branches of the trajectory after they are separated from the carrier. The practical importance of the obtained conditions lies in the fact that it is possible to develop on its base the computational procedures for on-line calculation of optimal branching paths of such compound dynamical systems.Item Method of path constructing of information robot on the basis of unmanned aerial vehicle(Proсeedings of the National Aviation University. –K.: NAU, 2017. –№ 4(73). – P. 60-67., 2017) Tachinina, O.M.; Lysenko, O.I.The purpose of this article is to present a method for constructing the branching path of the information robot (IR) that is a compound dynamic system (CDS) allowing us to formulate, in terms of optimal control theory, conditions of CDS path modeling with an arbitrary branching scheme. Methods: The article describes a method of theory of discontinuous dynamical systems optimal control, which is used to prove the optimality conditions for phase coordinates in the points of structural transformations of the IR’s branching path. Results: The necessary conditions for the optimality of the branching path along which the IR moves are defined. These conditions allow using standard subprograms to solve ordinary differential and algebraic equations and thereby to solve the task of modeling the optimal path of CDS with an arbitrary branching scheme. Discussion: The proposed method is the methodological basis for definition the computing algorithms allowing to simulate the optimal CDS paths. The proposed procedure of optimal branching paths simulating is part of the IR’s computer-aided design software and can be used to define computing algorithms taking into account the peculiarity of information-telecommunication interaction of CDS’s specific elements.Item Optimal principle for dynamical system with alterative orbiting(Electronics and Control Systems 2016. N 4(50).- p.108-113, 2016) Lysenko, O.I.; Tachinina, O.M.Lagrange problem with the account of functional limitation at any functional limitations at any moment in a given interval is presented. The required conditions for optimal trajectories of the determinated dynamic system synthesized as space vehicle trajectories have been obtained.