𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On necessary assumptions in discrete-time model reference adaptive control

✍ Scribed by Daniel E. Miller


Publisher
John Wiley and Sons
Year
1996
Tongue
English
Weight
628 KB
Volume
10
Category
Article
ISSN
0890-6327

No coin nor oath required. For personal study only.

✦ Synopsis


In this paper we investigate the discrete-time model reference adaptive control problem, ascertain the extent to which the classical assumptions are necessary and provide several suitably modified inviolable requirements. In particular, we show that under a closed-loop causality constraint the problem is solvable only ifthere is an upper bound on the plant relative degree and the plant zeros outside the open unit disc lie in a finite set. We also derive a bound on the achievable asymptotic performance in the event that these requirements are not met.


πŸ“œ SIMILAR VOLUMES


Discrete-time combined model reference a
✍ Manuel A. Duarte; Rodrigo F. Ponce πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 184 KB πŸ‘ 2 views

The discrete-time version of continuous-time combined model reference adaptive control (CMRAC) is presented in this paper. A global stability proof of the overall adaptive scheme is given using arguments similar to those used in discrete-time direct model reference adaptive control (DMRAC) but prope

On the transient behaviour in discrete-t
✍ Aniruddha Datta πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 466 KB

This paper shows that a result recently obtained for arbitrarily improving the zero-state transient performance of a continuous-time model reference adaptive control scheme, does not have a counterpart in discrete-time. Using standard l~ optimal control theory, it is shown that unlike the continuous

A note on global convergence of adaptive
✍ Graciela Adriana GonzΓ‘lez πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 77 KB πŸ‘ 1 views

Adaptive control is applied to a particular class of SISO discrete-time non-linear systems. Global boundedness and convergence are obtained by introducing a modification to a classical adaptive scheme.