The Study of Harmonic Energy Measurement Based on Atomic Decomposition Algorithm

2015 ◽  
Vol 738-739 ◽  
pp. 911-914
Author(s):  
Zheng Wei Qu ◽  
Yan Li ◽  
Wan Ru Hao

This paper proposes a new method of harmonic energy measurement based on atomic decomposition algorithm. Firstly, the matching pursuits (MP) algorithm is introduced and harmonic atom dictionary is designed according to the characteristics of signals to be analyzed to improve the effect of signal decomposition. Then, the MP algorithm is optimized by particle swarm optimization (PSO) to reduce the calculation amount. The simulation results of active harmonic energy in steady and unsteady state demonstrate feasibility and accuracy of the presented method.

2014 ◽  
Vol 687-691 ◽  
pp. 5161-5164
Author(s):  
Lian Zhou Gao

As the development of world economy, how to realize the reasonable vehicle logistics routing path problem with time window constrain is the key issue in promoting the prosperity and development of modern logistics industry. Through the research of vehicle logistics routing path 's demand, particle swarm optimization with a novel particle presentation is designed to solve the problem which is improved, effective and adept to the normal vehicle logistics routing. The simulation results of example indicate that the algorithm has more search speed and stronger optimization ability.


2013 ◽  
Vol 376 ◽  
pp. 349-353
Author(s):  
Yi Cheng Huang ◽  
Shu Ting Li ◽  
Kuan Heng Peng

This paper utilized the Improved Particle Swarm Optimization (IPSO) technique for adjusting the gains of PID and the bandwidth of zero-phase Butterworth Filter of an Iterative Learning Controller (ILC) for precision motion. Simulation results show that IPSO-ILC-PID controller without adaptive bandwidth filter tuning have the chance of producing high frequencies in the error signals when the filter bandwidth is fixed for every repetition. However the learnable and unlearnable error signals should be separated for bettering control process. Thus the adaptive bandwidth of a zero phase filter in ILC-PID controller with IPSO tuning is applied to one single motion axis of a CNC table machine. Simulation results show that the developed controller can cancel the errors efficiently as repetition goes. The frequency response of the error signals is analyzed by the empirical mode decomposition (EMD) and the Hilbert-Huang Transform (HHT) method. Errors are reduced and validated by ILC with adaptive bandwidth filtering design.


2014 ◽  
Vol 903 ◽  
pp. 285-290 ◽  
Author(s):  
Hazriq Izzuan Jaafar ◽  
Zaharuddin Mohamed ◽  
Amar Faiz Zainal Abidin ◽  
Zamani Md Sani ◽  
Jasrul Jamani Jamian ◽  
...  

This paper presents development of an optimal PID and PD controllers for controlling the nonlinear Gantry Crane System (GCS). A new method of Binary Particle Swarm Optimization (BPSO) algorithm that uses Priority-based Fitness Scheme is developed to obtain optimal PID and PD parameters. The optimal parameters are tested on the control structure to examine system responses including trolley displacement and payload oscillation. The dynamic model of GCS is derived using Lagrange equation. Simulation is conducted within Matlab environment to verify the performance of the system in terms of settling time, steady state error and overshoot. The result not only confirmed the successes of using new method for GCS, but also shows the new method performs more efficiently compared to the continuous PSO. This proposed technique demonstrates that implementation of Priority-based Fitness Scheme in BPSO is effective and able to move the trolley as fast as possible to the desired position with low payload oscillation.


Author(s):  
Hsu-Tan Tan ◽  
Bor-An Chen ◽  
Yung-Fa Huang

In this study, the resource blocks (RB) are allocated to user equipment (UE) according to the evolutional algorithms for long term evolution (LTE) systems. Particle Swarm Optimization (PSO) algorithm is one of the evolutionary algorithms, based on the imitation of a flock of birds foraging behavior through learning and grouping the best experience. In previous work, the Simple Particle Swarm Optimization (SPSO) algorithm was proposed for RB allocation to enhance the throughput of Device-to-Device (D2D) communications and improve the system capacity performance. In simulation results, with less population size of M = 10, the SPSO can perform quickly convergence to sub-optimal solution in the 100th generation and obtained sub-optimum performance with more 2 UEs than the Rand method. Genetic algorithm (GA) is one of the evolutionary algorithms, based on Darwinian models of natural selection and evolution. Therefore, we further proposed a Refined PSO (RPSO) and a novel GA to enhance the throughput of UEs and to improve the system capacity performance. Simulation results show that the proposed GA with 100 populations, in 200 generations can converge to suboptimal solutions. Therefore, with comparing with the SPSO algorithm the proposed GA and RPSO can improve system capacity performance with 1.8 and 0.4 UEs, respectively.


Author(s):  
Wei-Der Chang ◽  

Particle swarm optimization (PSO) is the most important and popular algorithm to solving the engineering optimization problem due to its simple updating formulas and excellent searching capacity. This algorithm is one of evolutionary computations and is also a population-based algorithm. Traditionally, to demonstrate the convergence analysis of the PSO algorithm or its related variations, simulation results in a numerical presentation are often given. This way may be unclear or unsuitable for some particular cases. Hence, this paper will adopt the illustration styles instead of numeric simulation results to more clearly clarify the convergence behavior of the algorithm. In addition, it is well known that three parameters used in the algorithm, i.e., the inertia weight w, position constants c1 and c2, sufficiently dominate the whole searching performance. The influence of these parameter settings on the algorithm convergence will be considered and examined via a simple two-dimensional function optimization problem. All simulation results are displayed using a series of illustrations with respect to various iteration numbers. Finally, some simple rules on how to suitably assign these parameters are also suggested


Author(s):  
Wen Fung Leong ◽  
Gary G. Yen

In this article, the authors propose a particle swarm optimization (PSO) for constrained optimization. The proposed PSO adopts a multiobjective approach to constraint handling. Procedures to update the feasible and infeasible personal best are designed to encourage finding feasible regions and convergence toward the Pareto front. In addition, the infeasible nondominated solutions are stored in the global best archive to exploit the hidden information for guiding the particles toward feasible regions. Furthermore, the number of feasible personal best in the personal best memory and the scalar constraint violations of personal best and global best are used to adapt the acceleration constants in the PSO flight equations. The purpose is to find more feasible particles and search for better solutions during the process. The mutation procedure is applied to encourage global and fine-tune local searches. The simulation results indicate that the proposed constrained PSO is highly competitive, achieving promising performance.


Sensors ◽  
2019 ◽  
Vol 19 (11) ◽  
pp. 2453 ◽  
Author(s):  
Guangyong Zheng ◽  
Siqi Na ◽  
Tianyao Huang ◽  
Lulu Wang

Distributed multiple input multiple output (MIMO) radar has attracted much attention for its improved detection and estimation performance as well as enhanced electronic counter-counter measures (ECCM) ability. To protect the target from being detected and tracked by such radar, we consider a barrage jamming strategy towards a distributed MIMO. We first derive the Cramer–Rao bound (CRB) of target parameters estimation using a distributed MIMO under barrage jamming environments. We then set maximizing the CRB as the criterion for jamming resource allocation, aiming at degrading the accuracy of target parameters estimation. Due to the non-convexity of the CRB maximizing problem, particle swarm optimization is used to solve the problem. Simulation results demonstrate the advantages of the proposed strategy over traditional jamming methods.


2012 ◽  
Vol 157-158 ◽  
pp. 88-93 ◽  
Author(s):  
Guang Hui Chang ◽  
Jie Chang Wu ◽  
Chao Jie Zhang

In this paper, an intelligent controller of PM DC Motor drive is designed using particle swarm optimization (PSO) method for tuning the optimal proportional-integral-derivative (PID) controller parameters. The proposed approach has superior feature, including easy implementation, stable convergence characteristics and very good computational performances efficiency.To show the validity of the PID-PSO controller, a DC motor position control case is considered and some simulation results are shown. The DC Motor Scheduling PID-PSO controller is modeled in MATLAB environment.. It can be easily seen from the simulation results that the proposed method will have better performance than those presented in other studies.


Sign in / Sign up

Export Citation Format

Share Document