Search

The paper is focused on issues related to the control of electrical drives with oscillations of state variables. The main problem deals with the construction of the mechanical part, which contains elastic elements used as a coupling between the motor machine and the load. In such cases, strict tracking of the reference trajectory is difficult, so damping of the disturbances is necessary. For this purpose, the full state vector of the object is applied as the feedback signal for the speed controller. This method is efficient and relatively easy to implement (including the hardware part). However, the control accuracy is dependent on the quality of the parameters identification and the invariance of the object. Thus, two adaptive structures are proposed for the two-mass system. Moreover, selected coefficients were optimized using metaheuristic algorithms (symbiotic organism search and flower pollination algorithm). After presentation of the preliminaries and mathematical background, tests were conducted, and the numerical simulations are shown. Finally, the experimental verification for the 0.5 kW DC machines was performed. The results confirm the theoretical concept and the initial assumptions: the state controller leads to the precise control of the drive with a long shaft; recalculation of the parameters can improve the work of the drive under changes of time constants; modern design tools are appropriate for this application. [ABSTRACT FROM AUTHOR]

Background. The most common and successful technique for signal denoising with nonstationary signals, such as electroencephalogram (EEG) and electrocardiogram (ECG) is the wavelet transform (WT). The success of WT depends on the optimal configuration of its control parameters which are often experimentally set. Fortunately, the optimality of the combination of these parameters can be measured in advance by using the mean squared error (MSE) function. Method. In this paper, five powerful metaheuristic algorithms are proposed to find the optimal WT parameters for EEG signal denoising which are harmony search (HS), β-hill climbing (β-hc), particle swarm optimization (PSO), genetic algorithm (GA), and flower pollination algorithm (FPA). It is worth mentioning that this is the initial investigation of using optimization methods for WT parameter configuration. This paper then examines which efficient algorithm has obtained the minimum MSE and the best WT parameter configurations. Result. The performance of the proposed algorithms is tested using two standard EEG datasets, namely, Kiern's EEG dataset and EEG Motor Movement/Imagery dataset. The results of the proposed algorithms are evaluated using five common criteria: signal-to-noise-ratio (SNR), SNR improvement, mean square error (MSE), root mean square error (RMSE), and percentage root mean square difference (PRD). Interestingly, for almost all evaluating criteria, FPA achieves the best parameters configuration for WT and empowers this technique to efficiently denoise the EEG signals for almost all used datasets. To further validate the FPA results, a comparative study between the FPA results and the results of two previous studies is conducted, and the findings favor to FPA. Conclusion. In conclusion, the results show that the proposed methods for EEG signal denoising can produce better results than manual configurations based on ad hoc strategy. Therefore, using metaheuristic approaches to optimize the parameters for EEG signals positively affects the denoising process performance of the WT method.

Feature selection (FS) in data mining is one of the most challenging and most important activities in pattern recognition. In this article, a new hybrid model of whale optimization algorithm (WOA) and flower pollination algorithm (FPA) is presented for the problem of FS based on the concept of opposition‐based learning (OBL) which name is HWOAFPA. The procedure is that the WOA is run first and at the same time during the run, the WOA population is changed by the OBL. And, to increase the accuracy and speed of convergence, it is used as the initial population of FPA. To evaluate the performance of the proposed method, experiments were carried out in two steps. The experiments were performed on 10 datasets from the UCI data repository and Email spam detection datasets. The results obtained from the first step showed that the proposed method was more successful in terms of the average size of selection and classification accuracy than other basic metaheuristic algorithms. In addition, the results from the second step showed that the proposed method which was a run on the Email spam dataset performed much more accurately than other similar algorithms in terms of accuracy of Email spam detection. [ABSTRACT FROM AUTHOR]

Flower pollination algorithm is a recent metaheuristic algorithm for solving nonlinear global optimization problems. The algorithm has also been extended to solve multiobjective optimization with promising results. In this work, we analyze this algorithm mathematically and prove its convergence properties by using Markov chain theory. By constructing the appropriate transition probability for a population of flower pollen and using the homogeneity property, it can be shown that the constructed stochastic sequences can converge to the optimal set. Under the two proper conditions for convergence, it is proved that the simplified flower pollination algorithm can indeed satisfy these convergence conditions and thus the global convergence of this algorithm can be guaranteed. Numerical experiments are used to demonstrate that the flower pollination algorithm can converge quickly in practice and can thus achieve global optimality efficiently. [ABSTRACT FROM AUTHOR]