Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Adaptive control via finitely-convergent algorithms. / Bondarko, Vladimir; Yakubovich, Vladimir.
9th IFAC Workshop "Adaptation and Learning in Control and Signal Processing", ALCOSP'2007 - Final Program and Abstracts. PART 1. ed. International Federation of Automatic Control, 2007. p. 287-297 (IFAC Proceedings Volumes (IFAC-PapersOnline); Vol. 9, No. PART 1).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Adaptive control via finitely-convergent algorithms
AU - Bondarko, Vladimir
AU - Yakubovich, Vladimir
N1 - Copyright: Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - A short review of the method of finitely-convergent algorithms in the theory of adaptive systems is presented. The method was proposed in (Yakubovich, V.A., Recurrent Finite-convergent Algorithms to Solve the Systems of Inequalities, Dokl. Akad. Nauk SSSR, 1966, vol. 166, no. 6, pp. 1308-1311. English translation in Soviet Math. Dokl., 1966, vol. 7, pp. 300-304). The method consists of reduction of an adaptive control problem to a countable system of inequalities. A procedure of their solution plays a role of adaptation algorithm. It should converge in a finite time in a closed loop system. The method often allows to obtain suboptimal (in the minimax sense) adaptive control systems. Basic ideas and achievments of the method as well as some recent results are considered. Among them are adaptive control of sampled systems with time delay which is not a multiple of the sampling period. In this relation a problem of limiting zeros of sampled systems with delay arise. It is shown that limiting values of the sampling zeros have the same properties as zeros of Euler polynomials.
AB - A short review of the method of finitely-convergent algorithms in the theory of adaptive systems is presented. The method was proposed in (Yakubovich, V.A., Recurrent Finite-convergent Algorithms to Solve the Systems of Inequalities, Dokl. Akad. Nauk SSSR, 1966, vol. 166, no. 6, pp. 1308-1311. English translation in Soviet Math. Dokl., 1966, vol. 7, pp. 300-304). The method consists of reduction of an adaptive control problem to a countable system of inequalities. A procedure of their solution plays a role of adaptation algorithm. It should converge in a finite time in a closed loop system. The method often allows to obtain suboptimal (in the minimax sense) adaptive control systems. Basic ideas and achievments of the method as well as some recent results are considered. Among them are adaptive control of sampled systems with time delay which is not a multiple of the sampling period. In this relation a problem of limiting zeros of sampled systems with delay arise. It is shown that limiting values of the sampling zeros have the same properties as zeros of Euler polynomials.
KW - Adaptive control
KW - Finitely-convergent algorithms
KW - Generalized euler polynomials
KW - Sampling zeros
UR - http://www.scopus.com/inward/record.url?scp=79961057148&partnerID=8YFLogxK
U2 - 10.3182/20070829-3-ru-4911.00047
DO - 10.3182/20070829-3-ru-4911.00047
M3 - Conference contribution
AN - SCOPUS:79961057148
SN - 9783902661296
T3 - IFAC Proceedings Volumes (IFAC-PapersOnline)
SP - 287
EP - 297
BT - 9th IFAC Workshop "Adaptation and Learning in Control and Signal Processing", ALCOSP'2007 - Final Program and Abstracts
PB - International Federation of Automatic Control
ER -
ID: 71533388