scholarly journals Improved Backstepping Control of a DFIG based Wind Energy Conversion System using Ant Lion Optimizer Algorithm

Author(s):  
Zoubir Zeghdi ◽  
Linda Barazane ◽  
Youcef Bekakra ◽  
Abdelkader Larabi

In this paper, an improved Backstepping control based on a recent optimization method called Ant Lion Optimizer (ALO) algorithm for a Doubly Fed Induction Generator (DFIG) driven by a wind turbine is designed and presented. ALO algorithm is applied for obtaining optimum Backstepping control (BCS) parameters that are able to make the drive more robust with a faster dynamic response, higher accuracy and steady performance. The fitness function of the ALO algorithm to be minimized is designed using some indexes criterion like Integral Time Absolute Error (ITAE) and Integral Time Square Error (ITSE). Simulation tests are carried out in MATLAB/Simulink environment to validate the effectiveness of the proposed BCS-ALO and compared to the conventional BCS control. The results prove that the objectives of this paper were accomplished in terms of robustness, better dynamic efficiency, reduced harmonic distortion, minimization of stator powers ripples and performing well in solving the problem of uncertainty of the model parameter.

2020 ◽  
Vol 10 (1) ◽  
pp. 396-407
Author(s):  
Fatiha Loucif ◽  
Sihem Kechida

AbstractIn this paper, a sliding mode controller (SMC) with PID surface is designed for the trajectory tracking control of a robot manipulator using different optimization algorithms such as, Antlion Optimization Algorithm (ALO) Sine Cosine Algorithm (SCA) Grey Wolf Optimizer (GWO) and Whale Optimizer Algorithm (WOA). The aim of this work is to introduce a novel SMC-PID-ALO to control nonlinear systems, especially the position of two of the joints of a 2DOF robot manipulator. The basic idea is to determinate four optimal parameters (Kp, Ki, Kd and lamda) ensuring the best performance of a robot manipulator system, minimizing the integral time absolute error criterion (ITAE) and the integral time square error criterion (ISTE). The robot manipulator is modeled in Simulink and the control is implemented using the MATLAB environment. The obtained simulation results prove the robustness of ALO in comparison with other algorithms.


2018 ◽  
Vol 15 (2) ◽  
pp. 254-272 ◽  
Author(s):  
Umamaheswari Elango ◽  
Ganesan Sivarajan ◽  
Abirami Manoharan ◽  
Subramanian Srikrishna

Purpose Generator maintenance scheduling (GMS) is an essential task for electric power utilities as the periodical maintenance activity enhances the lifetime and also ensures the reliable and continuous operation of generating units. Though numerous meta-heuristic algorithms have been reported for the GMS solution, enhancing the existing techniques or developing new optimization procedure is still an interesting research task. The meta-heuristic algorithms are population based and the selection of their algorithmic parameters influences the quality of the solution. This paper aims to propose statistical tests guided meta-heuristic algorithm for solving the GMS problems. Design/methodology/approach The intricacy characteristics of the GMS problem in power systems necessitate an efficient and robust optimization tool. Though several meta-heuristic algorithms have been applied to solve the chosen power system operational problem, tuning of their control parameters is a protracting process. To prevail over the previously mentioned drawback, the modern meta-heuristic algorithm, namely, ant lion optimizer (ALO), is chosen as the optimization tool for solving the GMS problem. Findings The meta-heuristic algorithms are population based and require proper selection of algorithmic parameters. In this work, the ANOVA (analysis of variance) tool is proposed for selecting the most feasible decisive parameters in algorithm domain, and the statistical tests-based validation of solution quality is described. The parametric and non-parametric statistical tests are also performed to validate the selection of ALO against the various competing algorithms. The numerical and statistical results confirm that ALO is a promising tool for solving the GMS problems. Originality/value As a first attempt, ALO is applied to solve the GMS problem. Moreover, the ANOVA-based parameter selection is proposed and the statistical tests such as Wilcoxon signed rank and one-way ANOVA are conducted to validate the applicability of the intended optimization tool. The contribution of the paper can be summarized in two folds: the ANOVA-based ALO for GMS applications and statistical tests-based performance evaluation of intended algorithm.


2018 ◽  
Vol 8 (9) ◽  
pp. 1613 ◽  
Author(s):  
Utku Kose

The prediction of future events based on available time series measurements is a relevant research area specifically for healthcare, such as prognostics and assessments of intervention applications. A measure of brain dynamics, electroencephalogram time series, are routinely analyzed to obtain information about current, as well as future, mental states, and to detect and diagnose diseases or environmental factors. Due to their chaotic nature, electroencephalogram time series require specialized techniques for effective prediction. The objective of this study was to introduce a hybrid system developed by artificial intelligence techniques to deal with electroencephalogram time series. Both artificial neural networks and the ant-lion optimizer, which is a recent intelligent optimization technique, were employed to comprehend the related system and perform some prediction applications over electroencephalogram time series. According to the obtained findings, the system can successfully predict the future states of target time series and it even outperforms some other hybrid artificial neural network-based systems and alternative time series prediction approaches from the literature.


Author(s):  
Jorge de Almeida Brito Júnior ◽  
Manoel Henrique Reis Nascimento ◽  
Carlos Alberto Oliveira de Freitas ◽  
Jandecy Cabral Leite ◽  
Tirso Lorenzo Reyes Carvajal
Keyword(s):  

2021 ◽  
Author(s):  
Giorgio Gambirasio

AbstractThe classical approach for tackling the problem of drawing the 'best fitting line' through a plot of experimental points (here called a scenario) is the least square process applied to the errors along the vertical axis. However, more elaborate processes exist or may be found. In this report, we present a comprehensive study on the subject. Five possible processes are identified: two of them (respectively called VE, HE) measure errors along one axis, and the remaining three (respectively called YE, PE, and AE) take into consideration errors along both axes. Since the axes and their corresponding errors may have different physical dimensions, a procedure is proposed to compensate for this difference so that all processes could express their answers in the same consistent dimensions. As usual, to avoid mutual cancellation, errors are squared or taken in their absolute value. The two cases are separately studied.In the case of squared errors, the five processes are tested in many scenarios of experimental points, both analytically (using the software Mathematica) and numerically (with programs written on Python platform employing the Nelder-Mead optimization method). The investigation showed the possible existence of multiple solutions. Different answers originating from different starting points in Nelder?Mead correspond to solutions revealed by analytic search with Mathematica. For each scenario of experimental points, it was found that the best lines of the five processes intercept at a common point. Furthermore, the point of intercept happens to coincide with the 'center of mass' of the scenario. This fact is described by stating the existence of an empirical 'Meeting Point Law'. The case of absolute errors is only treated numerically, with Nelder?Mead minimizer. As expected, the absolute error option shows greater robustness against outliers than the square error option, for all processes. The Meeting Point Law is not valid in this case.By taking the value of minimized error as a criterion, the five processes are compared for efficiency. On average, processes PE and AE, that consider errors along both axes, resulted in the smallest minimized error and may be considered the best processes. Processes that rely on errors along a single axis (VE, HE) stay at the second place. In all cases, YE is the process that results in the largest minimized errors


Sign in / Sign up

Export Citation Format

Share Document