Please use this identifier to cite or link to this item: https://er.nau.edu.ua/handle/NAU/35609
Title: Method of path constructing of information robot on the basis of unmanned aerial vehicle
Authors: Tachinina, O.M.
Lysenko, O.I.
Keywords: unmanned aerial vehicles; information robot; compound dynamic system; optimal control; branching path
Issue Date: 2017
Publisher: Proсeedings of the National Aviation University. –K.: NAU, 2017. –№ 4(73). – P. 60-67.
Series/Report no.: ;N4(73)
Abstract: 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.
URI: http://er.nau.edu.ua/handle/NAU/35609
ISSN: 1813-1166
2306-1472
Appears in Collections:Наукові статті кафедри автоматизації та енергоменеджменту

Files in This Item:
File Description SizeFormat 
Тачиніна.pdfСтаття311.06 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.