Journal of Automation and Information Sciences
Publicou 12 edições por ano
ISSN Imprimir: 1064-2315
ISSN On-line: 2163-9337
SJR:
0.173
SNIP:
0.588
CiteScore™::
2
Indexed in
To the Problem of Determining the Set of Attainability of a Controlled Linear System
Volume 37,
Edição 7, 2005,
pp. 10-19
DOI: 10.1615/J Automat Inf Scien.v37.i7.20
RESUMO
The algorithm of construction of the set of attainability of a controlled linear system with discrete time is proposed. The algorithm is based upon the idea of the use a compression (expansion) operator of the space. Along with the assumption that a disturbance was scalar, it enabled to get the constructive solution of the problem in the class of ellipsoid sets, which approximated the exact solution, using comparatively simple analytic tools. The results of computational modeling are given.
CITADO POR
-
Sholokhov O. V., Minimum-volume ellipsoidal approximation of the sum of two ellipsoids, Cybernetics and Systems Analysis, 47, 6, 2011. Crossref
617 Visualizações do artigo
2 downloads de artigos
Métricas
Artigos com conteúdo semelhante:
Última edição
Modeling of Configurations Formed when Using Microneedle Systems
Properties of Large Deviations of Empirical Estimates in a Stochastic Optimization Problem for a Homogeneous Random Field
The Dynamics of One Arms Race Mathematical Model with a Delay
Some Ways to Modeling Input Data for Information Search in the Library of Standards when Solving Semantics Problems
Method for Constructing Primitive Polynomials for Cryptographic Subsystems of Dependable Automated Systems
Complete Asymptotics of Approximations by Certain Singular Integrals in Mathematical Modeling
Index, Volume 52, 2020