• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.43 no.4
• /
• pp.326-333
• /
• 2015

A turbo fan engine performance analysis program combined with a particle swarm optimization(PSO) has been developed to optimize the major design parameters of the combat aircraft gas turbine engine. The optimized parameters includes bypass ratio, fan pressure ratio, high pressure compression ratio and burner exit temperature. The objective parameters have been determined using a multi-objective function consisting of the net thrust and specific fuel consumption along a weight function. The basic model for the combat aircraft gas turbine engine has been selected as the F404 turbofan engine which is widely used in the combat aircraft, F-18 and Korean high level training aircraft, T-50. The optimal conditions of four parameters have been obtained for various design conditions.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.4
• /
• pp.35-41
• /
• 2002

To solve the large scale optimization problem approximately, various approaches have been introduced. They are mainly based on recent research advancement of simulations for evolutions, flocking, annealing, and interactions among organisms on artificial environments. The typical ones are simulated annealing(SA), artificial neural network(ANN), genetic algorithms(GA), tabu search(TS), etc. Recently the particle swarm optimization(PSO) has been introduced. The PSO simulates the process of birds flocking or fish schooling for food, as with the information of each agent Is share by other agents. The PSO technique has been applied to various optimization problems of which variables are continuous. However, there are seldom trials for visualization of searching process. This paper proposes a new visualization tool for searching process particle swarm optimization(PSO) algorithm. The proposed tool is effective for understanding the searching process of PSO method and educational for students.

• ETRI Journal
• /
• v.42 no.1
• /
• pp.54-66
• /
• 2020

Nowadays, the broad availability of cameras and embedded systems makes the application of computer vision very promising as a supporting technology for intelligent transportation systems, particularly in the field of vehicle tracking. Although there are several existing trackers, the limitation of using low-cost cameras, besides the relatively low processing power in embedded systems, makes most of these trackers useless. For the tracker to work under those conditions, the video frame rate must be reduced to decrease the burden on computation. However, doing this will make the vehicle seem to move faster on the observer's side. This phenomenon is called the fast motion challenge. This paper proposes a tracker called dynamic swarm particle (DSP), which solves the challenge. The term particle refers to the particle filter, while the term swarm refers to particle swarm optimization (PSO). The fundamental concept of our method is to exploit the continuity of vehicle dynamic motions by creating dynamic models based on PSO. Based on the experiments, DSP achieves a precision of 0.896 and success rate of 0.755. These results are better than those obtained by several other benchmark trackers.

• The Journal of the Korea Contents Association
• /
• v.14 no.11
• /
• pp.549-557
• /
• 2014

Recently, analysis of bargaining game using evolutionary computation is essential issues in field of game theory. In this paper, we observe a bargaining game using co-evolution between two heterogenous artificial agents. In oder to model two artificial agents, we use a particle swarm optimization and a differential evolution. We investigate algorithm parameters for the best performance and observe that which strategy is better in the bargaining game under the co-evolution between two heterogenous artificial agents. Experimental simulation results show that particle swarm optimization outperforms differential evolution in the bargaining game.

• Asian Pacific Journal of Cancer Prevention
• /
• v.15 no.18
• /
• pp.7775-7780
• /
• 2014

This paper addresses cancer prediction based on radial basis function neural network optimized by particle swarm optimization. Today, cancer hazard to people is increasing, and it is often difficult to cure cancer. The occurrence of cancer can be predicted by the method of the computer so that people can take timely and effective measures to prevent the occurrence of cancer. In this paper, the occurrence of cancer is predicted by the means of Radial Basis Function Neural Network Optimized by Particle Swarm Optimization. The neural network parameters to be optimized include the weight vector between network hidden layer and output layer, and the threshold of output layer neurons. The experimental data were obtained from the Wisconsin breast cancer database. A total of 12 experiments were done by setting 12 different sets of experimental result reliability. The findings show that the method can improve the accuracy, reliability and stability of cancer prediction greatly and effectively.

• Journal of the Optical Society of Korea
• /
• v.18 no.4
• /
• pp.341-344
• /
• 2014

This study proposes a modified sub-aperture stitching algorithm, which uses an image sharpening algorithm and particle swarm optimization to improve the stitching accuracy. In sub-aperture stitching interferometers with high positional accuracy, the high-frequency components of measurements are more important than the low-frequency components when compensating for position errors using a sub-aperture stitching algorithm. Thus we use image sharpening algorithms to strengthen the high-frequency components of measurements. When using image sharpening algorithms, sub-aperture stitching algorithms based on the least-squares method easily become trapped at locally optimal solutions. However, particle swarm optimization is less likely to become trapped at a locally optimal solution, thus we utilized this method to develop a more robust algorithm. The results of simulations showed that our algorithm compensated for position errors more effectively than the existing algorithm. An experimental comparison with full aperture-testing results demonstrated the validity of the new algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.3
• /
• pp.1083-1097
• /
• 2018

This paper presents a novel range-free localization algorithm based on quantum particle swarm optimization. The proposed algorithm is capable of estimating the distance between two non-neighboring sensors for multi-hop heterogeneous wireless sensor networks where all nodes' communication ranges are different. Firstly, we construct a new cumulative distribution function of expected hop progress for sensor nodes with different transmission capability. Then, the distance between any two nodes can be computed accurately and effectively by deriving the mathematical expectation of cumulative distribution function. Finally, quantum particle swarm optimization algorithm is used to improve the positioning accuracy. Simulation results show that the proposed algorithm is superior in the localization accuracy and efficiency when used in random and uniform placement of nodes for heterogeneous wireless sensor networks.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.2
• /
• pp.212-215
• /
• 2008

In this paper, we develop the optimal path planning algorithm using the improved Dijkstra algorithm and the particle swarm optimization. To get the optimal path, at first we construct the MAKLINK on the world environment and then make a graph associated with the MAKLINK. The MAKLINK is a set of edges which consist of the convex set. Some of the edges come from the edges of the obstacles. From the graph, we obtain the Dijkstra path between the starting point and the destination point. From the optimal path, we search the improved Dijkstra path using the graph. Finally, applying the particle swarm optimization to the improved Dijkstra path, we obtain the optimal path for the mobile robot. It turns out that the proposed method has better performance than the result in [1] through the experiment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2574-2587
• /
• 2019

Blind Source Separation (BSS) is a technique used to separate supposed independent sources of signals from a given set of observations. In this paper, the High Exploration Particle Swarm Optimization (HEPSO) algorithm, which is an enhancement of the Particle Swarm Optimization (PSO) algorithm, has been used to separate a set of source signals. Compared to PSO algorithm, HEPSO algorithm depends on two additional operators. The first operator is based on the multi-crossover mechanism of the genetic algorithm while the second one relies on the bee colony mechanism. Both operators have been employed to update the velocity and the position of the particles respectively. Thus, they are used to find the optimal separating matrix. The proposed method enhances the overall efficiency of the standard PSO in terms of good exploration and performance. Based on many tests realized on speech and music signals supplied by the BSS demo, experimental results confirm the robustness and the accuracy of the introduced BSS technique.

• Journal of Power System Engineering
• /
• v.21 no.5
• /
• pp.41-47
• /
• 2017

To implement Argentina tango dancer-like walking of the humanoid robot, a new trajectory generation scheme based on particle swarm optimization of the blending polynomial is presented. Firstly, the characteristics of Argentina tango walking are derived from observation of tango dance. Secondly, these are reflected in walking pose conditions and cost functions of particle swarm optimization to determine the coefficients of blending polynomial. For the stability of biped walking, zero moment point and reference trajectory of swing foot are also included in cost function. Thirdly, after tango walking cycle is divided into 3 stages with 2 postures, optimal trajectories of ankles, knees and hip of lower body, which include 6 sagittal and 4 coronal angles, are derived in consequence of optimization. Finally, the feasibility of the proposed scheme is validated by simulating biped walking of humanoid robot with derived trajectories under the 3D Simscape environment.