信息与控制2013，Vol.42Issue(4)：416-422,7.DOI:10.3724/SP.J.1219.2013.00416
基于不同遗忘因子的递推子空间辨识算法策略性能比较
Performance Comparison of Recursive Subspace Identification Algorithms Based on Different Forgetting Factors
黄金峰 1张合新 2韩勇 1吴坤1
作者信息
- 1. 第二炮兵工程大学自动控制系,陕西西安710025
- 2. 中国人民解放军第96115部队,吉林通化134008
- 折叠
摘要
Abstract
An unbiased update form of Hankel matrix is designed based on both the data form with forgetting factor and the construction of Hankel matrix.On this basis,a new recursive subspace identification algorithm with variable forgetting factor is proposed.The modified method,the fixed forgetting factor method and the traditional variable forgetting factor method are compared from the aspects of the approach degree to the unbiased update Hankel matrix,the performance in tracking system parameters and the distance sensitivity,etc.Simulation results show that the performance of the modified method is better than the others.关键词
子空间辨识/递推算法/固定遗忘因子/变遗忘因子Key words
subspace identification/ recursive algorithm/ fixed forgetting factor/ variable forgetting factor分类
信息技术与安全科学引用本文复制引用
黄金峰,张合新,韩勇,吴坤..基于不同遗忘因子的递推子空间辨识算法策略性能比较[J].信息与控制,2013,42(4):416-422,7.
