391 research outputs found

    Hybrid spiral-dynamic bacteria-chemotaxis algorithm with application to control two-wheeled machines

    Get PDF
    This paper presents the implementation of the hybrid spiral-dynamic bacteria-chemotaxis (HSDBC) approach to control two different configurations of a two-wheeled vehicle. The HSDBC is a combination of bacterial chemotaxis used in bacterial forging algorithm (BFA) and the spiral-dynamic algorithm (SDA). BFA provides a good exploration strategy due to the chemotaxis approach. However, it endures an oscillation problem near the end of the search process when using a large step size. Conversely; for a small step size, it affords better exploitation and accuracy with slower convergence. SDA provides better stability when approaching an optimum point and has faster convergence speed. This may cause the search agents to get trapped into local optima which results in low accurate solution. HSDBC exploits the chemotactic strategy of BFA and fitness accuracy and convergence speed of SDA so as to overcome the problems associated with both the SDA and BFA algorithms alone. The HSDBC thus developed is evaluated in optimizing the performance and energy consumption of two highly nonlinear platforms, namely single and double inverted pendulum-like vehicles with an extended rod. Comparative results with BFA and SDA show that the proposed algorithm is able to result in better performance of the highly nonlinear systems

    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

    Novel metaheuristic hybrid spiral-dynamic bacteria-chemotaxis algorithms for global optimisation

    Get PDF
    © 2014 Elsevier B.V. All rights reserved. This paper presents hybrid spiral-dynamic bacteria-chemotaxis algorithms for global optimisation and their application to control of a flexible manipulator system. Spiral dynamic algorithm (SDA) has faster convergence speed and good exploitation strategy. However, the incorporation of constant radius and angular displacement in its spiral model causes the exploration strategy to be less effective hence resulting in low accurate solution. Bacteria chemotaxis on the other hand, is the most prominent strategy in bacterial foraging algorithm. However, the incorporation of a constant step-size for the bacteria movement affects the algorithm performance. Defining a large step-size results in faster convergence speed but produces low accuracy while de.ning a small step-size gives high accuracy but produces slower convergence speed. The hybrid algorithms proposed in this paper synergise SDA and bacteria chemotaxis and thus introduce more effective exploration strategy leading to higher accuracy, faster convergence speed and low computation time. The proposed algorithms are tested with several benchmark functions and statistically analysed via nonparametric Friedman and Wilcoxon signed rank tests as well as parametric t-test in comparison to their predecessor algorithms. Moreover, they are used to optimise hybrid Proportional-Derivative-like fuzzy-logic controller for position tracking of a flexible manipulator system. The results show that the proposed algorithms significantly improve both convergence speed as well as fitness accuracy and result in better system response in controlling the flexible manipulator

    A novel hybrid bacteria-chemotaxis spiral-dynamic algorithm with application to modelling of flexible systems

    Get PDF
    This paper presents a novel hybrid optimisation algorithm namely HBCSD, which synergises a bacterial foraging algorithm (BFA) and spiral dynamics algorithm (SDA). The main objective of this strategy is to develop an algorithm that is capable to reach a global optimum point at the end of the final solution with a faster convergence speed compared to its predecessor algorithms. The BFA is incorporated into the algorithm to act as a global search or exploration phase. The solutions from the exploration phase then feed into SDA, which acts as a local search or exploitation phase. The proposed algorithm is used in dynamic modelling of two types of flexible systems, namely a flexible robot manipulator and a twin rotor system. The results obtained show that the proposed algorithm outperforms its predecessor algorithms in terms of fitness accuracy, convergence speed, and time-domain and frequency-domain dynamic characterisation of the two flexible systems. © 2014 Elsevier Ltd

    Bacterial foraging-optimized PID control of a two-wheeled machine with a two-directional handling mechanism

    Get PDF
    This paper presents the performance of utilizing a bacterial foraging optimization algorithm on a PID control scheme for controlling a five DOF two-wheeled robotic machine with two-directional handling mechanism. The system under investigation provides solutions for industrial robotic applications that require a limited-space working environment. The system nonlinear mathematical model, derived using Lagrangian modeling approach, is simulated in MATLAB/Simulink(®) environment. Bacterial foraging-optimized PID control with decoupled nature is designed and implemented. Various working scenarios with multiple initial conditions are used to test the robustness and the system performance. Simulation results revealed the effectiveness of the bacterial foraging-optimized PID control method in improving the system performance compared to the PID control scheme

    An Improved Adaptive Spiral Dynamic Algorithm for Global Optimization

    Get PDF
    This paper proposes a new strategy to enhance the performance and accuracy of the Spiral dynamic algorithm (SDA) for use in solving real-world problems by hybridizing the SDA with the Bacterial Foraging optimization algorithm (BFA). The dynamic step size of SDA makes it a useful exploitation approach. However, it has limited exploration throughout the diversification phase, which results in getting trapped at local optima. The optimal initialization position for the SDA algorithm has been determined with the help of the chemotactic strategy of the BFA optimization algorithm, which has been utilized to improve the exploration approach of the SDA. The proposed Hybrid Adaptive Spiral Dynamic Bacterial Foraging (HASDBF) algorithm is designed so that the chemotaxis phase of bacteria represents the exploration part of the search operation. In contrast, the SDA represents the exploitation part. Additionally, to improve search operation efficiency, the spiral model's radius and angular displacement are adaptively set according to a linear correlation concerning the fitness value. An additional phase, the elimination and dispersal phase, is obtained from BFA and added to the end of the SDA. This phase aims to improve the algorithm's final solution's accuracy by enhancing the algorithm's search strategy and performance. Simulation tests are run on unimodal and multimodal standard benchmark functions to verify the proposed algorithm. The proposed algorithm significantly outperforms SDA and Adaptive SDA (ASDA) algorithms regarding fitness value and accuracy.

    Comprehensive Taxonomies of Nature- and Bio-inspired Optimization: Inspiration Versus Algorithmic Behavior, Critical Analysis Recommendations

    Get PDF
    In recent algorithmic family simulates different biological processes observed in Nature in order to efficiently address complex optimization problems. In the last years the number of bio-inspired optimization approaches in literature has grown considerably, reaching unprecedented levels that dark the future prospects of this field of research. This paper addresses this problem by proposing two comprehensive, principle-based taxonomies that allow researchers to organize existing and future algorithmic developments into well-defined categories, considering two different criteria: the source of inspiration and the behavior of each algorithm. Using these taxonomies we review more than three hundred publications dealing with nature- inspired and bio-inspired algorithms, and proposals falling within each of these categories are examined, leading to a critical summary of design trends and similarities between them, and the identification of the most similar classical algorithm for each reviewed paper. From our analysis we conclude that a poor relationship is often found between the natural inspiration of an algorithm and its behavior. Furthermore, similarities in terms of behavior between different algorithms are greater than what is claimed in their public disclosure: specifically, we show that more than one-third of the reviewed bio-inspired solvers are versions of classical algorithms. Grounded on the conclusions of our critical analysis, we give several recommendations and points of improvement for better methodological practices in this active and growing research field

    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

    Hybrid bacterial foraging sine cosine algorithm for solving global optimization problems

    Get PDF
    This paper proposes a new hybrid algorithm between Bacterial Foraging Algorithm (BFA) and Sine Cosine Algorithm (SCA) called Hybrid Bacterial Foraging Sine Cosine Algorithm (HBFSCA) to solve global optimization problems. The proposed HBFSCA algorithm synergizes the strength of BFA to avoid local optima with the adaptive step-size and highly randomized movement in SCA to achieve higher accuracy compared to its original counterparts. The performances of the proposed algorithm have been investigated on a set of single-objective minimization problems consist of 30 benchmark functions, which include unimodal, multimodal, hybrid, and composite functions. The results obtained from the test functions prove that the proposed algorithm outperforms its original counterparts significantly in terms of accuracy, convergence speed, and local optima avoidance
    corecore