The modified algorithm for the linear discrete-time dynamic systems reachable sets computation
Автор: Bulaev V.V., Osipov I.O.
Рубрика: Управление в технических системах
Статья в выпуске: 1 т.18, 2018 года.
Бесплатный доступ
The paper considered the modified general recursion algebraic method for the linear discrete-time dynamic systems reachable sets computation. The algorithms of application programs for reachable sets constructing is described. The comparative analysis of original (Shorikov A.F. [Minimax Estimation and Control in Discrete-Time Dynamic Systems]. Yekaterinburg. Ural State University Publ., 1997. 242 p. (in Russ.)) and suggest algorithms is provided by giving of numerical example.
Reachable sets, discrete-time dynamic system, convex sets
Короткий адрес: https://sciup.org/147155247
IDR: 147155247 | DOI: 10.14529/ctcr180106
