# States and Parameters Estimation for Induction Motors Based on a New Adaptive Moving Horizon Estimation

Authors: Steve Alan Talla Ouambo; Alexandre Teplaira Boum; Adolphe Moukengue Imano
Journal: Journal of Electrical and Computer Engineering
 (2022)

---

## Abstract

This paper investigates the joint states and parameters estimation problem for induction machine. In order to develop new states and parameters estimation methods that greatly improve the estimation bandwidth, this paper proposes an adaptive moving horizon estimation of the crucial states and parameters of the induction machine. The model of the machine under study is the one taking into consideration the magnetic saturation and the iron losses simultaneously. The estimator used is based on a least squares algorithm but includes a dead zone that ensures robustness and a variable forgetting factor that is based on the constant information principle. The simulation results show that the adaptive estimator can efficiently estimate the states and parameters of the induction machine with a fast convergence rate despite the initial parametric errors.


---

## Body

## 1. Introduction

In feedback control, system monitoring, and system optimization, state estimation plays a fundamental role because the only information available from the system is noisy measurements. For accomplishing such a task, several methods have been developed [1–6], among many others. Upon the assumption of knowledge of the model of the system and noises, all these techniques have been developed. Assumptions are not easily satisfied in practice, and researchers have been absolutely focused on approaches that do not rely on these requirements [7–11] and have introduced an approach that solves least squares estimation problems. Instead of leaning on statistical assumptions about noise, the method is based on an effective selection of an uncertain model. In this approach, the authors have formulated uncertainty models by relying on the available information about the system. Robust estimation algorithms based on the min-max robust filtering and guaranteed cost paradigm, in the same way, have mobilized the interest of the research community [7, 12]. The moving horizon estimation (MHE) has long attracted the attention of researchers since the work of the pioneers [3, 4, 13, 14], building on the fabulous success of controlling the moving horizon. The interest of these estimation methods comes from the possibility of processing a limited amount of data instead of using all the information available from the start and from the ability to integrate constraints. Over the past two decades, the theoretical properties of various MHE schemes have been investigated, as well as efficient computational methods for real-time implementation (see [15–19]). Many results have been obtained for some algorithms, going from ideal hypotheses (no disturbances and observability) to realistic conditions (bounded perturbations).In this paper, we study the adaptive moving horizon estimation for the estimation of states and parameters without the speed sensor of an induction machine, aiming to improve the convergence rate of the estimations of the different variables. In [20], the authors introduced the moving horizon estimator, inspired by the double receding horizon control (RHC) problem, which has gained increasing interest over the last decade due to advances in the capabilities of computer calculation and numerical optimization [3, 4] have highlighted extensive studies of the MHE for nonlinear and general linear systems, respectively [21], explored the induction motor state estimation by the moving horizon estimator to achieve better bandwidth and estimation accuracy compared to the model reference adaptive system and extended Kalman filter estimators. However, the authors have assumed that the motor speed is constant over the estimation horizon, so the estimation of the speed of the convergence rate is limited. Moreover, the authors also assumed perfect knowledge of the model parameters, which in practice are not always available.In [22], the authors propose parameter estimation algorithms for Hammerstein nonlinear ARX systems by making full use of the current and previous input–output data of the system. A weighted multi-innovation stochastic gradient algorithm is presented to improve the convergence rate of identification. The simulation results indicate that the algorithm can improve the accuracy of parameter estimation. Nevertheless, [23], the authors propose a paper that is concerned with the design of a state filter for a time-delay state-space system with unknown parameters based on noisy observation information. The key is to investigate new identification algorithms for the interactive state and parameter estimation of the considered system. Firstly, a direct state filter is formulated by minimizing the state estimation error covariance matrix on the basis of the Kalman filtering principle. Secondly, once the unknown states are estimated, a state filter-based recursive least squares algorithm is proposed for parameter estimation using the least squares principle. Then, a state filter-based hierarchical least squares algorithm is derived by decomposing the original system into several subsystems for improving the computational efficiency. The authors in [24] study the identification of state-space models of bilinear systems; the parameters to be identified of the considered system are coupled with the unknown states, which makes the identification problem more difficult than that of the linear state-space model. For the coupled variables, they introduce the interaction estimation theory to study an online algorithm for joint state-parameter estimation. To be more specific, a state observer in bilinear form is established by minimizing the state estimation error covariance matrix in the same way as a Kalman filter on the condition that the parameters are known. Then, a bilinear state observer based recursive least squares algorithm is developed using the least squares method. Moreover, for the purpose of improving the computational efficiency, a bilinear state observer based two-stage recursive least squares algorithm and a bilinear state observer based multistage recursive least squares algorithm are proposed by decomposing the system into several subsystems based on the hierarchical identification.In this article, a moving horizon estimator based on adaptive arrival cost is proposed in [25], considering all the dynamics of the induction motor, where the states and parameters are jointly estimated. The formulation of the adaptive moving horizon estimator for the induction motor is introduced and eventually discussed. The simulations show that the design of the adaptive estimator can achieve an accurate estimation despite the initial parameter errors.The paper is organized as follows: In Section2, we present the induction motor model taking into consideration the magnetic saturation and the iron losses simultaneously, followed by the adaptive moving horizon estimation formulation in Section 3. The results are discussed in Section 4. The conclusion is drawn in Section 5.


## 2. Induction Machine Model

The induction machine model in the d-q reference frame can be written as follows:(1)Usd=Rsisd+dψsddt−wsψsq,Usq=Rsisq+dψsqdt+wsψsd,Urd=0,=Rrird+dψrddt−ws−pΩψrq,Urq=0,=Rrirq+dψrqdt+ws−pΩψrd,ψsd=Llsisd+ψmd,ψsq=Llsisq+ψmq,ψrd=Llrird+ψmd,ψrq=Llrirq+ψmq,ψmd=Lmimd,ψmq=Lmimq,imd+idFe=isd+ird,imq+iqFe=isq+irq,RFeidFe=Lmdimddt+wsLmimd,RFeiqFe=Lmdimqdt+wsLmimq,Cem=pLmLrψrdisq−iqFe−ψrqisd−idFe,where U, i, and ψ denote voltage, current, and flux vector, respectively. r, s, and m stand for rotor, stator, and air-gap, respectively. p is the number of pole pairs. ws is the speed of the reference axis. pΩ is the rotor speed. Cem is the electromagnetic torque. Rs, Rr, Lls, Llr, and Lm can be determined directly from conventional tests: DC test, no-load test, and locked-rotor test. For operation in transient state, a mechanical model is coupled to the electrical system via the electromagnetic torque Cem by the equation of motion given as follows:(2)JdΩdt+fΩ=Cem−TL,where J is the moment of inertia, f is the coefficient of friction, and TL is the load torque.The state representation of the machine model is as follows:(3)x˙=fx,U,y=Cx=isdisqT,where(4)x=isdqirdqidqFeΩRsRrT,U=Usdq02×102×1000T,i˙sdi˙sqi˙rdi˙rqi˙dFei˙qFeΩ˙R˙sR˙r︸x˙=i˙,Ω˙,R˙s,R˙r=1Llsf11Llsf21Llrf31Llrf4f5f6f700︸fi,Ω,Rs,Rr+BUsdUsq︸Us,with(5)B=100100001Lls001Lls000000,f1=k2ws−Rsisd+wsLs−k1wsisq⋯+k2wsird+wsLm−k1wsirq⋯−k1RFeLm+k2wsidFe⋯+wsk1−Lm−k2RFeLmiqFe,f2=L1−Lswsisd+Rs−k2wsisq⋯+L1−Lmwsird−k2wsirq⋯+wsLm−L1−k2RFeLmidFe⋯+wsk2−L1RFeLmiqFe,f3=k2wsisd+wslLm−k1wsisq⋯+k2ws−Rrird+wslLr−k1wsirq⋯−k1RFeLm+k2wsidFe⋯+wsk1−wslLm−k2RFeLmiqFe,f4=L1ws−Lmwslisd−k2wsisq⋯+L1ws−Lrwslird−k2ws+Rrirq⋯+wslLm−wsL1−k2RFeLmidFe⋯+wsk2−L1RFeLmiqFe,f5=k2wsϖ−RsLlsisd⋯+wsLsLls−k1wsϖ−wsisq⋯+k2wsϖ−RrLlrird⋯+wsLmLls−k1wsϖ+wslLrLlr−wsirq⋯−k1RFeLm+k2wsϖ+RFeLmidFe⋯+wsk1ϖ−k2RFeLmϖ+ws1−LmLls−wslLmLlriqFe,f6=ws+ϖL1ws−LsLlsws−wslLmLlrisd⋯+RsLls−k2wsϖisq⋯+ws+L1wsϖ−wsLmLls−wslLrLlrird⋯−RrLlr+k2wsϖirq⋯+wsLm−L1−k2RFeLmϖ−PΩLmLlr+wsidFe⋯+wsk2−L1RFeLmϖ−RFeLmiqFe,f7=PLmJisqird−isdirq−fJΩ−TLJ,where(6)ϖ=1Lls+1Llr,k1=Ldycos2μ+Lmsin2μ,k2=cosμsinμMdy−Lm,L1=Ldysin2μ+Lmcos2μ.Withwsl=ws−PΩ,(7)Ld=Ldycos2μ+Lmsin2μ,Lq=Ldysin2μ+Lmcos2μ,Ldq=Ldy−Lmcosμsinμ,cosμ=imdim;sinμ=imqim,Lm=ψmim;Mdy=dψmdim,where Lm and Ldy are the static and dynamic mutual inductances, respectively. μ is the angle between the magnetizing current im the axis d. Lm and Ldy consider that im changes as a function of the magnetizing state of the machine; they depend on the instantaneous values of ψm and im and are variable. Ldq explains the cross effect between the d and q axes [26, 27].


## 3. Adaptive Moving Horizon Estimation Formulation

This section introduces the adaptive moving horizon estimation formulation to make self-contained this paper [25].(8)xk+1=fxk,uk+Dwkyk=Cxk+vk,where the state vector is xk∈Xℓ⊆ℝn, the process noise vector is wk∈Wℓ⊆ℝp, the measurement vector is yk∈Yℓ⊆ℝm, and the measurement noise vector is vk∈Vℓ⊆ℝm. The process and measurement noises (wk, vk) are assumed to be bounded and/or unknown, i.e., w∈WℓϑWℓmax and v∈VℓϑVℓmax for ϑWℓmax,ϑVℓmax∈ℝ+2, with Xℓ, Yℓ, Wℓ, and Vℓ convex and/or compact sets considered closed with 0∈Xℓ, 0∈Yℓ, 0∈Wℓ, and 0∈Vℓ. The adaptive moving horizon estimation can be formulated as the following constrained optimization problem at time T:(9)minw^k,x^k−N|kΨ=Γk−N|kx^k−N|k+∑j=k−Nk−1w^j|kQ−12+∑j=k−N+1kv^j|kR−12s.t.x^j+1|k=fx^j|k+w^j|k,yj=Cx^j|k+v^j|k,x^j|k∈Xℓ,w^j|k∈Wℓ,v^j|k∈Vℓ,where x^k−j|k is the optimal estimated, and the process noise estimate is w^j|k, which is based on available measurements at time kyk. The estimation residuals are v^j|k=yj−Cx^j|k. To ensure a suitable stability of the MHE, it is necessary to make an adequate choice of Γk−N|k⋅ and its parameters [28].It is quite arduous for constrained moving horizon estimation problems to find an analytical expression of the arrival cost; therefore, an approximation of the arrival cost used for the constrained problem will be highlighted and this approximation quadratic takes the form as follows:(10)Γk−N=x^k−N−x˜k−NPk−N−12,where x˜k−N is the initial state and Pk−N is the weighting matrix. They define the approximation of the arrival cost. In this work, the approach proposed for the update of the arrival cost function, based on an adaptive algorithm, is formulated as an update of the following elements: Pk−N and x˜k−N. In this case, the update of the initial state x˜k−N will be done by a so-called smooth update, which implies that once the estimate has left the estimate horizon, the state constraints will not change [29–31].(11)x˜k−N=x^k−N|k−1∗.About the update of the weighting matrixPk−N, it is important to note that the weighting matrix can be considered as the covariance of the state xk−N, following a stochastic interpretation of the MHE problem [4]. Analytical solutions exist to calculate the weighting matrix for unconstrained linear systems, on the other hand, for constrained linear systems, a deduction of the approached solutions is necessary, they are fundamental and based on a process of recursive updating of the useful information of the process at a given time. In the adaptive estimation method highlighted, we use a recursive updating process based on measures and states [32, 33].(12)Pk−N−1=λkPk−N−1−1+αkλkx^k−N|k−1x^k−N|k−1T,where αk is a function called the dead zone, varying between 0 and 1, andλk is the forgetting factor 0<λk≤1, with P0>0. A recursive real-time estimate of PkN is produced by (12). Pk−N−1 being the previous estimate is updated from the matrix x^k−N|k−1x^k−N|k−1T. This mechanism can be qualified as a dynamic temporal filter update with P0, the initial condition, and x^k−N|k−1x^k−N|k−1T the input.Lemma 1.
Let a matrixG>0, then an invertible matrixMexists such thatMTGM=I, withIthe identity matrix. Then,MMT=G−1exists.Proof.
(cf. Lemma7 in [34]).
The functionαk and the forgetting factor λk, each has a particular role. In Pk−N−1, when λk≈1, the algorithm keeps the old information, and all information is included in this case, enhancing the estimation problem. Moreover, when λk≪1, the algorithm tends to discard the old data in Pk−N−1, considering actual data to estimate Pk−N [35].
This case makes it possible to discard many old data which could negatively hinder the performance of the estimator. To ensure robustness, the dead zone functionαk is used, when estimating (12) can be rewritten by the matrix inversion Lemma as follows:(13)Pk−N=1λkPk−N−1−αkPk−N−1x^k−N|k−1x^k−N|k−1TPk−N−1λk+x^k−N|k−1TPk−N−1x^k−N|k−1.
By this way a feedback loop is introduced into the MHE problem to computePk−N, the convergence of the estimates is ensured in this way x^k−N|k and w^jj=k−N,…,N and to adjust Pk−N−1 according to the amount of available data. The proposed algorithm used, proposes two crucial elements, a variable forgetting factor, which varies between 0 and 1, and a dead zone function, both enabling Pk−N to be updated under certain conditions to be respected as follows [32]:(14)λk=N0+Δk2N0+M1kifΔk2M1k<1,1otherwise,(15)αk=1ifΔk21+μkλk≤ek2,0otherwise,withN0 is a positive parameter. M1k=ek2/1+μk,(16)μk=x^k−N|k−1TPk−N−1x^k−N|k−1,ek=yk−N−y^k−N,where Δk=x^k−N|k−1d1+d2/nk−1, with nk−1=max1,x^k−N|k−1, and d1 and d2 are design parameters too, chosen positive notably. The dead zone size Δk21+μk/λk is bounded because μk is a bounded function [32] proposed a forgetting factor, which is based on the constant data principle; moreover, it is judicious for external and unmodelled disturbances. Algorithm 1 summarizes the adaptive moving horizon estimation.
Algorithm 1: AD-MHE Algorithm.
x˜0,P0,Q,R>0,d1,d2,N0>0andN≥2Initializationx˜k−N←x˜0Pk−N←P0fork=0,1,2…doGet measurementsykifk<Ntheny←y0,y1,…,ykTSolveΨkwithx˜0,P0andyelsey←yk−N,…,ykTSolveΨkNwithx˜k−N,Pk−Nandyx˜k−N←x^k−N+1|kUpdatingPk−Nusing (13), (14) and (15)end ifGet current estimatesx^j|kj=k−N,…,kend for


## 4. Results and Discussion

Numerical simulations have been carried out to show the performance of the adaptive MHE on the induction machine. Table1 presents the parameters of the machine used in the simulations and Table 2 presents the parameters and initial values of the estimator. The sampling frequency chosen for the execution of the simulations is 10Khz and the optimization problems have been solved using the Matlab Optimization Toolbox™. A sequence of independent normally distributed random values with zero mean and covariance equal to 0.1 for measurement noises and a sequence of normally distributed random values with zero mean and covariance equal to 1 for process noises.Table 1
Parameters of induction motor model.
ParametersValuesMotor power2.2kwNominal voltage380/230VNominal current4.7AStator resistanceRs2.05ΩRotor resistanceRr4.05ΩIron resistanceRFe160ΩStator self-inductanceLls274mHRotor self-inductanceLlr274mHMutual inductanceLmo810mHRotor inertiaJ0.081kg.m2Number of pole pairp2Friction coefficientf0.003N.m.s.rad−1Table 2
Estimator settings.
ParametersValuesNumber of outputs measured2Number of estimated states9Horizon lengthN8Covariance matrixQDiagonal15Covariance matrixRDiagonal10Weighting matrixP0Diagonal1d110−2d210N00.5Initial values of estimated statesStator current (A)0,5Rotor current (A)0,5Iron loss current (A)0,1Rotor speed (tr/min)0,3Stator resistanceΩ0,15Rotor resistanceΩ2,5The proposed moving horizon estimation formulation for induction machine state estimation is compared with the performance of conventional moving horizon estimation, extended Kalman filter and unscented Kalman filter. Figures1(a) and 1(b) show the estimation of the stator currents in the d and q axis. It can be seen that the estimation of the stator currents by the MHEAD is better than that provided by the others estimators. Despite the extension of the machine model to the crucial parameters notably Rs and Rr, the adaptive estimator follows the real state by its ability to adapt to changes and this estimator shows its great robustness to the given model, which assumes that the parameters have slow dynamics. Figures 2(a) and 2(b) show the estimation of the rotor currents in the d and q axis. Just like the estimate of the stator current, it can be seen a very good estimate especially during the steady state. Moreover, we also note that the convergence speed of the adaptive estimator is obviously greater than that of the MHE, EKF and UKF. Figures 3(a) and 3(b) show the estimation of the iron currents in the d and q axis. The estimate of the iron current along the d axis is significantly better than the estimate of the iron current along the q axis. It can also be noted that at the level of Figure 3(b), the estimated state reaches stability at a greater time than that of Figure 3(a), on the other hand the estimate of other estimators diverge exponentially. Figures 4(a) and 4(b) show the estimation of the stator and rotor resistance. Thanks to its ability to adapt due to the variable forgetting factor and the dead zone function, the formulated adaptive estimator guarantees a good estimation of the parameters. We can also appreciate the high speed of convergence of the adaptive estimator on the moving horizon estimator, EKF and UKF. Note that the other estimators were not designed to estimate the parameters of nonlinear systems in an efficient way, which explains its slow convergent speed and its poor parametric estimation. The proposed adaptive estimator overcomes almost all the problems of others. Figure 5 shows the estimation of the rotor speed. Once again, we can appreciate the good estimation and the good convergence speed of the MHEAD. Also we can note the divergence of the MHEKF which tries somehow to rebuild the speed but without ever succeeding. As for EKF and UKF, they provide an estimate of very poor quality with estimation disparities on both sides. In steady state, the estimation error between the real state and the state estimated by the adaptive estimator is very small compared to the error between the real state and the state estimated by the other estimators. Figures 6(a) and 6(b) present the evolution of the variable forgetting factor and the dead zone function, respectively. The forgetting factor is variable that varying between 0 and 1, providing a quite good adaptation ability and allowing the proposed MHEAD to insert judicious information into the data and enable sudden variations, it tries to adapt to variations in the transient state while keeping its value between 0 and 1. The dead zone function makes variations between 0 and 1 to enable a fast adaptation of the weighting matrix when a sudden change happens. It can note that when the estimate error is relatively large, the dead zone function is equal to 1, and when the error is low relatively, the dead zone function takes the value 0. Additionally, it can be seen that the adaptive estimator with mechanical equation included, can correctly estimate the states and parameters of the induction machine and demonstrated a faster convergence transient comparing with classic MHE. Moreover the adaptive moving horizon estimation can successfully incorporate jointly the states and parameters estimation and give a quite good converging estimation despite the existence of parametric errors of the initial model.Figure 1
(a) Estimation of stator current in d axis. (b) Estimation of stator current in q axis.
(a)(b)Figure 2
(a) Estimation of rotor current in d axis. (b) Estimation of rotor current in q axis.
(a)(b)Figure 3
(a) Estimation of iron current in d axis. (b) Estimation of iron current in q axis.
(a)(b)Figure 4
(a) Estimation of stator resistance. (b) Estimation of rotor resistance.
(a)(b)Figure 5
Estimation of rotor speed.Figure 6
Evolution of the sequence of (a) forgetting factor and (b) dead zone function.
(a)(b)


## 5. Conclusion

This paper presented an adaptive moving horizon estimation scheme for the joint estimation of states and parameters, in particular the stator and rotor resistances of the induction machine. The formulated estimation algorithm is based on a least squares algorithm including a dead zone function ensuring robustness and a variable forgetting factor, which is based on the principle of constant information. The results obtained show that the adaptive estimation scheme allows a relatively good approximation of the cost of arrival for the estimation of the moving horizon, this can be explained by the fact that the variable forgetting factor and the function of dead zone can follow slow and/or sudden changes and provide good adaptability. The results of the adaptive moving horizon estimation tests for the induction machine sufficiently show that the presented estimation scheme can achieve suitable convergent estimation performance when the model parameters are biased from the start and the results show that the mhead has a much higher convergence speed than the classical mhe and we notice a root mean square error of 75.37 for the mhead and 185.10 for the conventional mhe. The crucial elements of the mhead provide robustness against disturbances and uncertainties of the unmodelled model.



---

*Source: 8687025-2022-11-12.xml*