Improved Particle Swarm Optimization for Parameter Identification of Permanent Magnet Synchronous Motor

In the process of identifying parameters for a permanent magnet synchronous motor,the particle swarm optimization method is prone to being stuck in local optima in the later stages of iteration,resulting in low parameter accuracy.This work proposes a fuzzy particle swarm optimization approach based on the transformation function and the filled function.This approach addresses the topic of particle swarmoptimization in parameter identification from two perspectives.Firstly,the algorithm uses a transformation function to change the form of the fitness function without changing the position of the extreme point of the fitness function,making the extreme point of the fitness function more prominent and improving the algorithm’s search ability while reducing the algorithm’s computational burden.Secondly,on the basis of themulti-loop fuzzy control systembased onmultiplemembership functions,it is merged with the filled function to improve the algorithm’s capacity to skip out of the local optimal solution.This approach can be used to identify the parameters of permanent magnet synchronous motors by sampling only the stator current,voltage,and speed data.The simulation results show that the method can effectively identify the electrical parameters of a permanent magnet synchronous motor,and it has superior global convergence performance and robustness.

Optimal choice of parameters for particle swarm optimization

The constriction factor method (CFM) is a new variation of the basic particle swarm optimization (PSO), which has relatively better convergent nature. The effects of the major parameters on CFM were systematically investigated based on some benchmark functions. The constriction factor, velocity constraint, and population size all have significant impact on the per- formance of CFM for PSO. The constriction factor and velocity constraint have optimal values in practical application, and im- proper choice of these factors will lead to bad results. Increasing population size can improve the solution quality, although the computing time will be longer. The characteristics of CFM parameters are described and guidelines for determining parameter values are given in this paper.

Parameters estimation online for Lorenz system by a novel quantum-behaved particle swarm optimization

This paper proposes a novel quantum-behaved particle swarm optimization （NQPSO） for the estimation of chaos＇ unknown parameters by transforming them into nonlinear functions＇ optimization. By means of the techniques in the following three aspects： contracting the searching space self-adaptively; boundaries restriction strategy; substituting the particles＇ convex combination for their centre of mass, this paper achieves a quite effective search mechanism with fine equilibrium between exploitation and exploration. Details of applying the proposed method and other methods into Lorenz systems are given, and experiments done show that NQPSO has better adaptability, dependability and robustness. It is a successful approach in unknown parameter estimation online especially in the cases with white noises.

Adaptive Parallel Particle Swarm Optimization Algorithm Based on Dynamic Exchange of Control Parameters

Updating the velocity in particle swarm optimization (PSO) consists of three terms: the inertia term, the cognitive term and the social term. The balance of these terms determines the balance of the global and local search abilities, and therefore the performance of PSO. In this work, an adaptive parallel PSO algorithm, which is based on the dynamic exchange of control parameters between adjacent swarms, has been developed. The proposed PSO algorithm enables us to adaptively optimize inertia factors, learning factors and swarm activity. By performing simulations of a search for the global minimum of a benchmark multimodal function, we have found that the proposed PSO successfully provides appropriate control parameter values, and thus good global optimization performance.

Identification of strategy parameters for particle swarm optimizer through Taguchi method

Particle swarm optimization （PSO）, like other evolutionary algorithms is a population-based stochastic algorithm inspired from the metaphor of social interaction in birds, insects, wasps, etc. It has been used for finding promising solutions in complex search space through the interaction of particles in a swarm. It is a well recognized fact that the performance of evolutionary algorithms to a great extent depends on the choice of appropriate strategy/operating parameters like population size, crossover rate, mutation rate, crossover operator, etc. Generally, these parameters are selected through hit and trial process, which is very unsystematic and requires rigorous experimentation. This paper proposes a systematic based on Taguchi method reasoning scheme for rapidly identifying the strategy parameters for the PSO algorithm. The Taguchi method is a robust design approach using fractional factorial design to study a large number of parameters with small number of experiments. Computer simulations have been performed on two benchmark functionsiRosenbrock function and Griewank functionito validate the approach.

Autotuning algorithm of particle swarm PID parameter based on D-Tent chaotic model

An improved particle swarm algorithm based on the D-Tent chaotic model is put forward aiming at the standard particle swarm algorithm. The convergence rate of the late of proposed algorithm is improved by revising the inertia weight of global optimal particles and the introduction of D-Tent chaotic sequence. Through the test of typical function and the autotuning test of proportionalintegral-derivative （PID） parameter, finally a simulation is made to the servo control system of a permanent magnet synchronous motor （PMSM） under double-loop control of rotating speed and current by utilizing the chaotic particle swarm algorithm. Studies show that the proposed algorithm can reduce the iterative times and improve the convergence rate under the condition that the global optimal solution can be got.

Power System Aggregate Load Area Modelling by Particle Swarm Optimization

This paper presents a new approach for deriving a power system aggregate load area model (ALAM). In this approach, an equivalent area load model is derived to represent the load characters for a particular area load of a power system network. The Particle Swarm Optimization (PSO) method is employed to identify the unknown parameters of the generalised system, ALAM, based on the system measurement directly using a one-step scheme. Simulation studies are carried out for an IEEE 14-Bus power system and an IEEE 57-Bus power system. Simulation results show that the ALAM can represent the area load characters accurately under different operational conditions and at different power system states.

Efficient and Stable Optimization of Multi‑pass End Milling Using a Cloud Drop‑Enabled Particle Swarm Optimization Algorithm

Optimization of machining parameters is of great importance for multi-pass end milling because machining parameters adversely or positively affect the time and quality of production.This paper develops a second-order fulldiscretization method(2ndFDM)-based 3-D stability prediction model for simultaneous optimization of spindle speed,axial cutting depth and radial cutting depth.The optimal machining parameters in each pass are obtained to achieve the minimum production time comprehensive considering constraints of 3-D stability,machine tool performance,tool life and machining requirements.A cloud drop-enabled particle swarm optimization(CDPSO)algorithm is proposed to solve the developed machining parameter optimization,and 13 benchmark problems are used to evaluate CDPSO algorithm.Numerical results show that CDPSO algorithm has a certain advantage in computational cost as well as comparable search quality and robustness.A demonstrative example is provided.

Development of a particle swarm optimization based support vector regression model for titanium dioxide band gap characterization

Energy band gap of titanium dioxide(TiO_2) semiconductor plays significant roles in many practical applications of the semiconductor and determines its appropriateness in technological and industrial applications such as UV absorption, pigment,photo-catalysis, pollution control systems and solar cells among others. Substitution of impurities into crystal lattice structure is the most commonly used method of tuning the band gap of TiO_2 for specific application and eventually leads to lattice distortion. This work utilizes the distortion in the lattice structure to estimate the band gap of doped TiO_2, for the first time, through hybridization of a particle swarm optimization algorithm(PSO) with a support vector regression(SVR) algorithm for developing a PSO-SVR model. The precision and accuracy of the developed PSO-SVR model was further justified by applying the model for estimating the effect of cobalt-sulfur co-doping, nickel-iodine co-doping, tungsten and indium doping on the band gap of TiO_2 and excellent agreement with the experimentally reported values was achieved. Practical implementation of the proposed PSO-SVR model would further widen the applications of the semiconductor and reduce the experimental stress involved in band gap determination of TiO_2.

Application of Particle Swarm Optimization to Fault Condition Recognition Based on Kernel Principal Component Analysis

Panicle swarm optimization （PSO） is an optimization algorithm based on the swarm intelligent principle. In this paper the modified PSO is applied to a kernel principal component analysis （ KPCA ） for an optimal kernel function parameter. We first comprehensively considered within-class scatter and between-class scatter of the sample features. Then, the fitness function of an optimized kernel function parameter is constructed, and the particle swarm optimization algorithm with adaptive acceleration （CPSO） is applied to optimizing it. It is used for gearbox condi- tion recognition, and the result is compared with the recognized results based on principal component analysis （PCA）. The results show that KPCA optimized by CPSO can effectively recognize fault conditions of the gearbox by reducing bind set-up of the kernel function parameter, and its results of fault recognition outperform those of PCA. We draw the conclusion that KPCA based on CPSO has an advantage in nonlinear feature extraction of mechanical failure, and is helpful for fault condition recognition of complicated machines.

Rapid Parameter-Optimizing Strategy for Plug-and-Play Devices in DC Distribution Systems under the Background of Digital Transformation

By integrating advanced digital technologies such as cloud computing and the Internet of Things in sensor measurement,information communication,and other fields,the digital DC distribution network can efficiently and reliably access DistributedGenerator(DG)and Energy Storage Systems(ESS),exhibiting significant advantages in terms of controllability and meeting requirements of Plug-and-Play(PnP)operations.However,during device plug-in and-out processes,improper systemparametersmay lead to small-signal stability issues.Therefore,before executing PnP operations,conducting stability analysis and adjusting parameters swiftly is crucial.This study introduces a four-stage strategy for parameter optimization to enhance systemstability efficiently.In the first stage,state-of-the-art technologies in measurement and communication are utilized to correct model parameters.Then,a novel indicator is adopted to identify the key parameters that influence stability in the second stage.Moreover,in the third stage,a local-parameter-tuning strategy,which leverages rapid parameter boundary calculations as a more efficient alternative to plotting root loci,is used to tune the selected parameters.Considering that the local-parameter-tuning strategy may fail due to some operating parameters being limited in adjustment,a multiparameter-tuning strategy based on the particle swarm optimization(PSO)is proposed to comprehensively adjust the dominant parameters to improve the stability margin of the system.Lastly,system stability is reassessed in the fourth stage.The proposed parameter-optimization strategy’s effectiveness has been validated through eigenvalue analysis and nonlinear time-domain simulations.

Parameter Optimization of Interval Type-2 Fuzzy Neural Networks Based on PSO and BBBC Methods

Interval type-2 fuzzy neural networks(IT2FNNs)can be seen as the hybridization of interval type-2 fuzzy systems(IT2FSs) and neural networks(NNs). Thus, they naturally inherit the merits of both IT2 FSs and NNs. Although IT2 FNNs have more advantages in processing uncertain, incomplete, or imprecise information compared to their type-1 counterparts, a large number of parameters need to be tuned in the IT2 FNNs,which increases the difficulties of their design. In this paper,big bang-big crunch(BBBC) optimization and particle swarm optimization(PSO) are applied in the parameter optimization for Takagi-Sugeno-Kang(TSK) type IT2 FNNs. The employment of the BBBC and PSO strategies can eliminate the need of backpropagation computation. The computing problem is converted to a simple feed-forward IT2 FNNs learning. The adoption of the BBBC or the PSO will not only simplify the design of the IT2 FNNs, but will also increase identification accuracy when compared with present methods. The proposed optimization based strategies are tested with three types of interval type-2 fuzzy membership functions(IT2FMFs) and deployed on three typical identification models. Simulation results certify the effectiveness of the proposed parameter optimization methods for the IT2 FNNs.

Stochastic focusing search:a novel optimization algorithm for real-parameter optimization

A novel optimization algorithm called stochastic focusing search （SFS） for the real-parameter optimization is proposed. The new algorithm is a swarm intelligence algorithm, which is based on simulating the act of human randomized searching, and the human searching behaviors. The algorithm＇s performance is studied using a challenging set of typically complex functions with comparison of differential evolution （DE） and three modified particle swarm optimization （PSO） algorithms, and the simulation results show that SFS is competitive to solve most parts of the benchmark problems and will become a promising candidate of search algorithms especially when the existing algorithms have some difficulties in solving certain problems.

Structural Parameter Optimization of Multilayer Conductors in HTS Cable

In this paper, the design optimization of the structural parameters of multilayer conductors in high temperature superconducting （HTS） cable is reviewed. Various optimization methods, such as the particle swarm optimization （PSO）, the genetic algorithm （GA）, and a robust optimization method based on design for six sigma （DFSS）, have been applied to realize uniform current distribution among the multilayer HTS conductors. The continuous and discrete variables, such as the winding angle, radius, and winding direction of each layer, are chosen as the design parameters. Under the constraints of the mechanical properties and critical current, PSO is proven to be a more powerful tool than GA for structural parameter optimization, and DFSS can not only achieve a uniform current distribution, but also improve significantly the reliability and robustness of the HTS cable quality.

Bio-inspired optimization algorithms for optical parameter extraction of dielectric materials: A comparative study

Particle swarm optimization(PSO) and invasive weed optimization(IWO) algorithms are used for extracting the modeling parameters of materials useful for optics and photonics research community. These two bio-inspired algorithms are used here for the first time in this particular field to the best of our knowledge. The algorithms are used for modeling graphene oxide and the performances of the two are compared. Two objective functions are used for different boundary values. Root mean square(RMS) deviation is determined and compared.

Optimization of CNC Turning Machining Parameters Based on Bp-DWMOPSO Algorithm

Cutting parameters have a significant impact on the machining effect.In order to reduce the machining time and improve the machining quality,this paper proposes an optimization algorithm based on Bp neural networkImproved Multi-Objective Particle Swarm(Bp-DWMOPSO).Firstly,this paper analyzes the existing problems in the traditional multi-objective particle swarm algorithm.Secondly,the Bp neural network model and the dynamic weight multi-objective particle swarm algorithm model are established.Finally,the Bp-DWMOPSO algorithm is designed based on the established models.In order to verify the effectiveness of the algorithm,this paper obtains the required data through equal probability orthogonal experiments on a typical Computer Numerical Control(CNC)turning machining case and uses the Bp-DWMOPSO algorithm for optimization.The experimental results show that the Cutting speed is 69.4 mm/min,the Feed speed is 0.05 mm/r,and the Depth of cut is 0.5 mm.The results show that the Bp-DWMOPSO algorithm can find the cutting parameters with a higher material removal rate and lower spindle load while ensuring the machining quality.This method provides a new idea for the optimization of turning machining parameters.

Application of MPSO technique to find optimal location and parameter setting of TCSC

A new mothod was presented to find the optimal location and parameter setting of Thyristor Controlled Series Compensator (TCSC) to maxmize the transfer capability.Firstly the sensitivity of the transfer capability with respect was described to the line's reactance was described to find the more sensitive lines for installing TCSC,however,the line which has the most sesitivity value is always not the best line for installing TCSC.For solving this problem,the more sensitive m lines were selected as the alternative line group of installing TCSC,and then modified particle swarm optimization (MPSO) was used to find out the optimal location and the optimal parameter settings of TCSC.Particle swarm optimization (PSO) algorithm can results premature convergence.For solving this problem,population entropy and cellular automata were introduced to it.Simulation results of IEEE 30-bus system proved the effectiveness of the method and its application values.

Optimal Parameter Estimation of Transmission Line Using Chaotic Initialized Time-Varying PSO Algorithm

Transmission line is a vital part of the power system that connects two major points,the generation,and the distribution.For an efficient design,stable control,and steady operation of the power system,adequate knowledge of the transmission line parameters resistance,inductance,capacitance,and conductance is of great importance.These parameters are essential for transmission network expansion planning in which a new parallel line is needed to be installed due to increased load demand or the overhead line is replaced with an underground cable.This paper presents a method to optimally estimate the parameters using the input-output quantities i.e.,voltages,currents,and power factor of the transmission line.The equivalentπ-network model is used and the terminal data i.e.,sending-end and receiving-end quantities are assumed as available measured data.The parameter estimation problem is converted to an optimization problem by formulating an error-minimizing objective function.An improved particle swarm optimization(PSO)in terms of time-varying control parameters and chaos-based initialization is used to optimally estimate the line parameters.Two cases are considered for parameter estimation,the first case is when the line conductance is neglected and in the second case,the conductance is considered into account.The results obtained by the improved algorithm are compared with the standard version of the algorithm,firefly algorithm and artificial bee colony algorithm for 30 number of trials.It is concluded that the improved algorithm is tremendously sufficient in estimating the line parameters in both cases validated by low error values and statistical analysis,comparatively.

Longitudinal parameter identification of a small unmanned aerial vehicle based on modified particle swarm optimization

Abstract This paper describes a longitudinal parameter identification procedure for a small unmanned aerial vehicle （UAV） through modified particle swam optimization （PSO）. The proce- dure is demonstrated using a small UAV equipped with only an micro-electro-mechanical systems （MEMS） inertial mea,mring element and a global positioning system （GPS） receiver to provide test information. A small UAV longitudinal parameter mathematical model is derived and the modified method is proposed based on PSO with selective particle regeneration （SRPSO）. Once modified PSO is applied to the mathematical model, the simulation results show that the mathematical model is correct, and aerodynamic parameters and coefficients of the propeller can be identified accurately. Results are compared with those of PSO and SRPSO and the comparison shows that the proposed method is more robust and faster than the other methods for the longitudinal parameter identification of the small UAV. Some parameter identification results are affected slightly by noise, but the identification results are very good overall. Eventually, experimental validation is employed to test the proposed method, which demonstrates the usefulness of this method.

Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Parameter Calibration in Hydrological Simulation

Parameter calibration is an important part of hydrological simulation and affects the final simulation results.In this paper,we introduce heuristic optimization algorithms,genetic algorithm(GA)to cope with the complexity of the parameter calibration problem,and use particle swarm optimization algorithm(PsO)as a comparison.For large-scale hydrological simulations,we use a multilevel parallel parameter calibration framework to make full use of processor resources,and accelerate the process of solving high-dimensional parameter calibration.Further,we test and apply the experiments on domestic supercomputers.The results of parameter calibration with GA and PSO can basically reach the ideal value of 0.65 and above,with PSO achieving a speedup of 58.52 on TianHe-2 supercomputer.The experimental results indicate that using a parallel implementation on multicore CPUs makes high-dimensional parameter calibration in large-scale hydrological simulation possible.Moreover,our comparison of the two algorithms shows that the GA obtains better calibration results,and the PSO has a more pronounced acceleration effect.