一类非线性系统的参数估计

考虑有色噪声干扰的Hammerstein非线性系统的辨识,通过梯度搜索原理推导了增广投影算法,简化增广投影算法和增广随机梯度辨识算法.基本思想是将增广信息向量中的未知噪声项用其估计残差代替.增广投影算法对噪声非常敏感,增广随机梯度算法的收敛速度慢,为了解决这些不足,在增广随机梯度算法中引入遗忘因子,来改善参数估计精度,...     

双输入多率系统辅助模型增广随机梯度算法

针对有色噪声干扰的双输入多率系统,为解决辨识模型信息向量中存在未知变量和不可测噪声项的问题,结合辅助模型思想和递推增广随机梯度算法的优点,用辅助模型的输出代替系统的未知变量,用估计残差代替信息向量中的不可测噪声项,进而提出了双输入多率系统的辅助模型增广随机梯度算法。为了提高辨识算法的收敛速度和改善参数估计精度,在算法中引入遗忘因子,得到相应的辅助模型带遗忘因子增广随机梯度算法。仿真实例说明,引入遗忘因子,能加快算法的收敛性,提高参数估计精度。     

Two-stage multi-innovation stochastic gradient algorithm for multivariate output-error ARMA systems based on the auxiliary model

ABSTRACT

This paper investigates the parameter estimation problem for multivariate output-error systems perturbed by autoregressive moving average noises. Since the identification model has two different kinds of parameters, a vector and a matrix, the gradient algorithm cannot be used directly. Therefore, we decompose the original system model into two sub-models and proceed the identification problem by the collaboration between the two sub-models. By employing the gradient search and determining the optimal step-sizes, we present an auxiliary model based two-stage projection algorithm. However, in order to alleviate the sensitivity to the noise, we reselect the step-sizes and derive the auxiliary model based two-stage stochastic gradient (AM-2S-SG) algorithm. Based on the AM-2S-SG algorithm, an auxiliary model based two-stage multi-innovation stochastic gradient algorithm is proposed to generate more accurate estimates. Finally, numerical simulations are provided to demonstrate the effectiveness of the proposed algorithms.     

Extended stochastic gradient identification algorithms for Hammerstein–Wiener ARMAX systems

An extended stochastic gradient algorithm is developed to estimate the parameters of Hammerstein–Wiener ARMAX models. The basic idea is to replace the unmeasurable noise terms in the information vector of the pseudo-linear regression identification model with the corresponding noise estimates which are computed by the obtained parameter estimates. The obtained parameter estimates of the identification model include the product terms of the parameters of the original systems. Two methods of separating the parameter estimates of the original parameters from the product terms are discussed: the average method and the singular value decomposition method. To improve the identification accuracy, an extended stochastic gradient algorithm with a forgetting factor is presented. The simulation results indicate that the parameter estimation errors become small by introducing the forgetting factor.     

Closed-loop subspace-based identification algorithm using third-order cumulants

The problem of closed-loop system identification for coloured noise system without any knowledge of feedback controller is considered. We develop a solution to this problem in the framework of subspace identification based on high-order cumulants. The key of the developed algorithm is using the properties that the third-order cumulants are insensitive to any coloured Gaussian noises. By post-multiplying a suitable instrumental variable to the noise terms, the cross third-order cumulants are constructed that become zero when the noises are Gaussian distributed, and meanwhile the column rank of extended observability matrix is maintained. Thus, the standard subspace identification algorithms can be extended to closed-loop system corrupted by arbitrary coloured noises. A numerical simulation is presented to demonstrate the proposed algorithm.     

Recursive identification of Hammerstein systems with dead-zone nonlinearity in the presence of bounded noise

The existing identification algorithms for Hammerstein systems with dead-zone nonlinearity are restricted by the noise-free condition or the stochastic noise assumption. Inspired by the practical bounded noise assumption, an improved recursive identification algorithm for Hammerstein systems with dead-zone nonlinearity is proposed. Based on the system parametric model, the algorithm is derived by minimising the feasible parameter membership set. The convergence conditions are analysed, and the adaptive weighting factor and the adaptive covariance matrix are introduced to improve the convergence. The validity of this algorithm is demonstrated by two numerical examples, including a practical DC motor case.     

Moving data window gradient‐based iterative algorithm of combined parameter and state estimation for bilinear systems

The combined iterative parameter and state estimation problem is considered for bilinear state‐space systems with moving average noise in this paper. There are the product terms of state variables and control variables in bilinear systems, which makes it difficult for the parameter and state estimation. By designing a bilinear state estimator based on the Kalman filtering, the states are estimated using the input‐output data. Furthermore, a moving data window (MDW) is introduced, which can update the dynamical data by removing the oldest data and adding the newest measurement data. A state estimator‐based MDW gradient‐based iterative (MDW‐GI) algorithm is proposed to estimate the unknown states and parameters jointly. Moreover, given the extended gradient‐based iterative (EGI) algorithm as a comparison, the MDW‐GI algorithm can reduce the impact of noise to parameter estimation and improve the parameter estimation accuracy. The numerical simulation examples validate the effectiveness of the proposed algorithm.     

Control of nonlinear systems with compensation of disturbances under measurement noises

ABSTRACT

The control algorithm for nonlinear time-invariant systems with compensation of unknown disturbances under measurement noises is proposed. The dimension of noises is equal to the state vector dimension of the plant. Disturbances can be presented in any equation of the plant model. The novel control law is based on the noise estimator and the disturbance compensator. The accuracy in the steady state depends on the first derivative of disturbance and the smallest component of noise vector. A sufficient condition in terms of linear matrix inequality provides feasibility of the proposed algorithm. The simulations show the efficiency of the proposed method compared with some existing ones.     

Hierarchical gradient based iterative parameter estimation algorithm for multivariable output error moving average systems

According to the hierarchical identification principle, a hierarchical gradient based iterative estimation algorithm is derived for multivariable output error moving average systems (i.e., multivariable OEMA-like models) which is different from multivariable CARMA-like models. As there exist unmeasurable noise-free outputs and unknown noise terms in the information vector/matrix of the corresponding identification model, this paper is, by means of the auxiliary model identification idea, to replace the unmeasurable variables in the information vector/matrix with the estimated residuals and the outputs of the auxiliary model. A numerical example is provided.     

A stochastic gradient-based two-step sparse identification algorithm formultivariate ARX systems

We consider the sparse identification ofmultivariateARX systems, i.e., to recover the zero elements of the unknown parameter matrix. We propose a two-step algorithm, where in the first step the stochastic gradient (SG) algorithm is applied to obtain initial estimates of the unknown parameter matrix and in the second step an optimization criterion is introduced for the sparse identification of multivariate ARX systems. Under mild conditions, we prove that by minimizing the criterion function, the zero elements of the unknown parameter matrix can be recovered with a finite number of observations. The performance of the algorithm is testified through a simulation example.     

Identification Input Design for Consistent Parameter Estimation of Linear Systems With Binary-Valued Output Observations

Input design is of essential importance in system identification for providing sufficient probing capabilities to guarantee convergence of parameter estimates to their true values. This paper presents conditions on input signals that characterize their probing richness for strongly consistent parameter estimation of linear systems with binary-valued output observations. Necessary and sufficient conditions on periodic signals are derived for sufficient richness. These conditions are further studied under different system configurations including open-loop and feedback systems, and different scenarios of noises including actuator noise, input measurement noise, and output measurement noise. In addition to system parameter estimation, essential properties of identifiability and input conditions are also derived when sensor thresholds or noise distribution functions are unknown. The findings of this paper provide a foundation to study identification of systems that either use binary-valued or quantized sensors or involve communication channels, which mandate quantization of signals.     

Stable on-line parameter identification with general knowledge on level of information noise discrete-time case

An on-line parameter identification problem is posed and solved for discrete-time systems with general knowledge on the level of the inherent information noise. The knowledge can be the bound on either the magnitude or the finite-index ^p norm, pε[1, ∞), of the noise. Based on the knowledge, a switching type gradient algorithm (or called gradient algorithm with dead zone) is proposed to estimate the parameters of the system from the available input-output data. In spite of the existence of the noise, this on-line algorithm guarantees that the estimation error is monotonically decreasing, and the parameter estimate is convergent to a steady-state value under a mild condition. Furthermore, the algorithm is stable in the sense that the estimation error will converge to zero as the bound on the noise gradually diminishes.     

Maximum likelihood estimation using square root information filters

The maximum likelihood parameter estimation algorithm is known to provide optimal estimates for linear time-invariant dynamic systems. However, the algorithm is computationally expensive and requires evaluations of the gradient of a log likelihood function and the Fisher information matrix. By using the square-root information filter, a numerically reliable algorithm to compute the required gradient and the Fisher information matrix is developed. The algorithm is a significant improvement over the methods based on the conventional Kalman filter. The square-root information filter relies on the use of orthogonal transformations that are well known for numerical reliability. This algorithm can be extended to real-time system identification and adaptive control     

Maximum likelihood least squares‐based iterative methods for output‐error bilinear‐parameter models with colored noises

This article is concerned with the parameter identification of output‐error bilinear‐parameter models with colored noises from measurement data. An auxiliary model least squares‐based iterative method is developed through the overparameterization model. It examines the difficulty of estimating the overparameterized vector, which usually presents a heavy computational burden in the identification process. To overcome this drawback, a parameter separation technique is introduced and the nonlinear model is reformulated as a refined identification model through eliminating the crossmultiplying terms. In this regard, a parameter separation least squares‐based iterative (PS‐LSI) algorithm is derived by avoiding estimating the redundant parameters. On the basis of the PS‐LSI algorithm, we derive a maximum likelihood least squares‐based iterative method to further improve the numerical accuracy. The identification is dependent on the formulation of a pseudolinear regression relationship, which contains two linear prefilters constructed from the system and noise models. The performance of this proposed method is confirmed by the numerical simulations as well as direct comparisons with other existing algorithms.     

Performance analysis of stochastic gradient algorithms under weak conditions

By using the stochastic martingale theory, convergence properties of stochastic gradient （SG） identification algorithms are studied under weak conditions. The analysis indicates that the parameter estimates by the SG algorithms consistently converge to the true parameters, as long as the information vector is persistently exciting （i.e., the data product moment matrix has a bounded condition number） and that the process noises are zero mean and uncorrelated. These results remove the strict assumptions, made in existing references, that the noise variances and high-order moments exist, and the processes are stationary and ergodic and the strong persis- tent excitation condition holds. This contribution greatly relaxes the convergence conditions of stochastic gradient algorithms. The simulation results with bounded and unbounded noise variances confirm the convergence conclusions proposed.     

Optimal state estimation for networked systems with random parameter matrices,correlated noises and delayed measurements

In this paper, the optimal least-squares state estimation problem is addressed for a class of discrete-time multisensor linear stochastic systems with state transition and measurement random parameter matrices and correlated noises. It is assumed that at any sampling time, as a consequence of possible failures during the transmission process, one-step delays with different delay characteristics may occur randomly in the received measurements. The random delay phenomenon is modelled by using a different sequence of Bernoulli random variables in each sensor. The process noise and all the sensor measurement noises are one-step autocorrelated and different sensor noises are one-step cross-correlated. Also, the process noise and each sensor measurement noise are two-step cross-correlated. Based on the proposed model and using an innovation approach, the optimal linear filter is designed by a recursive algorithm which is very simple computationally and suitable for online applications. A numerical simulation is exploited to illustrate the feasibility of the proposed filtering algorithm.     

Correlation Analysis-based Stochastic Gradient and Least Squares Identification Methods for Errors-in-variables Systems Using the Multiinnovation

This paper deals with the identification problem of discrete-time linear time-invariant errors-in-variables systems for the case of the colored output noise. Based on the correlation analysis, the multi-innovation theory is introduced to the errors-in-variables systems where both input and output data are noisy. A correlation analysis-based multi-innovation stochastic gradient algorithm and a correlation analysis-based multi-innovation least squares algorithm are proposed by means of the multi-innovation theory in order to improve the parameter accuracy. The simulation results confirm that these two algorithms are effective.

     

Least squares based iterative identification for a class of multirate systems

This paper studies modeling and identification problems for multi-input multirate systems with colored noises. The state-space models are derived for the systems with different input updating periods and furthermore the corresponding transfer functions are obtained. To solve the difficulty of identification models with unmeasurable noises terms, the least squares based iterative algorithm is presented by replacing the unmeasurable variables with their iterative estimates. Finally, the simulation results indicate that the proposed iterative algorithm has advantages over the recursive algorithms.     

非均匀采样多率ARMAX系统RELS算法性能分析

针对一类有色噪声干扰的非均匀采样多率ARMAX系统的辩识问题,基于增广参数维数理论,将系统模型参数化,将信息向量中含有的不可测噪声项用其估计残差代替,推导了非均匀采样ARMAX系统的递推增广最小二乘(RELS)算法;利用鞅收敛定理对该算法的收敛性进行了理论分析,结果表明该算法在噪声方差有界和广义持续激励的条件下能够收敛到真参数.仿真例子验证了该算法具有良好的收敛速度与估计精度.