首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献，搜索用时 31 毫秒
1.
孙明轩 《科技通报》1996,12(3):152-156
通过对ｌ１模指标的平滑处理，构造了平滑近似指标下的递推辨识算法，这种算法实时计算负担小，且具有良好算法性质，数值仿真结果表明，它仍蕴含原指标意义下的鲁棒估计性质。  相似文献   

2.
自适应滤波算法根据采用优化准则的不同,通常分为两类最基本算法:最小均方误差(LMS)类算法和递归最小二乘(RLS)类算法。本文重点介绍了最小均方误差算法和递归最小二乘算法,并将这两类算法在MATLAB上进行仿真,并对结果作出比较和分析。  相似文献   

3.
Unpredictable packet loss that occurs in the channel connecting a local sensor and a remote estimator will deteriorate the performance of state estimation. To relieve this detrimental impact, an online linear temporal coding scheme is studied in this paper. If the packet of the last step is lost, a linear combination of the current and the last measurements with proper weights is transmitted; otherwise, only the current data is sent. By virtue of the innovation sequence approach, a linear minimum mean-squared error estimation algorithm is designed. To optimize performance, a novel estimator is also proposed which provides a recursive expression of the error covariances. The proposed two algorithms are proved to be equivalent via a set of transformations. With the aid of some optimization techniques, a recursive algorithm is presented to obtain the optimal coding weight in terms of minimizing the average estimation error covariance.  相似文献   

4.
This work studies the problem of kernel adaptive filtering (KAF) for nonlinear signal processing under non-Gaussian noise environments. A new KAF algorithm, called kernel recursive generalized mixed norm (KRGMN), is derived by minimizing the generalized mixed norm (GMN) cost instead of the well-known mean square error (MSE). A single error norm such as lp error norm can be used as a cost function in KAF to deal with non-Gaussian noises but it may exhibit slow convergence speed and poor misadjustments in some situations. To improve the convergence performance, the GMN cost is formed as a convex mixture of lp and lq norms to increase the convergence rate and substantially reduce the steady-state errors. The proposed KRGMN algorithm can solve efficiently the problems such as nonlinear channel equalization and system identification in non-Gaussian noises. Simulation results confirm the desirable performance of the new algorithm.  相似文献   

5.
This paper investigates the robustness, uniqueness, sufficient condition and the necessary condition for the minimum error entropy (MEE) estimation. For the robustness aspect, we show that the MEE estimator for a Gaussian nominal model is robust with respect to a relative entropy mismodeling criterion as well as the minimum mean-square error (MMSE) estimations. For the uniqueness aspect, we demonstrate by means of examples that for the singular case, the optimum solution of the MEE estimation will be nonunique. For the sufficient and the necessary condition, the former is established by the independence condition, and the later by score orthogonality condition. A specific example illustrates that the score orthogonality condition is just a necessary condition and not a sufficient one, because if an estimator satisfies the score orthogonality condition, it may be a local minimum or even a local maximum of the error entropy in a certain direction.  相似文献   

6.
Previous studies have adopted unsupervised machine learning with dimension reduction functions for cyberattack detection, which are limited to performing robust anomaly detection with high-dimensional and sparse data. Most of them usually assume homogeneous parameters with a specific Gaussian distribution for each domain, ignoring the robust testing of data skewness. This paper proposes to use unsupervised ensemble autoencoders connected to the Gaussian mixture model (GMM) to adapt to multiple domains regardless of the skewness of each domain. In the hidden space of the ensemble autoencoder, the attention-based latent representation and reconstructed features of the minimum error are utilized. The expectation maximization (EM) algorithm is used to estimate the sample density in the GMM. When the estimated sample density exceeds the learning threshold obtained in the training phase, the sample is identified as an outlier related to an attack anomaly. Finally, the ensemble autoencoder and the GMM are jointly optimized, which transforms the optimization of objective function into a Lagrangian dual problem. Experiments conducted on three public data sets validate that the performance of the proposed model is significantly competitive with the selected anomaly detection baselines.  相似文献   

7.
In this paper, we study the problem of remote state estimation on networks with random delays and unavailable packet sequence due to malicious attacks. Two maximum a posteriori (MAP) schemes are proposed to detect the unavailable packet sequence. The first MAP strategy detects the packet sequence using data within a finite time horizon; the second MAP strategy detects the packet sequence by a recursive structure, which effectively reduces the computation time. With the detected packet sequence, we further design a linear minimum mean-squared error (LMMSE) estimation algorithm based on smoothing techniques, rather than using the classic prediction and update structure. A wealth of information contained in the combined measurements is utilized to improve the estimation performance. Finally, the effectiveness of the proposed algorithms is demonstrated by simulation experiments.  相似文献   

8.
In this paper, the state estimation problem for discrete-time networked systems with communication constraints and random packet dropouts is considered. The communication constraint is that, at each sampling instant, there is at most one of the various transmission nodes in the networked systems is allowed to access a shared communication channel, and then the received data are transmitted to a remote estimator to perform the estimation task. The channel accessing process of those transmission nodes is determined by a finite-state discrete-time Markov chain, and random packet dropouts in remote data transmission are modeled by a Bernoulli distributed white sequence. Using Bayes’ rule and some results developed in this study, two state estimation algorithms are proposed in the sense of minimum mean-square error. The first algorithm is optimal, which can exactly compute the minimum mean-square error estimate of system state. The second algorithm is a suboptimal algorithm obtained under a lot of Gaussian hypotheses. The proposed suboptimal algorithm is recursive and has time-independent complexity. Computer simulations are carried out to illustrate the performance of the proposed algorithms.  相似文献   

9.
This paper investigates the state estimation problem for networked systems with colored noises and communication constraints. The colored noises are considered to be correlated to itself at other time steps, and communication constraints include two parts: (1) the information is quantized by a logarithmic quantizer before transmission, (2) only one node can access the network channel at each instant based on a specified media access protocol. A robust recursive estimator is designed under the condition of colored noises, quantization error and partially available measurements. The upper bound of the covariance of the estimation error is then derived and minimized by properly designing estimator gains. An illustrative example is finally given to demonstrate the effectiveness of the developed estimator.  相似文献   

10.
Recently, the augmented complex-valued normalized subband adaptive filtering (ACNSAF) algorithm has been proposed to process colored non-circular signals. However, its performance will deteriorate severely under impulsive noise interference. To overcome this issue, a robust augmented complex-valued normalized M-estimate subband adaptive filtering (ACNMSAF) algorithm is proposed, which is obtained by modifying the subband constraints of the ACNSAF algorithm using the complex-valued modified Huber (MH) function and is derived based on CR calculus and Lagrange multipliers. In order to improve both the convergence speed and steady-state accuracy of the fixed step size ACNMSAF algorithm, a variable step size (VSS) strategy based on the minimum mean squared deviation (MSD) criterion is devised, which allocates individual adaptive step size to each subband, fully exploiting the structural advantages of SAF and significantly improving the convergence performance of the ACNMSAF algorithm as well as its tracking capability in non-stationary environment. Then, the stability, transient and steady-state MSD performance of the ACNMSAF algorithm in the presence of colored non-circular inputs and impulsive noise are analyzed, and the stability conditions, transient and steady-state MSD formulas are also derived. Computer simulations in impulsive noise environments verify the accuracy of theoretical analysis results and the effectiveness of the proposed algorithms compared to other existing complex-valued adaptive algorithms.  相似文献   

11.
This article presents a novel tuning design of Proportional-Integral-Derivative (PID) controller in the Automatic Voltage Regulator (AVR) system by using Cuckoo Search (CS) algorithm with a new time domain performance criterion. This performance criterion was chosen to minimize the maximum overshoot, rise time, settling time and steady state error of the terminal voltage. In order to compare CS with other evolutionary algorithms, the proposed objective function was used in Particle Swarm Optimization (PSO) and Artificial Bee Colony (ABC) algorithms for PID design of the AVR system. The performance of the proposed CS based PID controller was compared to the PID controllers tuned by the different evolutionary algorithms using various objective functions proposed in the literature. Dynamic response and a frequency response of the proposed CS based PID controller were examined in detail. Moreover, the disturbance rejection and robustness performance of the tuned controller against parametric uncertainties were obtained, separately. Energy consumptions of the proposed PID controller and the PID controllers tuned by the PSO and ABC algorithms were analyzed thoroughly. Extensive simulation results demonstrate that the CS based PID controller has better control performance in comparison with other PID controllers tuned by the PSO and ABC algorithms. Furthermore, the proposed objective function remarkably improves the PID tuning optimization technique.  相似文献   

12.
This paper proposes a fuzzy neural network (FNN) based on wavelet support vector regression (WSVR) approach for system identification, in which an annealing robust learning algorithm (ARLA) is adopted to adjust the parameters of the WSVR-based FNN (WSVR-FNN). In the WSVR-FNN, first, the WSVR method with a wavelet kernel function is used to determine the number of fuzzy rules and the initial parameters of FNN. After initialization, the adjustment for the parameters of FNNs is performed by the ARLA. Combining the self-learning ability of neural networks, the compact support of wavelet functions, the adaptive ability of fuzzy logic, and the robust learning capability of ARLA, the proposed FNN has the superiority among the several existed FNNs. To demonstrate the performance of the WSVR-FNN, two nonlinear dynamic plants and a chaotic system taken from the extant literature are considered to illustrate the system identification. From the simulation results, it shows that the proposed WSVR-FNN has the superiority over several presented FNNs even the number of training parameters is considerably small.  相似文献   

13.
  相似文献   

14.
The conjugate gradient (CG) method exhibits fast convergence speed than the steepest descent, which has received considerable attention. In this work, we propose two CG-based methods for nonlinear active noise control (NLANC). The proposed filtered-s Bessel CG (FsBCG)-I algorithm implements the functional link artificial neural network (FLANN) as a controller, and it is derived from the Matérn kernel to achieve enhanced performance in various environments. On the basis of the FsBCG-I algorithm, we further develop the FsBCG-II algorithm, which utilizes the Bessel function of the first kind to constrain outliers. As an alternative, the FsBCG-II algorithm has reduced computational complexity and similar performance as compared to the FsBCG-I algorithm. Moreover, the convergence property of the algorithms is analyzed. The proposed algorithms are compared with some highly cited previous works. Extensive simulation results demonstrate that the proposed algorithms can achieve robust performance when the noise source is impulsive, Gaussian, logistic, and time-varying.  相似文献   

15.
This article is dedicated to the issue of asynchronous adaptive observer-based sliding mode control for a class of nonlinear stochastic switching systems with Markovian switching. The system under examination is subject to matched uncertainties, external disturbances, and quantized outputs and is described by a TS fuzzy stochastic switching model with a Markovian process. A quantized sliding mode observer is designed, as are two modes-dependent fuzzy switching surfaces for the error and estimated systems, based on a mode dependent logarithmic quantizer. The Lyapunov approach is employed to establish sufficient conditions for sliding mode dynamics to be robust mean square stable with extended dissipativity. Moreover, with the decoupling matrix procedure, a new linear matrix inequality-based criterion is investigated to synthesize the controller and observer gains. The adaptive control technique is used to synthesize asynchronous sliding mode controllers for error and SMO systems, respectively, so as to ensure that the pre-designed sliding surfaces can be reached, and the closed-loop system can perform robustly despite uncertainties and signal quantization error.Finally, simulation results on a one-link arm robot system are provided to show potential applications as well as validate the effectiveness of the proposed scheme.  相似文献   

16.
This paper is devoted to solving the recursive state estimation (RSE) issue for a class of complex networks (CNs) with Round-Robin (RR) protocol and switching nonlinearities (SNs). A random variable obeying the Bernoulli distribution with known statistical properties is introduced to describe the switching phenomenon between two nonlinear functions. A Gaussian noise and time-varying outer coupling strength are adopted to show the changeable network topology (CNT). The RR protocol is applied to regulate signal transmissions, which determines that the element in measurement output has access to the communication networks at each step. The purpose of this paper is to construct a recursive state estimator such that, for all SNs, time-varying topology and RR protocol, the expected state estimation performance is guaranteed. Specifically, based on two recursive matrix equations, the covariance upper bound (CUB) of state estimation error is obtained firstly and then minimized via designing estimator gain in a proper way. Moreover, a feasible criterion is given to guarantee that the trace of obtained CUB is bounded and a monotonicity relationship is established between state estimation error and time-varying outer coupling strength. Lastly, a simulation experiment is illustrated to verify the feasibility of the addressed estimation method.  相似文献   

17.
This paper proposes an observer-based fuzzy adaptive output feedback control scheme for a class of uncertain single-input and single-output (SISO) nonlinear stochastic systems with quantized input signals and arbitrary switchings. The SISO system under consideration contains completely unknown nonlinear functions, unmeasured system states and quantized input signals quantized by a hysteretic quantizer. By adopting a new nonlinear disposal of the quantized input, the relationship between the control input and the quantized input is established. The hysteretic quantizer that we take can effectively avoid the chattering phenomena. Furthermore, the introduction of a linear observer makes the estimation of the states possible. Based on the universal approximation ability of the fuzzy logic systems (FLSs) and backstepping recursive design with the common stochastic Lyapunov function approach, a quantized output feedback control scheme is constructed, where the dynamic surface control (DSC) is explored to alleviate the computation burden. The proposed control scheme cannot only guarantee the boundedness of signals but also make the output of the system converge to a small neighborhood of the origin. The simulation results are exhibited to demonstrate the validity of the control scheme.  相似文献   

18.
This paper investigates two intricate problems in magnetic levitation systems: the loss of the information during the transmission over a limited communication network channel and the chattering caused by external disturbances. By combining input quantization technique with two infinitesimal smooth functions, we successfully construct a continuous robust adaptive feedback controller which stabilizes the position of the levitated electromagnet at the equilibrium point. Compared with the existing methods, the proposed quantized control strategy not only guarantees the global stability with asymptotic state regulation of the system even if there are external disturbances, but also exhibits better performance than that of traditional PID control. The simulation validates the robustness and effectiveness of the proposed scheme.  相似文献   

19.
In this paper, we mainly tend to consider distributed leader-following fixed-time quantized consensus problem of nonlinear multi-agent systems via impulsive control. An appropriate quantized criterion and some novel control protocols are proposed in order to solve the problem. The protocols proposed integrates the two control strategies from the point of view of reducing communication costs and constraints, which are quantized control and impulsive control. The fixed-time quantized consensus of multi-agent is analyzed in terms of algebraic graph theory, Lyapunov theory and comparison system theory, average impulsive interval. The results show that if some sufficient conditions are met, the fixed-time consensus of multi-agent systems can be guaranteed under impulsive control with quantized relative state measurements. In addition, compared with finite-time consensus, the settling-time of fixed-time quantized consensus does not depend on the initial conditions of each agent but on the parameters of the protocol. Finally, numerical simulations are exploited to illustrate the effectiveness and performance to support our theoretical analysis.  相似文献   

20.
Digital filters can be broadly classified into two groups: recursive (infinite impulse response (IIR)) and non-recursive (finite impulse response (FIR)). An IIR filter can provide a much better performance than the FIR filter having the same number of coefficients. However, IIR filters might have a multi-modal error surface. Therefore, a reliable design method proposed for IIR filters must be based on a global search procedure. Artificial bee colony (ABC) algorithm has been recently introduced for global optimization. The ABC algorithm simulating the intelligent foraging behaviour of honey bee swarm is a simple, robust, and very flexible algorithm. In this work, a new method based on ABC algorithm for designing digital IIR filters is described and its performance is compared with that of a conventional optimization algorithm (LSQ-nonlin) and particle swarm optimization (PSO) algorithm.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号