Improved Fractional-Order PSO for PID Tuning

2021 ◽  
pp. 2159016
Author(s):  
Shoubao Su ◽  
Zhaorui Zhai ◽  
Chishe Wang ◽  
Kaimeng Ding
Keyword(s):  
Particle Swarm Optimization ◽  
Fractional Order ◽  
Particle Swarm ◽  
Population Diversity ◽  
Time Factor ◽  
Local Optimum ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Pid Tuning ◽  
Convergence Performance

The traditional fractional-order particle swarm optimization (FOPSO) algorithm depends on the fractional order [Formula: see text], and it is easy to fall into local optimum. To overcome these disadvantages, a novel perspective with PID gains tuning procedure is proposed by combining the time factor with FOPSO, i.e. a new fractional-order particle swarm optimization called TFFV-PSO, which reduces the dependence on the fractional order to enhance the ability of particles to escape from local optimums. According to its influence on the performance of the algorithm, the time factor is varied with population diversity parameters to balance the exploration and exploitation capabilities of the particle swarm, so as to adjust the convergence speed of the algorithm, then it follows that a better convergence performance will be obtained. The improved method is tested on several benchmark functions and applied to tune the PID controller parameters. The experimental results and the comparison with previous other methods show that our proposed TFFV-PSO provides an adequate velocity of convergence and a satisfying accuracy, as well as even better robustness.

Improved Particle Swarm Optimization Algorithm and its Application Based on the Aggregation Degree

2013 ◽  
Vol 427-429 ◽  
pp. 1934-1938
Author(s):  
Zhong Rong Zhang ◽  
Jin Peng Liu ◽  
Ke De Fei ◽  
Zhao Shan Niu
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Optimization Problems ◽  
Particle Swarm ◽  
Population Diversity ◽  
Function Optimization ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization

The aim is to improve the convergence of the algorithm, and increase the population diversity. Adaptively particles of groups fallen into local optimum is adjusted in order to realize global optimal. by judging groups spatial location of concentration and fitness variance. At the same time, the global factors are adjusted dynamically with the action of the current particle fitness. Four typical function optimization problems are drawn into simulation experiment. The results show that the improved particle swarm optimization algorithm is convergent, robust and accurate.

Local Best Particle Swarm Optimization Using Crown Jewel Defense Strategy

2018 ◽  
pp. 27-52 ◽  
Author(s):  
Jiarui Zhou ◽  
Junshan Yang ◽  
Ling Lin ◽  
Zexuan Zhu ◽  
Zhen Ji
Keyword(s):  
Particle Swarm Optimization ◽  
High Efficiency ◽  
Particle Swarm ◽  
Global Optimum ◽  
Population Diversity ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Local Optima ◽  
Von Neumann ◽  
Swarm Intelligence Algorithm

Particle swarm optimization (PSO) is a swarm intelligence algorithm well known for its simplicity and high efficiency on various problems. Conventional PSO suffers from premature convergence due to the rapid convergence speed and lack of population diversity. It is easy to get trapped in local optima. For this reason, improvements are made to detect stagnation during the optimization and reactivate the swarm to search towards the global optimum. This chapter imposes the reflecting bound-handling scheme and von Neumann topology on PSO to increase the population diversity. A novel crown jewel defense (CJD) strategy is introduced to restart the swarm when it is trapped in a local optimum region. The resultant algorithm named LCJDPSO-rfl is tested on a group of unimodal and multimodal benchmark functions with rotation and shifting. Experimental results suggest that the LCJDPSO-rfl outperforms state-of-the-art PSO variants on most of the functions.

Design and Simulation of an Improved Particle Swarm Optimization

2010 ◽  
Vol 20-23 ◽  
pp. 1280-1285
Author(s):  
Jian Xiang Wei ◽  
Yue Hong Sun
Keyword(s):  
Particle Swarm Optimization ◽  
Dimensional Space ◽  
Numerical Test ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Population Diversity ◽  
Test Problems ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Pso

The particle swarm optimization (PSO) algorithm is a new population search strategy, which has exhibited good performance through well-known numerical test problems. However, it is easy to trap into local optimum because the population diversity becomes worse during the evolution. In order to overcome the shortcoming of the PSO, this paper proposes an improved PSO based on the symmetry distribution of the particle space position. From the research of particle movement in high dimensional space, we can see: the more symmetric of the particle distribution, the bigger probability can the algorithm be during converging to the global optimization solution. A novel population diversity function is put forward and an adjustment algorithm is put into the basic PSO. The steps of the proposed algorithm are given in detail. With two typical benchmark functions, the experimental results show the improved PSO has better convergence precision than the basic PSO.

Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization

2011 ◽  
Vol 2 (3) ◽  
pp. 43-69 ◽  
Author(s):  
Shi Cheng ◽  
Yuhui Shi ◽  
Quande Qin
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Population Diversity ◽  
Premature Convergence ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Boundary Constraints ◽  
Constraints Handling ◽  
The Impact ◽  
Search Information

Premature convergence happens in Particle Swarm Optimization (PSO) for solving both multimodal problems and unimodal problems. With an improper boundary constraints handling method, particles may get “stuck in” the boundary. Premature convergence means that an algorithm has lost its ability of exploration. Population diversity is an effective way to monitor an algorithm’s ability of exploration and exploitation. Through the population diversity measurement, useful search information can be obtained. PSO with a different topology structure and a different boundary constraints handling strategy will have a different impact on particles’ exploration and exploitation ability. In this paper, the phenomenon of particles gets “stuck in” the boundary in PSO is experimentally studied and reported. The authors observe the position diversity time-changing curves of PSOs with different topologies and different boundary constraints handling techniques, and analyze the impact of these setting on the algorithm’s ability of exploration and exploitation. From these experimental studies, an algorithm’s ability of exploration and exploitation can be observed and the search information obtained; therefore, more effective algorithms can be designed to solve problems.

Dynamic Small World Network Topology for Particle Swarm Optimization

2016 ◽  
Vol 30 (09) ◽  
pp. 1660009 ◽  
Author(s):  
Qingxue Liu ◽  
Barend Jacobus van Wyk ◽  
Shengzhi Du ◽  
Yanxia Sun
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Small World ◽  
Population Diversity ◽  
Benchmark Problems ◽  
Small World Network ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Dynamic Topology ◽  
Neighborhood Topology

A new particle optimization algorithm with dynamic topology is proposed based on small world network. The technique imitates the dissemination of information in a small world network by dynamically updating the neighborhood topology of the Particle Swarm Optimization (PSO). In comparison with other four classic topologies and two PSO algorithms based on small world network, the proposed dynamic neighborhood strategy is more effective in coordinating the exploration and exploitation ability of PSO. Simulations demonstrated that the convergence of the swarms is faster than its competitors. Meanwhile, the proposed method maintains population diversity and enhances the global search ability for a series of benchmark problems.

An Improved Particle Swarm Optimization Algorithm with Invasive Weed

2012 ◽  
Vol 621 ◽  
pp. 356-359 ◽  
Author(s):  
Huan Zhao ◽  
Jiang Long Yu ◽  
Arash Tahmasebi ◽  
Pei Hong Wang
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Local Optimum ◽  
Exploration And Exploitation ◽  
Invasive Weed ◽  
Swarm Optimization ◽  
Test Function ◽  
Stochastic Optimization Algorithm

This paper presents a hybrid algorithm based on invasive weed optimization (IWO) and particle swarm optimization (PSO), named IW-PSO. IWO is a relatively novel numerical stochastic optimization algorithm. By incorporating the reproduction and spatial dispersal of IWO into the traditional PSO, exploration and exploitation of the PSO can be enhanced and well balanced to achieve better performance. In a set of 15 test function problem, the parameters of IW-PSO were analyzed and selected, and the computational results show that IW-PSO can effectively obtain higher quality solutions so as to avoid being trapped in local optimum, comparing with PSO and IWO.

An Efficient Particle Swarm Optimization for Large-Scale Hardware/Software Co-Design System

2018 ◽  
Vol 27 (01) ◽  
pp. 1741001 ◽  
Author(s):  
Xiaohu Yan ◽  
Fazhi He ◽  
Neng Hou ◽  
Haojun Ai
Keyword(s):  
Particle Swarm Optimization ◽  
Large Scale ◽  
Particle Swarm ◽  
Population Diversity ◽  
Design System ◽  
Local Optimum ◽  
Solution Quality ◽  
Swarm Optimization ◽  
Simple Implementation ◽  
Biology Research

In the co-design process of hardware/software (HW/SW) system, especially for large and complicated embedded systems, HW/SW partitioning is a challenging step. Among different heuristic approaches, particle swarm optimization (PSO) has the advantages of simple implementation and computational efficiency, which is suitable for solving large-scale problems. This paper presents a conformity particle swarm optimization with fireworks explosion operation (CPSO-FEO) to solve large-scale HW/SW partitioning. First, the proposed CPSO algorithm simulates the conformist mentality from biology research. The CPSO particles with psychological conformist always try to move toward a secure point and avoid being attacked by natural enemy. In this way, there is a greater possibility to increase population diversity and avoid local optimum in CPSO. Next, to enhance the search accuracy and solution quality, an improved FEO with new initialization strategy is presented and is combined with CPSO algorithm to search a better position for the global best position. This combination can keep both the diversified and intensified searching. At last, the experiments on benchmarks and large-scale HW/SW partitioning demonstrate the efficiency of the proposed algorithm.

scholarly journals A Novel Approach for Shearer Cutting Load Identification through Integration of Improved Particle Swarm Optimization and Wavelet Neural Network

2014 ◽  
Vol 6 ◽  
pp. 521629 ◽  
Author(s):  
Zhongbin Wang ◽  
Lei Si ◽  
Chao Tan ◽  
Xinhua Liu
Keyword(s):  
Neural Network ◽  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Wavelet Neural Network ◽  
Population Diversity ◽  
Local Optimum ◽  
Swarm Optimization ◽  
Improved Particle Swarm Optimization ◽  
Novel Approach ◽  
Comparison Results

In order to accurately identify the change of shearer cutting load, a novel approach was proposed through integration of improved particle swarm optimization and wavelet neural network. An improved updating strategy for inertia weight was presented to avoid falling into the local optimum. Moreover, immune mechanism was applied in the proposed approach to enhance the population diversity and improve the quality of solution, and the flowchart of the proposed approach was designed. Furthermore, a simulation example was carried out and comparison results indicated that the proposed approach was feasible, efficient, and outperforming others. Finally, an industrial application example of coal mining face was demonstrated to specify the effect of the proposed system.

A Diversity Guided Particles Swarm Optimization

2012 ◽  
Vol 532-533 ◽  
pp. 1429-1433
Author(s):  
Na Li ◽  
Yuan Xiang Li
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Particle Swarm Optimization Algorithm ◽  
Particle Swarm ◽  
Population Diversity ◽  
Premature Convergence ◽  
Local Optimum ◽  
Convergence Problem ◽  
Swarm Optimization ◽  
Search Capability

A new particle swarm optimization algorithm (a diversity guided particles swarm Optimization), which is guided by population diversity, is proposed. In order to overcome the premature convergence of the algorithm, a metric to measure the swarm diversity is designed, the update of velocity and position of particles is controlled by this criteria, and the four sub-processes are introduced in the process of updating in order to increase the swarm diversity, which enhance to the ability of particle swarm optimization algorithm (PSO) to break away from the local optimum. The experimental results exhibit that the new algorithm not only has great advantage of global search capability, but also can avoid the premature convergence problem effectively.

Experimental Study on Boundary Constraints Handling in Particle Swarm Optimization from a Population Diversity Perspective

2015 ◽  
pp. 99-127 ◽  
Author(s):  
Shi Cheng ◽  
Yuhui Shi ◽  
Quande Qin
Keyword(s):  
Particle Swarm Optimization ◽  
Experimental Studies ◽  
Particle Swarm ◽  
Population Diversity ◽  
Premature Convergence ◽  
Exploration And Exploitation ◽  
Swarm Optimization ◽  
Boundary Constraints ◽  
Constraints Handling ◽  
Search Information

Premature convergence happens in Particle Swarm Optimization (PSO) for solving both multimodal problems and unimodal problems. With an improper boundary constraints handling method, particles may get “stuck in” the boundary. Premature convergence means that an algorithm has lost its ability of exploration. Population diversity is an effective way to monitor an algorithm's ability of exploration and exploitation. Through the population diversity measurement, useful search information can be obtained. PSO with a different topology structure and a different boundary constraints handling strategy will have a different impact on particles' exploration and exploitation ability. In this chapter, the phenomenon of particles getting “stuck in” the boundary in PSO is experimentally studied and reported. The authors observe the position diversity time-changing curves of PSOs with different topologies and different boundary constraints handling techniques, and analyze the impact of these settings on the algorithm's abilities of exploration and exploitation. From these experimental studies, an algorithm's abilities of exploration and exploitation can be observed and the search information obtained; therefore, more effective algorithms can be designed to solve problems.

Sign in / Sign up

Export Citation Format

Share Document