|
|
Avtomatika i Telemekhanika, 2011, Issue 1, Pages 27–41
(Mi at1266)
|
|
|
|
This article is cited in 18 scientific papers (total in 18 papers)
Deterministic Systems
On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints
S. P. Zubova Voronezh State University, Voronezh, Russia
Abstract:
We derive full controllability criteria for a stationary dynamical system described by an algebro-differential relation with rectangular matrix coefficient. The derivation is done by multistage splitting of the spaces into subspaces in special and general cases. We construct a polynomial control and state of the descriptor system in case the system trajectory passes an arbitrary finite amount of checkpoints without projectors.
Citation:
S. P. Zubova, “On full controllability criteria of a descriptor system. The polynomial solution of a control problem with checkpoints”, Avtomat. i Telemekh., 2011, no. 1, 27–41; Autom. Remote Control, 72:1 (2011), 23–37
Linking options:
https://www.mathnet.ru/eng/at1266 https://www.mathnet.ru/eng/at/y2011/i1/p27
|
|