𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A search-free adaptive control algorithm

✍ Scribed by P. I. Verchenko

Book ID
105058021
Publisher
Springer US
Year
1976
Tongue
English
Weight
244 KB
Volume
12
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A new recursive identification algorithm
A new recursive identification algorithm for singularity free adaptive control
✍ M. Prandini; M.C. Campi πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 99 KB

Reportedly, guaranteeing the controllability of the estimated system is a crucial problem in adaptive control. In this paper, we introduce a least-squares-based identiΓΏcation algorithm for stochastic SISO systems, which secures the uniform controllability of the estimated system and presents closed-

Application of identification-free algor
Application of identification-free algorithms for adaptive control
✍ J. MarΕ‘Γ­k; V. Strejc πŸ“‚ Article πŸ“… 1989 πŸ› Elsevier Science 🌐 English βš– 461 KB

In order to facilitate the utilization of single-chip microcomputers for adaptive control some extremely simple algorithms have been developed. The simplicity has been achieved by using performance criteria based on geometrical properties of the control error process while the adaptation acts like a

A new adaptive LQG control algorithm
A new adaptive LQG control algorithm
✍ Kailash Birmiwal πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 463 KB

A new control algorithm is developed for the discrete time, finite horizon adaptive LQG problem. In the new algorithm, randomization over linear control functions is performed at future stages to find a deterministic desired control U ( k ) at the current stage. This randomized linear control policy

An improved adaptive string searching al
An improved adaptive string searching algorithm
✍ Z. Liu; X. Du; N. Ishi πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 56 KB

Sunday's OM algorithm can reduce the number of character comparisons by making use of information of character distribution in an alphabet. Smith's adaptive algorithm uses dynamic statistics to reduce comparisons, and its performance is close to that of the OM algorithm in the number of character co