scholarly journals On-Line Application of SHEM by Particle Swarm Optimization to Grid-Connected, Three-Phase, Two-Level VSCs with Variable DC Link Voltage

Electronics ◽  
2018 ◽  
Vol 7 (8) ◽  
pp. 151 ◽  
Author(s):  
Umut Güvengir ◽  
Işık Çadırcı ◽  
Muammer Ermiş
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Modulation Index ◽  
Small Scale ◽  
Half Cycle ◽  
Swarm Optimization ◽  
Fitness Value ◽  
Three Phase ◽  
On Line

This paper is devoted to an otablen-line application of the selective harmonic elimination method (SHEM) to three-phase, two-level, grid-connected voltage source converters (VSCs) by particle swarm optimization (PSO). In such systems, active power can be controlled by the phase shift angle, and reactive power by the modulation index, against variations in the direct current (DC) link voltage. Some selected, low-odd-order harmonic components in the line-to-neutral output voltage waveforms are eliminated by calculating the SHEM angle set continuously through the developed PSO algorithm on field-programmable gate array (FPGA)-based computing hardware as the modulation index is varied. The use of powerful computing hardware permits the elimination of all harmonics up to 50th. The cost function of the developed PSO algorithm is formulated by using an optimum number of particles to obtain a global optimum solution with a small fitness value in each half-cycle of the grid voltage and then updating the SHEM angle set at the beginning of the next full-cycle. Since the convergence of the solution to a global minimum point depends upon the use of correct initial values especially for a large number of SHEM angles, a generalized initialization procedure is also described in the paper. Theoretical results are verified initially using hardware co-simulation. They are also tested using a small scale photovoltaic (PV) supply prototype developed specifically for this purpose. It is demonstrated that the 5th, 7th, 11th, 13th, 17th, and 19th sidekick harmonics are eliminated by on-line calculation of seven SHEM angles through the developed PSO algorithm on a moderately powerful XEM6010-LX150, USB-2.0-integrated FPGA module. All control and protection actions and the calculation of SHEM angles are achieved by a single FPGA chip and its peripherals within the FPGA board.

An Improved Particle Swarm Optimization Algorithm with Adaptive Inertia Weights

2019 ◽  
Vol 18 (03) ◽  
pp. 833-866 ◽  
Author(s):  
Mi Li ◽  
Huan Chen ◽  
Xiaodong Wang ◽  
Ning Zhong ◽  
Shengfu Lu
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Local Optimum ◽  
Random Mutation ◽  
Swarm Optimization ◽  
Inertia Weight ◽  
Fitness Value ◽  
The One ◽  
Individual Particles

The particle swarm optimization (PSO) algorithm is simple to implement and converges quickly, but it easily falls into a local optimum; on the one hand, it lacks the ability to balance global exploration and local exploitation of the population, and on the other hand, the population lacks diversity. To solve these problems, this paper proposes an improved adaptive inertia weight particle swarm optimization (AIWPSO) algorithm. The AIWPSO algorithm includes two strategies: (1) An inertia weight adjustment method based on the optimal fitness value of individual particles is proposed, so that different particles have different inertia weights. This method increases the diversity of inertia weights and is conducive to balancing the capabilities of global exploration and local exploitation. (2) A mutation threshold is used to determine which particles need to be mutated. This method compensates for the inaccuracy of random mutation, effectively increasing the diversity of the population. To evaluate the performance of the proposed AIWPSO algorithm, benchmark functions are used for testing. The results show that AIWPSO achieves satisfactory results compared with those of other PSO algorithms. This outcome shows that the AIWPSO algorithm is conducive to balancing the abilities of the global exploration and local exploitation of the population, while increasing the diversity of the population, thereby significantly improving the optimization ability of the PSO algorithm.

Two-Subpopulation Particle Swarm Optimization Based on Pheromone Diffusion

2014 ◽  
Vol 667 ◽  
pp. 300-308
Author(s):  
Guang Pu Zeng ◽  
Hui Lian Fan
Keyword(s):  
Particle Swarm Optimization ◽  
Function Analysis ◽  
Numerical Test ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Premature Convergence ◽  
Test Problems ◽  
Swarm Optimization ◽  
Local Optima ◽  
Fitness Value

The particle swarm optimization (PSO) algorithm is a new population based search strat-egy, which has exhibited good performance on well-known numerical test problems. However, conventional algorithm of particle swarm optimization (PSO) is often trapped in local optima in global optimization of multimodal high-dimensional function. Analysis of the main causes of the premature convergence, proposes an improved two-subpopulation PSO algorithm, based on the mechanism of pheromone diffusion and diversity feedback. The population is divided into main subpopulation particle swarm and assistant subpopulation particle swarm, whose search direction is inversed completely. A pheromone diffusion function, which can control the degree of convergence of particles move to the best position, is designed by both taking into account these particles distribution and their fitness value. Adjusting inertial weight and numbers of sub-populations adaptively with diversity feedback greatly contribute to breaking away from local optima. Experiments on optimization of high-dimension benchmark functions show that, comparing with some other PSO variants, the improved algorithm can find better optima with converges faster, and prevent more effectively the premature convergence.

Learning-Based Multi-Directional Adaptive PSO

2013 ◽  
Vol 321-324 ◽  
pp. 2183-2186
Author(s):  
Zheng Bo Li
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Optimal Solution ◽  
Pso Algorithm ◽  
Search Space ◽  
Global Optimum ◽  
Small Scale ◽  
Swarm Optimization ◽  
Local Optima ◽  
Adaptive Pso

Particle Swarm Optimization (PSO) is a swarm intelligence algorithm to achieve through competition and collaboration between the particles in the complex search space to find the global optimum. Basic PSO algorithm evolutionary late convergence speed is slow and easy to fall into the shortcomings of local minima, this paper presents a multi-learning particle swarm optimization algorithm, the algorithm particle at the same time to follow their own to find the optimal solution, random optimal solution and the optimal solution for the whole group of other particles with dimensions velocity update discriminate area boundary position optimization updates and small-scale perturbations of the global best position, in order to enhance the algorithm escape from local optima capacity. The test results show that several typical functions: improved particle swarm algorithms significantly improve the global search ability, and can effectively avoid the premature convergence problem. Algorithm so that the relative robustness of the search space position has been significantly improved global optimal solution in high-dimensional optimization problem, suitable for solving similar problems, the calculation results can meet the requirements of practical engineering.

scholarly journals Virtual Angle Boundary-Aware Particle Swarm Optimization to Maximize the Coverage of Directional Sensor Networks

Sensors ◽  
2021 ◽  
Vol 21 (8) ◽  
pp. 2868
Author(s):  
Gong Cheng ◽  
Huangfu Wei
Keyword(s):  
Particle Swarm Optimization ◽  
Sensor Networks ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
The Internet ◽  
Directional Sensor Networks ◽  
Swarm Optimization ◽  
Coverage Optimization ◽  
Boundary Constraint ◽  
Directional Sensor

With the transition of the mobile communication networks, the network goal of the Internet of everything further promotes the development of the Internet of Things (IoT) and Wireless Sensor Networks (WSNs). Since the directional sensor has the performance advantage of long-term regional monitoring, how to realize coverage optimization of Directional Sensor Networks (DSNs) becomes more important. The coverage optimization of DSNs is usually solved for one of the variables such as sensor azimuth, sensing radius, and time schedule. To reduce the computational complexity, we propose an optimization coverage scheme with a boundary constraint of eliminating redundancy for DSNs. Combined with Particle Swarm Optimization (PSO) algorithm, a Virtual Angle Boundary-aware Particle Swarm Optimization (VAB-PSO) is designed to reduce the computational burden of optimization problems effectively. The VAB-PSO algorithm generates the boundary constraint position between the sensors according to the relationship among the angles of different sensors, thus obtaining the boundary of particle search and restricting the search space of the algorithm. Meanwhile, different particles search in complementary space to improve the overall efficiency. Experimental results show that the proposed algorithm with a boundary constraint can effectively improve the coverage and convergence speed of the algorithm.

Adaptive particle swarm optimization algorithm based long short-term memory networks for sentiment analysis

2021 ◽  
pp. 1-17
Author(s):  
J. Shobana ◽  
M. Murali
Keyword(s):  
Particle Swarm Optimization ◽  
Sentiment Analysis ◽  
Language Processing ◽  
Short Term Memory ◽  
Contextual Information ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Adaptive Particle Swarm Optimization ◽  
Proposed Model

Text Sentiment analysis is the process of predicting whether a segment of text has opinionated or objective content and analyzing the polarity of the text’s sentiment. Understanding the needs and behavior of the target customer plays a vital role in the success of the business so the sentiment analysis process would help the marketer to improve the quality of the product as well as a shopper to buy the correct product. Due to its automatic learning capability, deep learning is the current research interest in Natural language processing. Skip-gram architecture is used in the proposed model for better extraction of the semantic relationships as well as contextual information of words. However, the main contribution of this work is Adaptive Particle Swarm Optimization (APSO) algorithm based LSTM for sentiment analysis. LSTM is used in the proposed model for understanding complex patterns in textual data. To improve the performance of the LSTM, weight parameters are enhanced by presenting the Adaptive PSO algorithm. Opposition based learning (OBL) method combined with PSO algorithm becomes the Adaptive Particle Swarm Optimization (APSO) classifier which assists LSTM in selecting optimal weight for the environment in less number of iterations. So APSO - LSTM ‘s ability in adjusting the attributes such as optimal weights and learning rates combined with the good hyper parameter choices leads to improved accuracy and reduces losses. Extensive experiments were conducted on four datasets proved that our proposed APSO-LSTM model secured higher accuracy over the classical methods such as traditional LSTM, ANN, and SVM. According to simulation results, the proposed model is outperforming other existing models.

scholarly journals Particle swarm optimization algorithm for the optimization of rescue task allocation with uncertain time constraints

2021 ◽  
Author(s):  
Na Geng ◽  
Zhiting Chen ◽  
Quang A. Nguyen ◽  
Dunwei Gong
Keyword(s):  
Particle Swarm Optimization ◽  
Task Allocation ◽  
Optimal Algorithm ◽  
Particle Swarm ◽  
Evolutionary Process ◽  
Pso Algorithm ◽  
Swarm Optimization ◽  
Fitness Evaluation ◽  
Modified Particle Swarm Optimization ◽  
Uncertain Time

AbstractThis paper focuses on the problem of robot rescue task allocation, in which multiple robots and a global optimal algorithm are employed to plan the rescue task allocation. Accordingly, a modified particle swarm optimization (PSO) algorithm, referred to as task allocation PSO (TAPSO), is proposed. Candidate assignment solutions are represented as particles and evolved using an evolutionary process. The proposed TAPSO method is characterized by a flexible assignment decoding scheme to avoid the generation of unfeasible assignments. The maximum number of successful tasks (survivors) is considered as the fitness evaluation criterion under a scenario where the survivors’ survival time is uncertain. To improve the solution, a global best solution update strategy, which updates the global best solution depends on different phases so as to balance the exploration and exploitation, is proposed. TAPSO is tested on different scenarios and compared with other counterpart algorithms to verify its efficiency.

scholarly journals Multiple RFI Sources Location Method Combining Two-Dimensional ESPRIT DOA Estimation and Particle Swarm Optimization for Spaceborne SAR

2021 ◽  
Vol 13 (6) ◽  
pp. 1207
Author(s):  
Junfei Yu ◽  
Jingwen Li ◽  
Bing Sun ◽  
Yuming Jiang ◽  
Liying Xu
Keyword(s):  
Particle Swarm Optimization ◽  
Particle Swarm ◽  
Geographic Location ◽  
Doa Estimation ◽  
Pso Algorithm ◽  
Two Dimensional ◽  
Swarm Optimization ◽  
Location Method ◽  
Esprit Algorithm ◽  
To Receive

Synthetic aperture radar (SAR) systems are susceptible to radio frequency interference (RFI). The existence of RFI will cause serious degradation of SAR image quality and a huge risk of target misjudgment, which makes the research on RFI suppression methods receive widespread attention. Since the location of the RFI source is one of the most vital information for achieving RFI spatial filtering, this paper presents a novel location method of multiple independent RFI sources based on direction-of-arrival (DOA) estimation and the non-convex optimization algorithm. It deploys an L-shaped multi-channel array on the SAR system to receive echo signals, and utilizes the two-dimensional estimating signal parameter via rotational invariance techniques (2D-ESPRIT) algorithm to estimate the positional relationship between the RFI source and the SAR system, ultimately combines the DOA estimation results of multiple azimuth time to calculate the geographic location of RFI sources through the particle swarm optimization (PSO) algorithm. Results on simulation experiments prove the effectiveness of the proposed method.

scholarly journals Multibyte Electromagnetic Analysis Based on Particle Swarm Optimization Algorithm

2021 ◽  
Vol 11 (2) ◽  
pp. 839
Author(s):  
Shaofei Sun ◽  
Hongxin Zhang ◽  
Xiaotong Cui ◽  
Liang Dong ◽  
Muhammad Saad Khan ◽  
...  
Keyword(s):  
Particle Swarm Optimization ◽  
Optimization Algorithm ◽  
Communication Systems ◽  
Optimization Problems ◽  
Classical Method ◽  
Particle Swarm ◽  
Pso Algorithm ◽  
Electromagnetic Analysis ◽  
Swarm Optimization ◽  
Test Board

This paper focuses on electromagnetic information security in communication systems. Classical correlation electromagnetic analysis (CEMA) is known as a powerful way to recover the cryptographic algorithm’s key. In the classical method, only one byte of the key is used while the other bytes are considered as noise, which not only reduces the efficiency but also is a waste of information. In order to take full advantage of useful information, multiple bytes of the key are used. We transform the key into a multidimensional form, and each byte of the key is considered as a dimension. The problem of the right key searching is transformed into the problem of optimizing correlation coefficients of key candidates. The particle swarm optimization (PSO) algorithm is particularly more suited to solve the optimization problems with high dimension and complex structure. In this paper, we applied the PSO algorithm into CEMA to solve multidimensional problems, and we also add a mutation operator to the optimization algorithm to improve the result. Here, we have proposed a multibyte correlation electromagnetic analysis based on particle swarm optimization. We verified our method on a universal test board that is designed for research and development on hardware security. We implemented the Advanced Encryption Standard (AES) cryptographic algorithm on the test board. Experimental results have shown that our method outperforms the classical method; it achieves approximately 13.72% improvement for the corresponding case.

Sign in / Sign up

Export Citation Format

Share Document