An efficient hierarchical identification method for general dual-rate sampled-data systems

For the lifted input–output representation of general dual-rate sampled-data systems, this paper presents a decomposition based recursive least squares (D-LS) identification algorithm using the hierarchical identification principle. Compared with the recursive least squares (RLS) algorithm, the proposed D-LS algorithm does not require computing the covariance matrices with large sizes and matrix inverses in each recursion step, and thus has a higher computational efficiency than the RLS algorithm. The performance analysis of the D-LS algorithm indicates that the parameter estimates can converge to their true values. A simulation example is given to confirm the convergence results.     

Recursive subspace identification subject to relatively slow time-varying load disturbance

In this paper, a recursive subspace identification method is proposed to identify linear time-invariant systems subject to load disturbance with relatively slow dynamics. Using the linear superposition principle, the load disturbance response is decomposed from the deterministic-stochastic system response in the form of a time-varying parameter. To ensure unbiased estimation of the deterministic system matrices, a recursive least-squares (RLS) identification algorithm is established with a fixed forgetting factor, while another RLS algorithm with an adaptive forgetting factor is constructed based on the output prediction error to quickly track the time-varying parameter of load disturbance response. By introducing a deadbeat observer to represent the deterministic system response, two extended observer Markov parameter matrices are constructed for recursive estimation. Consequently, the deterministic matrices are retrieved from the identified system Markov parameter matrices. The convergence of the proposed method is analysed with a proof. Two illustrative examples are shown to demonstrate the effectiveness and merit of the proposed identification method.     

Genetic least squares for system identification

The recursive least-squares algorithm with a forgetting factor has been extensively applied and studied for the on-line parameter estimation of linear dynamic systems. This paper explores the use of genetic algorithms to improve the performance of the recursive least-squares algorithm in the parameter estimation of time-varying systems. Simulation results show that the hybrid recursive algorithm (GARLS), combining recursive least-squares with genetic algorithms, can achieve better results than the standard recursive least-squares algorithm using only a forgetting factor.     

多元系统耦合带遗忘因子有限数据窗递推最小二乘辨识方法

针对多元线性或非线性回归系统, 将耦合辨识思想与带遗忘因子有限数据窗辨识理论相结合, 提出一种耦合带遗忘因子有限数据窗递推最小二乘辨识算法. 该算法每次递推计算时既不涉及矩阵求逆运算, 又可以克服数据饱和现象, 因此, 该算法不仅计算效率高, 而且可以快速地跟踪时变参数, 获得精确的参数估计. 通过辨识基于多元模型的永磁同步电机参数的实例, 验证了所提出算法的有效性和实用性.

     

A revisit to block and recursive least squares for parameter estimation

In this paper, the classical least squares (LS) and recursive least squares (RLS) for parameter estimation have been re-examined in the light of the present day computing capabilities. It has been demonstrated that for linear time-invariant systems, the performance of blockwise least squares (BLS) is always superior to that of RLS. In the context of parameter estimation for dynamic systems, the current computational capability of personal computers are more than adequate for BLS. However, for time-varying systems with abrupt parameter changes, standard blockwise LS may no longer be suitable due to its inefficiency in discarding “old” data. To deal with this limitation, a novel sliding window blockwise least squares approach with automatically adjustable window length triggered by a change detection scheme is proposed. Two types of sliding windows, rectangular and exponential, have been investigated. The performance of the proposed algorithm has been illustrated by comparing with the standard RLS and an exponentially weighted RLS (EWRLS) using two examples. The simulation results have conclusively shown that: (1) BLS has better performance than RLS; (2) the proposed variable-length sliding window blockwise least squares (VLSWBLS) algorithm can outperform RLS with forgetting factors; (3) the scheme has both good tracking ability for abrupt parameter changes and can ensure the high accuracy of parameter estimate at the steady-state; and (4) the computational burden of VLSWBLS is completely manageable with the current computer technology. Even though the idea presented here is straightforward, it has significant implications to virtually all areas of application where RLS schemes are used.     

基于动态遗忘因子递推最小二乘法的永磁同步电机参数辨识算法

针对固定遗忘因子递推最小二乘法(RLS)在永磁同步电机参数识别中难以同时保证快速性和鲁棒性的问题,提出一种动态调节遗忘因子大小的递推最小二乘参数识别算法.分析了遗忘因子对RLS算法的影响特性,以理论模型与实际模型输出的差值为变量构建遗忘因子调节函数,实现遗忘因子动态调整.仿真结果表明,相比于固定遗忘因子RLS算法,改进...     

一种不完全信息下递推辨识方法及收敛性分析

针对信号在网络环境下传输带来不完全信息使得在线参数辨识算法和收敛性困难的问题, 不同于传统递推最小二乘方法, 本文提出了一种不完全信息下递推辨识方法并分析其收敛性. 首先运用伯努利分布刻画引起不完全信息的数据丢包特性, 然后基于辅助模型方法补偿不完全信息并构造了新的数据信息矩阵, 并运用矩阵正交变换性质对数据信息矩阵进行QR分解, 推导了融合网络参数的递推辨识新算法, 理论证明了在不完全信息下递推参数辨识算法的收敛性. 最后仿真结果验证了所提方法的可行性和有效性.     

Adaptive discrete-time sliding-mode control of nonlinear systems described by Wiener models

In this paper, we propose an adaptive control scheme that can be applied to nonlinear systems with unknown parameters. The considered class of nonlinear systems is described by the block-oriented models, specifically, the Wiener models. These models consist of dynamic linear blocks in series with static nonlinear blocks. The proposed adaptive control method is based on the inverse of the nonlinear function block and on the discrete-time sliding-mode controller. The parameters adaptation are performed using a new recursive parametric estimation algorithm. This algorithm is developed using the adjustable model method and the least squares technique. A recursive least squares (RLS) algorithm is used to estimate the inverse nonlinear function. A time-varying gain is proposed, in the discrete-time sliding mode controller, to reduce the chattering problem. The stability of the closed-loop nonlinear system, with the proposed adaptive control scheme, has been proved. An application to a pH neutralisation process has been carried out and the simulation results clearly show the effectiveness of the proposed adaptive control scheme.     

Natural gradient-based recursive least-squares algorithm for adaptive blind source separation

This paper focuses on the problem of adaptive blind source separation (BSS). First, a recursive least-squares (RLS) whitening algorithm is proposed. By combining it with a natural gradient-based RLS algorithm for nonlinear principle component analysis (PCA), and using reasonable approximations, a novel RLS algorithm which can achieve BSS without additional pre-whitening of the observed mixtures is obtained. Analyses of the equilibrium points show that both of the RLS whitening algorithm and the natural gradient-based RLS algorithm for BSS have the desired convergence properties. It is also proved that the combined new RLS algorithm for BSS is equivariant and has the property of keeping the separating matrix from becoming singular. Finally, the effectiveness of the proposed algorithm is verified by extensive simulation results.     

Least squares based iterative algorithms for identifying Box–Jenkins models with finite measurement data

A least squares based iterative identification algorithm is developed for Box–Jenkins models (or systems). The proposed iterative algorithm can produce highly accurate parameter estimation compared with recursive approaches. The basic idea of the proposed iterative method is to adopt the interactive estimation theory: the parameter estimates relying on unknown variables are computed by using the estimates of these unknown variables which are obtained from the preceding parameter estimates. The numerical example indicates that the proposed iterative algorithm has fast convergence rates compared with the gradient based iterative algorithm.     

TH-UWB系统中基于自适应算法的接收机研究

提出了一种适用于跳时超宽带(TH-UWB)系统中的RAKE接收机方案。该方法利用基于梯度的可变遗忘因子的改进递推最小二乘(RLS)算法进行信道估计,并与基于经典RLS算法和基于最大似然概率(ML)算法的接收机方案进行对比。结果表明,这种新型RAKE接收机方案能够更有效地跟踪时变衰落信道的变化;在相同条件下,该方案能够提高系统性能,获得更小的误码率(BER)。     

A Learning Algorithm of CMAC Based on RLS

Conventionally, least mean square rule which can be named CMAC-LMS is used to update the weights of CMAC. The convergence ability of CMAC-LMS is very sensitive to the learning rate. Applying recursive least squares (RLS) algorithm to update the weights of CMAC, we bring forward an algorithm named CMAC-RLS. And the convergence ability of this algorithm is proved and analyzed. Finally, the application of CMAC-RLS to control nonlinear plant is investigated. The simulation results show the good convergence performance of CMAC-RLS. The results also reveal that the proposed CMAC-PID controller can reject disturbance effectively, and control nonlinear time-varying plant adaptively.     

Several multi-innovation identification methods

This paper considers connections between the cost functions of some parameter identification methods for system modelling, including the well known projection algorithm, stochastic gradient (SG) algorithm and recursive least squares (RLS) algorithm, and presents a modified SG algorithm by introducing the convergence index and a multi-innovation projection algorithm, a multi-innovation SG algorithm and a multi-innovation RLS algorithm by introducing the innovation length, aiming at improving the convergence rate of the SG and RLS algorithms. Furthermore, this paper derives an interval-varying multi-innovation SG and an interval-varying multi-innovation RLS algorithm in order to deal with missing data cases.     

Performance analysis of multi-innovation stochastic Newton recursive algorithms

The stochastic Newton recursive algorithm is studied for system identification. The main advantage of this algorithm is that it has extensive form and may embrace more performance with flexible parameters. The primary problem is that the sample covariance matrix may be singular with numbers of model parameters and (or) no general input signal; such a situation hinders the identification process. Thus, the main contribution is adopting multi-innovation to correct the parameter estimation. This simple approach has been proven to solve the problem effectively and improve the identification accuracy. Combined with multi-innovation theory, two improved stochastic Newton recursive algorithms are then proposed for time-invariant and time-varying systems. The expressions of the parameter estimation error bounds have been derived via convergence analysis. The consistence and bounded convergence conclusions of the corresponding algorithms are drawn in detail, and the effect from innovation length and forgetting factor on the convergence property has been explained. The final illustrative examples demonstrate the effectiveness and the convergence properties of the recursive algorithms.     

多变量系统的耦合梯度辨识算法与性能分析

针对多变量系统维数大、参数多、一般的辨识算法计算量大的问题, 基于耦合辨识概念, 推导多变量系统的耦合随机梯度算法, 利用鞅收敛定理分析算法的收敛性能. 算法的主要思想是将系统模型分解为多个单输出子系统,在子系统的递推辨识过程中, 将每个子系统的参数估计值耦合起来. 所提出算法与最小二乘算法和耦合最小二乘算法相比, 具有较少的计算量, 收敛速度可以通过引入遗忘因子得到改善. 性能分析表明了所提出算法收敛, 仿真实例验证了算法的有效性.

     

非平稳信号的递推最小二乘盲分离

针对非平稳信号盲分离问题提出了一种基于递推最小二乘(RLS)算法的非平稳信号盲分离新方法.首先引入遗忘因子对常规代价函数进行指数加权修正,得到一种新的具有递归结构的代价函数;然后利用RLS算法最小化代价函数,推导最优分离矩阵的自适应更新算法,逐步实现信号分离.该算法避免了最小二乘类算法关于学习速率选择困难的缺点,具有收...     

Identification and frequency domain analysis of non-stationary and nonlinear systems using time-varying NARMAX models

This paper introduces a new approach for nonlinear and non-stationary (time-varying) system identification based on time-varying nonlinear autoregressive moving average with exogenous variable (TV-NARMAX) models. The challenging model structure selection and parameter tracking problems are solved by combining a multiwavelet basis function expansion of the time-varying parameters with an orthogonal least squares algorithm. Numerical examples demonstrate that the proposed approach can track rapid time-varying effects in nonlinear systems more accurately than the standard recursive algorithms. Based on the identified time domain model, a new frequency domain analysis approach is introduced based on a time-varying generalised frequency response function (TV-GFRF) concept, which enables the analysis of nonlinear, non-stationary systems in the frequency domain. Features in the TV-GFRFs which depend on the TV-NARMAX model structure and time-varying parameters are investigated. It is shown that the high-dimensional frequency features can be visualised in a low-dimensional time–frequency space.     

Recursive identification of time-varying systems: Self-tuning and matrix RLS algorithms

In this paper, a new parallel adaptive self-tuning recursive least squares (RLS) algorithm for time-varying system identification is first developed. Regularization of the estimation covariance matrix is included to mitigate the effect of non-persisting excitation. The desirable forgetting factor can be self-tuning estimated in both non-regularization and regularization cases. We then propose a new matrix forgetting factor RLS algorithm as an extension of the conventional RLS algorithm and derive the optimal matrix forgetting factor under some reasonable assumptions. Simulations are given which demonstrate that the performance of the proposed self-tuning and matrix RLS algorithms compare favorably with two improved RLS algorithms recently proposed in the literature.     

Real-Time Identification of Nonlinear Time-Varying Systems Using Radial Basis Function Network

A multistep version of Kaczmarz's projection algorithm is presented for training radial basis function network used for identification of nonlinear dynamic systems. A new recursive form of the algorithm is derived. Computer simulation shows that the new algorithm offers advantages over RLS algorithm both in convergence rate and in computation time required.     

Recursive estimation methods for discrete systems

In system identification, the error evolution is composed of two decoupled parts: one is the identifying information on the current estimation residual, while the other is past arithmetic errors. Previous recursive algorithms only considered how to update current prediction errors. Up to now, research has mostly been based on recursive least-squares (RLS) methods. In this note, a general recursive identification method is proposed for discrete systems. Using this new algorithm, a recursive empirical frequency-domain optimal parameter (REFOP) estimate is established. The REFOP method has the advantage of resisting disturbance noise. Some simulations are included to illustrate the new method's reliability.