Asymptotically Optimal RLS Adaptive Identification Algorithms

DOI Web Site 15 References

Bibliographic Information

Other Title
  • 漸近的に最適なRLS適応同定アルゴリズム
  • ゼンキンテキ ニ サイテキ ナ RLS テキオウ ドウテイ アルゴリズム

Search this article

Abstract

A major, and yet unresolved, problem has been the choice of the gain adjusting parameter in some parameter estimation algorithms. This paper presents an adaptive setting method of the forgetting factor for estimating time-varying parameters when the Recursive Least Squares (RLS) algorithm is used. The method is to choose the forgetting factor λ so as to minimize the performance index defined by E {ε2t (λ)} where εt (λ) is the prediction error based on some λ. This is concretely done by solving the minimization problem of a certain object function with respect to λ. It is shown that this object function is unimodal with respect to λ and thus the minimization can be attained by using the stochastic Newton method. As a result, the proposed method becomes asymptotically optimal. The resultant algorithm can be executed by linking the minimization routine with RLS.<BR>Numerical examples indicate acceptable performance.

Journal

References(15)*help

See more

Keywords

Details 詳細情報について

Report a problem

Back to top