Abstract

Time-varying system identification is an appealing but challenging research area. Existing identification algorithms are usually subject to either low estimation accuracy or bad numerical stability. These deficiencies motivate the development of an iterative learning identification algorithm in this paper. Three distinguished features of the proposed method result in the achievement of high estimation accuracy and high numerical stability: i) recursion along the iteration axis, ii) bias compensation, and iii) singular value decomposition (SVD). Firstly, an extra iteration axis associated with the original time axis is introduced in the parameter estimation process. A norm-optimal identification approach with the balance between convergence speed and noise robustness is then proposed along the iteration axis, followed by further analysis on the accuracy and the numerical stability. Secondly, in order to eliminate the estimation bias in the presence of noise and thus to improve the accuracy, a bias compensation algorithm along the iteration axis is proposed. Thirdly, a SVD-based update algorithm for the covariance matrix is developed to avoid the possible numerical instability during iterations. Numerical examples are finally provided to validate the algorithm and confirm its effectiveness.

Highlights

  • System identification has long been an appealing area in both theory research and practical applications [1]–[3]

  • Example 1 is provided to verify the merit of the proposed enhanced norm-optimal iterative learning identification (ENOILI) algorithm versus conventional recursive algorithms, while example 2 is provided to show the enhanced performance compared with the existing iterative algorithms

  • EXAMPLE 2: COMPARISON RESULTS WITH EXISTING ITERATIVE IDENTIFICATION ALGORITHMS To further show the enhanced numerical stability and estimation accuracy, here we make a comparison between the proposed ENOILI algorithm and two existing iterative algorithms which are the iterative learning approach based on least squares (ILLS) algorithm proposed in [28] and the iterative learning recursive least squares (ILRLS) algorithm proposed in [29]

Read more

Summary

INTRODUCTION

System identification has long been an appealing area in both theory research and practical applications [1]–[3]. ILI is first introduced in [24] where an ILC-based method is proposed for the identification of linear time-invariant (LTI) systems This method is extended in [25] to achieve robustness against noise through a Kalman filter, and in [26] to estimate parameters in the presence of input disturbance. Compared with RLS, ILLS and ILRLS achieve no-lag estimation of time-varying parameters These methods, result in biased estimation for output-error (OE) systems in spite of their unbiased estimation for autoregressive systems with exogenous input (ARX).

PRELIMINARIES
ACCURACY ENHANCEMENT BY BIAS COMPENSATION
NOISE VARIANCE ESTIMATION
COST FUNCTION ITERATIVE UPDATE
NUMERICAL STABILITY ENHANCEMENT BY SVD
SIMULATION RESULTS
COMPARISON RESULTS WITH CONVENTIONAL RECURSIVE IDENTIFICATION ALGORITHMS
EXAMPLE 2
CONCLUSION
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.