Filtering and fault detection for nonlinear systems with polynomial approximation

This paper is concerned with polynomial filtering and fault detection problems for a class of nonlinear systems subject to additive noises and faults. The nonlinear functions are approximated with polynomials of a chosen degree. Different from the traditional methods, the approximation errors are not discarded but formulated as low-order polynomial terms with norm-bounded coefficients. The aim of the filtering problem is to design a least squares filter for the formulated nonlinear system with uncertain polynomials, and an upper bound of the filtering error covariance is found and subsequently minimized at each time step. The desired filter gain is obtained by recursively solving a set of Riccati-like matrix equations, and the filter design algorithm is therefore applicable for online computation. Based on the established filter design scheme, the fault detection problem is further investigated where the main focus is on the determination of the threshold on the residual. Due to the nonlinear and time-varying nature of the system under consideration, a novel threshold is determined that accounts for the noise intensity and the approximation errors, and sufficient conditions are established to guarantee the fault detectability for the proposed fault detection scheme. Comparative simulations are exploited to illustrate that the proposed filtering strategy achieves better estimation accuracy than the conventional polynomial extended Kalman filtering approach. The effectiveness of the associated fault detection scheme is also demonstrated.The National Natural Science Foundation of China under grants 61490701, 61210012, 61290324, and 61273156, and Jiangsu Provincial Key Laboratory of E-business at Nanjing University of Finance and Economics of China under Grant JSEB201301

Active actuator fault-tolerant control of a wind turbine benchmark model

This paper describes the design of an active fault-tolerant control scheme that is applied to the actuator of a wind turbine benchmark. The methodology is based on adaptive filters obtained via the nonlinear geometric approach, which allows to obtain interesting decoupling property with respect to uncertainty affecting the wind turbine system. The controller accommodation scheme exploits the on-line estimate of the actuator fault signal generated by the adaptive filters. The nonlinearity of the wind turbine model is described by the mapping to the power conversion ratio from tip-speed ratio and blade pitch angles. This mapping represents the aerodynamic uncertainty, and usually is not known in analytical form, but in general represented by approximated two-dimensional maps (i.e. look-up tables). Therefore, this paper suggests a scheme to estimate this power conversion ratio in an analytical form by means of a two-dimensional polynomial, which is subsequently used for designing the active fault-tolerant control scheme. The wind turbine power generating unit of a grid is considered as a benchmark to show the design procedure, including the aspects of the nonlinear disturbance decoupling method, as well as the viability of the proposed approach. Extensive simulations of the benchmark process are practical tools for assessing experimentally the features of the developed actuator fault-tolerant control scheme, in the presence of modelling and measurement errors. Comparisons with different fault-tolerant schemes serve to highlight the advantages and drawbacks of the proposed methodology

The Recovery of Weak Impulsive Signals Based on Stochastic Resonance and Moving Least Squares Fitting

In this paper a stochastic resonance (SR)-based method for recovering weak impulsive signals is developed for quantitative diagnosis of faults in rotating machinery. It was shown in theory that weak impulsive signals follow the mechanism of SR, but the SR produces a nonlinear distortion of the shape of the impulsive signal. To eliminate the distortion a moving least squares fitting method is introduced to reconstruct the signal from the output of the SR process. This proposed method is verified by comparing its detection results with that of a morphological filter based on both simulated and experimental signals. The experimental results show that the background noise is suppressed effectively and the key features of impulsive signals are reconstructed with a good degree of accuracy, which leads to an accurate diagnosis of faults in roller bearings in a run-to failure test

Recent advances on filtering and control for nonlinear stochastic complex systems with incomplete information: A survey

This Article is provided by the Brunel Open Access Publishing Fund - Copyright @ 2012 Hindawi PublishingSome recent advances on the filtering and control problems for nonlinear stochastic complex systems with incomplete information are surveyed. The incomplete information under consideration mainly includes missing measurements, randomly varying sensor delays, signal quantization, sensor saturations, and signal sampling. With such incomplete information, the developments on various filtering and control issues are reviewed in great detail. In particular, the addressed nonlinear stochastic complex systems are so comprehensive that they include conventional nonlinear stochastic systems, different kinds of complex networks, and a large class of sensor networks. The corresponding filtering and control technologies for such nonlinear stochastic complex systems are then discussed. Subsequently, some latest results on the filtering and control problems for the complex systems with incomplete information are given. Finally, conclusions are drawn and several possible future research directions are pointed out.This work was supported in part by the National Natural Science Foundation of China under Grant nos. 61134009, 61104125, 61028008, 61174136, 60974030, and 61074129, the Qing Lan Project of Jiangsu Province of China, the Project sponsored by SRF for ROCS of SEM of China, the Engineering and Physical Sciences Research Council EPSRC of the UK under Grant GR/S27658/01, the Royal Society of the UK, and the Alexander von Humboldt Foundation of Germany

A probabilistic interpretation of set-membership filtering: application to polynomial systems through polytopic bounding

Set-membership estimation is usually formulated in the context of set-valued calculus and no probabilistic calculations are necessary. In this paper, we show that set-membership estimation can be equivalently formulated in the probabilistic setting by employing sets of probability measures. Inference in set-membership estimation is thus carried out by computing expectations with respect to the updated set of probability measures P as in the probabilistic case. In particular, it is shown that inference can be performed by solving a particular semi-infinite linear programming problem, which is a special case of the truncated moment problem in which only the zero-th order moment is known (i.e., the support). By writing the dual of the above semi-infinite linear programming problem, it is shown that, if the nonlinearities in the measurement and process equations are polynomial and if the bounding sets for initial state, process and measurement noises are described by polynomial inequalities, then an approximation of this semi-infinite linear programming problem can efficiently be obtained by using the theory of sum-of-squares polynomial optimization. We then derive a smart greedy procedure to compute a polytopic outer-approximation of the true membership-set, by computing the minimum-volume polytope that outer-bounds the set that includes all the means computed with respect to P

Simple Approximations of Semialgebraic Sets and their Applications to Control

Many uncertainty sets encountered in control systems analysis and design can be expressed in terms of semialgebraic sets, that is as the intersection of sets described by means of polynomial inequalities. Important examples are for instance the solution set of linear matrix inequalities or the Schur/Hurwitz stability domains. These sets often have very complicated shapes (non-convex, and even non-connected), which renders very difficult their manipulation. It is therefore of considerable importance to find simple-enough approximations of these sets, able to capture their main characteristics while maintaining a low level of complexity. For these reasons, in the past years several convex approximations, based for instance on hyperrect-angles, polytopes, or ellipsoids have been proposed. In this work, we move a step further, and propose possibly non-convex approximations , based on a small volume polynomial superlevel set of a single positive polynomial of given degree. We show how these sets can be easily approximated by minimizing the L1 norm of the polynomial over the semialgebraic set, subject to positivity constraints. Intuitively, this corresponds to the trace minimization heuristic commonly encounter in minimum volume ellipsoid problems. From a computational viewpoint, we design a hierarchy of linear matrix inequality problems to generate these approximations, and we provide theoretically rigorous convergence results, in the sense that the hierarchy of outer approximations converges in volume (or, equivalently, almost everywhere and almost uniformly) to the original set. Two main applications of the proposed approach are considered. The first one aims at reconstruction/approximation of sets from a finite number of samples. In the second one, we show how the concept of polynomial superlevel set can be used to generate samples uniformly distributed on a given semialgebraic set. The efficiency of the proposed approach is demonstrated by different numerical examples