TY - JOUR
T1 - Recursive Least Squares Identification with Variable-Direction Forgetting via Oblique Projection Decomposition
AU - Zhu, Kun
AU - Yu, Chengpu
AU - Wan, Yiming
N1 - Publisher Copyright:
© 2014 Chinese Association of Automation.
PY - 2022/3/1
Y1 - 2022/3/1
N2 - In this paper, a new recursive least squares (RLS) identification algorithm with variable-direction forgetting (VDF) is proposed for multi-output systems. The objective is to enhance parameter estimation performance under non-persistent excitation. The proposed algorithm performs oblique projection decomposition of the information matrix, such that forgetting is applied only to directions where new information is received. Theoretical proofs show that even without persistent excitation, the information matrix remains lower and upper bounded, and the estimation error variance converges to be within a finite bound. Moreover, detailed analysis is made to compare with a recently reported VDF algorithm that exploits eigenvalue decomposition (VDF-ED). It is revealed that under non-persistent excitation, part of the forgotten subspace in the VDF-ED algorithm could discount old information without receiving new data, which could produce a more ill-conditioned information matrix than our proposed algorithm. Numerical simulation results demonstrate the efficacy and advantage of our proposed algorithm over this recent VDF-ED algorithm.
AB - In this paper, a new recursive least squares (RLS) identification algorithm with variable-direction forgetting (VDF) is proposed for multi-output systems. The objective is to enhance parameter estimation performance under non-persistent excitation. The proposed algorithm performs oblique projection decomposition of the information matrix, such that forgetting is applied only to directions where new information is received. Theoretical proofs show that even without persistent excitation, the information matrix remains lower and upper bounded, and the estimation error variance converges to be within a finite bound. Moreover, detailed analysis is made to compare with a recently reported VDF algorithm that exploits eigenvalue decomposition (VDF-ED). It is revealed that under non-persistent excitation, part of the forgotten subspace in the VDF-ED algorithm could discount old information without receiving new data, which could produce a more ill-conditioned information matrix than our proposed algorithm. Numerical simulation results demonstrate the efficacy and advantage of our proposed algorithm over this recent VDF-ED algorithm.
KW - Non-persistent excitation
KW - oblique projection
KW - recursive least squares (RLS)
KW - variable-direction forgetting (VDF)
UR - http://www.scopus.com/inward/record.url?scp=85121374140&partnerID=8YFLogxK
U2 - 10.1109/JAS.2021.1004362
DO - 10.1109/JAS.2021.1004362
M3 - Article
AN - SCOPUS:85121374140
SN - 2329-9266
VL - 9
SP - 547
EP - 555
JO - IEEE/CAA Journal of Automatica Sinica
JF - IEEE/CAA Journal of Automatica Sinica
IS - 3
ER -