Cooperative estimation algorithms for multi-sensor networks with imprecise measurements

A cooperative estimation algorithm is proposed for mutli-sensor networks with imprecise measurements caused by electromagnetic interferences, abnormal currents and other faults in the multi-sensor measurement process. Adaptive schemes based on a reference model are introduced to overcome the adverse effects of multiplicative interference on the estimated information. Then, rigorous theoretical proofs are developed to analyze the adaptive estimation algorithm. Finally, numerical simulation results are carried out to verify the effectiveness of the theoretical analysis.

Enhancement of the Moving Horizon Estimation Performance Based on an Adaptive Estimation Algorithm

Although moving horizon estimation (MHE) is a very efficient technique for estimating parameters and states of constrained dynamical systems, however, the approximation of the arrival cost remains a major challenge and therefore a popular research topic. The importance of the arrival cost is such that it allows information from past measurements to be introduced into current estimates. In this paper, using an adaptive estimation algorithm, we approximate and update the parameters of the arrival cost of the moving horizon estimator. The proposed method is based on the least-squares algorithm but includes a variable forgetting factor which is based on the constant information principle and a dead zone which ensures robustness. We show by this method that a fairly good approximation of the arrival cost guarantees the convergence and stability of estimates. Some simulations are made to show and demonstrate the effectiveness of the proposed method and to compare it with the classical MHE.

Kalman Filter Adaptation to Disturbances of the Observer’s Parameters

Currently, one of the most effective algorithms for state estimation of stochastic systems is a Kalman filter. This filter provides an optimal root-mean-square error in state vector estimation only when the parameters of the dynamic system and its observer are precisely known. In real conditions, the observer’s parameters are often inaccurately known; moreover, they change randomly over time. This in turn leads to the divergence of the Kalman estimation process. The problem is currently being solved in a variety of ways. They include the use of interval observers, the use of an extended Kalman filter, the introduction of an additional evaluating observer by nonlinear programming methods, robust scaling of the observer’s transmission coefficient, etc. At the same time, it should be borne in mind that, firstly, all of the above ways are focused on application in specific technical systems and complexes, and secondly, they fundamentally do not allow estimating errors in determining the parameters of the observer themselves in order to compensate them for further improving the accuracy and stability of the filtration process of the state vector. To solve this problem, this paper proposes the use of accurate observations that are irregularly received in a complex measuring system (for example, navigation) for adaptive evaluation of the observer’s true parameters of the stochastic system state vector. The development of the proposed algorithm is based on the analytical dependence of the Kalman estimate variation on the observer’s parameters disturbances obtained using the mathematical apparatus for the study of perturbed multidimensional dynamical systems. The developed algorithm for observer’s parameters adaptive estimation makes it possible to significantly increase the accuracy and stability of the stochastic estimation process as a whole in the time intervals between accurate observations, which is illustrated by the corresponding numerical example.

Diffusion adaptive filtering algorithm based on the Fair cost function

To better perform distributed estimation, this paper, by combining the Fair cost function and adapt-then-combine scheme at all distributed network nodes, a novel diffusion adaptive estimation algorithm is proposed from an M-estimator perspective, which is called the diffusion Fair (DFair) adaptive filtering algorithm. The stability of the mean estimation error and the computational complexity of the DFair are theoretically analyzed. Compared with the robust diffusion LMS (RDLMS), diffusion Normalized Least Mean M-estimate (DNLMM), diffusion generalized correntropy logarithmic difference (DGCLD), and diffusion probabilistic least mean square (DPLMS) algorithms, the simulation experiment results show that the DFair algorithm is more robust to input signals and impulsive interference. In conclusion, Theoretical analysis and simulation results show that the DFair algorithm performs better when estimating an unknown linear system in the changeable impulsive interference environments.

Enhancing Stability and Robustness of State-of-Charge Estimation for Lithium-Ion Batteries by Using Improved Adaptive Kalman Filter Algorithms

The traditional Kalman filter algorithms have disadvantages of poor stability (the program cannot converge or crash), robustness (sensitive to the initial errors) and accuracy, partially resulted from the fact that noise covariance matrices in the algorithms need to be set artificially. To overcome the above problems, some adaptive Kalman filter (AKF) algorithms are studied, but the problems still remain unsolved. In this study, two improved AKF algorithms, the improved Sage-Husa and innovation-based adaptive estimation (IAE) algorithms, are proposed. Under the different operating conditions, the estimation accuracy, filter stability, and robustness of the two proposed algorithms are analyzed. Results show that the state of charge (SOC) Max error based on the improved Sage-Husa and the improved IAE is less than 3% and 1.5%, respectively, while the Max errors of the original algorithms is larger than 16% and 4% The two proposed algorithms have higher filter stability than the traditional algorithms. In addition, analyses of the robustness of the two proposed algorithms are carried out by changing the initial parameters, proving that neither are sensitive to the initial errors.