Approximation of attainability domains of nonlinear discrete-time controlled dynamical systems
Автор: Shorikov Audrey F., Bulaev Vladimir V., Goranov Aleksandr Yu., Kalev Vitaliy I.
Журнал: Вестник Бурятского государственного университета. Математика, информатика @vestnik-bsu-maths
Рубрика: Управляемые системы и методы оптимизации
Статья в выпуске: 1, 2018 года.
Бесплатный доступ
The article deals with the problem of constructing and approximating the attainability domains of a nonlinear discrete controlled dynamical system. The object of study is the class of controlled dynamical systems described by vector nonlinear recurrent equations. The initial nonlinear discrete-time model is transformed to a discrete linear form with respect to the reference phase trajectory. It is assumed that the phase vector of the system and the control parameter are constrained by convex, closed and bounded polyhedral sets with a finite number of vertices in the corresponding finite-dimensional vector spaces. We have given a description of the general recurrent algebraic method for constructing domains of attainability and its modification. In conclusion the article describes the results of computer simulation and comparative analysis of the attainability domains of approximation accuracy for specific nonlinear discretetime dynamical systems using the attainability domains of the corresponding linear discrete-time dynamical systems constructed with general and modified recurrent algebraic methods.
Nonlinear discrete-time controlled dynamical system, approximation of attainability domains, convex polyhedra, linear mathematical programming, simplex method
Короткий адрес: https://sciup.org/14835247
IDR: 14835247 | DOI: 10.18101/2304-5728-2018-1-52-65