5 research outputs found

    Opposition-based manta ray foraging algorithm for global optimization and its application to optimize nonlinear type-2 fuzzy logic control

    Get PDF
    Interval Type-2 Fuzzy Logic Control (IT2FLC) possesses a high control ability in a way that it can optimally handle the presence of uncertainty in a system dynamic. However, the design of such a control scheme is a challenging task due to its complex structure and nonlinear behavior. A Manta Ray Foraging Optimization (MRFO) is a promising algorithm that can be applied to optimize the control design. However, MRFO still suffers the local optima problem due to unbalance exploration-exploitation of the MRFO agents and hence limiting the performance of the desired control. In this paper, Standard, Quasi, Super, and Quasi-Reflected opposition strategies are integrated into the MRFO structure. Each strategy enhances the exploration-exploitation capability and offers different approaches of varying agent’s step size relative to the algorithm’s iteration. The proposed opposition-based MRFO (OMRFO) algorithms are applied to optimize the IT2FLC control design for a laboratory-scaled inverted pendulum system. Moreover, as the algorithms are also promising strategies to other problems, they are applied to solve 50D of 30 IEEE CEC14 benchmark functions representing problems with different features. Performance analysis of the algorithms is statistically conducted using Wilcoxon sign rank and Friedman tests. The result shows that the performance of MRFO and Quasi-Reflected-OMRFO are equal, while all other OMRFO variants show a significant improvement and better rank over the MRFO. The Super and Quasi OMRFO-IT2FLC schemes acquired the best responses for the cart and pendulum, respectively

    Hybrid spiral-bacterial foraging algorithm for a fuzzy control design of a flexible manipulator

    Get PDF
    A novel hybrid strategy combining a spiral dynamic algorithm (SDA) and a bacterial foraging algorithm (BFA) is presented in this article. A spiral model is incorporated into the chemotaxis of the BFA algorithm to enhance the capability of exploration and exploitation phases of both SDA and BFA with the aim to improve the fitness accuracy for the SDA and the convergence speed as well as the fitness accuracy for BFA. The proposed algorithm is tested with the Congress on Evolutionary Computation 2013 (CEC2013) benchmark functions, and its performance in terms of accuracy is compared with its predecessor algorithms. Consequently, for solving a complex engineering problem, the proposed algorithm is employed to obtain and optimise the fuzzy logic control parameters for the hub angle tracking of a flexible manipulator system. Analysis of the performance test with the benchmark functions shows that the proposed algorithm outperforms its predecessor algorithms with significant improvements and has a competitive performance compared to other well-known algorithms. In the context of solving a real-world problem, it is shown that the proposed algorithm achieves a faster convergence speed and a more accurate solution. Moreover, the time-domain response of the hub angle shows that the controller optimised by the proposed algorithm tracks the desired system response very well

    A multiobjective simulated Kalman filter optimization algorithm

    Get PDF
    This paper presents a new multiobjective type optimization algorithm known as a Multiobjective Optimization Simulated Kalman Filter (MOSKF). It is a further enhancement of a single-objective Simulated Kalman Filter (SKF) optimization algorithm. A synergy between SKF and Non-dominated Solution (NS) approach is introduced to formulate the multiobjective type algorithm. SKF is a random based optimization algorithm inspired from Kalman Filter theory. A Kalman gain is formulated following the prediction, measurement and estimation steps of the Kalman filter design. The Kalman gain is utilized to introduce a dynamic step size of a search agent in the SKF algorithm. A Non-dominated Solution (NS) approach is utilized in the formulation of the multiobjective strategy. Cost function value and diversity spacing parameters are taken into consideration in the strategy. Every single agent carries those two parameters in which will be used to compare with other solutions from other agents in order to determine its domination. A solution that has a lower cost function value and higher diversity spacing is considered as a solution that dominates other solutions and thus is ranked in a higher ranking. The algorithm is tested with various multiobjective benchmark functions and compared with Non-Dominated Sorting Genetic Algorithm 2 (NSGA2) multiobjective algorithm. Result of the analysis on the accuracy tested on the benchmark functions is tabulated in a table form and shows that the proposed algorithm outperforms NSGA2 significantly. The result also is presented in a graphical form to compare the generated Pareto solution based on proposed MOSKF and original NSGA2 with the theoretical Pareto solution

    MOSDA: A proposal for multiple objective spiral dynamics algorithm

    Get PDF
    This paper proposed a multi-objective spiral dynamic algorithm (MOSDA) to solve multiple objectives problems. SDA is originally a single objective optimizer that inspired based on the spiral phenomena in nature. It has a good elitism strategy and has a simple structure. A method called “archive method” that is used in multi-objective particle swarm optimization (MOPSO) is adopted into SDA to develop its multiobjective (MO) type algorithm. Moreover, MOSDA is formulated by applying the widely-used concept of Pareto dominance to determine the movement of the particles and at the same time, the algorithm maintains the non-dominated solution in a setup global repository. These non-dominated solutions then will be used to guide other particles to move. The proposed algorithm is tested with several benchmark functions for multi-objective problems. Pareto front (PF) graphs are presented as the results of these tests. The accuracy and diversity of the produced PF are highly competitive compared to MOPSO

    A multi-objective Spiral Dynamic algorithm and its application for PD design

    No full text
    This paper presents a novel multi-objective Spiral Dynamic Optimization (MOSDA) algorithm. It is an extended version of a single objective type SDA. A Non-dominated sorting (NS) approach from Non-dominated Sorting Genetic Algorithm II (NSGAII) is adopted into SDA to develop its multi-objective (MO) type algorithm. SDA has a good elitism strategy and a simple structure. On the other hand, NS is a fast strategy to develop good Pareto Front (PF) characteristics for MO type algorithm. The proposed algorithm is tested with various benchmark functions used to test a newly developed MO algorithm. A PF graph is presented as a result of the test. Moreover, it is adopted to optimize parameters of Proportional- Derivative (PD) controller for an Inverted Pendulum (IP) system. Time-domain response of the IP is presented to show performance of the optimized controller. Result presented in this paper shows that MOSDA has a better performance in terms of finding PF and solution spread when tested with benchmark functions compared to NSGAII. In terms of its application in solving a real problem, both algorithms successfully optimize the PD and control the system very well. IP controlled by MOSDA- based PD shows better rise time
    corecore