• Journal of Electrical Engineering and Technology
• /
• v.10 no.6
• /
• pp.2420-2426
• /
• 2015

This paper proposes an evolutionary optimization approach for optimal hopping of humanoid robots. In the proposed approach, the hopping trajectory is generated by a central pattern generator (CPG). The CPG is one of the biologically inspired approaches, and it generates rhythmic signals by using neural oscillators. During the hopping motion, the disturbance caused by the ground reaction forces is compensated for by utilizing the sensory feedback in the CPG. Posture control is essential for a stable hopping motion. A posture controller is utilized to maintain the balance of the humanoid robot while hopping. In addition, a compliance controller using a virtual spring-damper model is applied for stable landing. For optimal hopping, the optimization of the hopping motion is formulated as a minimization problem with equality constraints. To solve this problem, two-phase evolutionary programming is employed. The proposed approach is verified through computer simulations using a simulated model of the small-sized humanoid robot platform DARwIn-OP.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.4
• /
• pp.492-499
• /
• 2016

Null pattern synthesis method using the Quantum-inspired Evolutionary Algorithm(QEA) is described in this study. A $12{\times}12$ planar array antenna is considered and each element of the array antenna is controlled by 6-bit phase shifter. The maximum number of iteration of 500 is used in simulation and the rotation angle for updating Q-bit individuals is determined to make the individual converge to the best solution and is summarized in a look-up table. In this study we showed that QEA can satisfactorily synthesize the null pattern using smaller number of individuals compared with the conventional Genetic Algorithm.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.22 no.1
• /
• pp.61-73
• /
• 2012

The paper presents the novel approach to solve some problems occurred in application of the genetic algorithm to the determination of the optimal tire pattern sequence in order to reduce the tire air-pumping noise which is generated by the repeated compression and expansion of the air cavity between tire pattern and road surface. The genetic algorithm has been used to find the optimal tire pattern sequence having a low level of tire air-pumping noise using the image based air-pumping model. In the genetic algorithm used in the previous researches, there are some problems in the encoding structure and the selection of objective function. The paper proposed single encoding element with five integers, divergent objective function based on evolutionary process and the optimal evolutionary rate based on Shannon entropy to solve the problems. The results of the proposed genetic algorithm with evolutionary process are compared with those of the randomized algorithm without evolutionary process on the two-dimensional normal distribution. It is confirmed that the genetic algorithm is more effective to reduce the peak value of the predicted tire air-pumping noise and the consistency and cohesion of the obtained simulation results are also improved in terms of probability.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.22 no.1
• /
• pp.81-86
• /
• 2012

In this paper, we proposed a new design methodology of a pattern classification rule based on the local linear discriminant analysis expanded from the generic linear discriminant analysis which is used in the local area divided from the whole input space. There are two ways such as k-Means clustering method and the differential evolutionary algorithm to partition the whole input space into the several local areas. K-Means clustering method is the one of the unsupervised clustering methods and the differential evolutionary algorithm is the one of the optimization algorithms. In addition, the experimental application covers a comparative analysis including several previously commonly encountered methods.

• Geomechanics and Engineering
• /
• v.1 no.1
• /
• pp.53-74
• /
• 2009

In recent years, several computer-aided pattern recognition and data mining techniques have been developed for modeling of soil behavior. The main idea behind a pattern recognition system is that it learns adaptively from experience and is able to provide predictions for new cases. Artificial neural networks are the most widely used pattern recognition methods that have been utilized to model soil behavior. Recently, the authors have pioneered the application of genetic programming (GP) and evolutionary polynomial regression (EPR) techniques for modeling of soils and a number of other geotechnical applications. The paper reviews applications of pattern recognition and data mining systems in geotechnical engineering with particular reference to constitutive modeling of soils. It covers applications of artificial neural network, genetic programming and evolutionary programming approaches for soil modeling. It is suggested that these systems could be developed as efficient tools for modeling of soils and analysis of geotechnical engineering problems, especially for cases where the behavior is too complex and conventional models are unable to effectively describe various aspects of the behavior. It is also recognized that these techniques are complementary to conventional soil models rather than a substitute to them.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.5
• /
• pp.188-202
• /
• 2004

This research was designed to investigate biomechanical aspects of the evolution based on the hypothesis of dynamic cooperative interactions between the locomotion pattern and the body shape in the evolution of human bipedal walking The musculoskeletal model used in the computer simulation consisted of 12 rigid segments and 26 muscles. The nervous system was represented by 18 rhythmic pattern generators. The genetic algorithm was employed based on the natural selection theory to represent the evolutionary mechanism. Evolutionary strategy was assumed to minimize the cost function that is weighted sum of the energy consumption, the muscular fatigue and the load on the skeletal system. The simulation results showed that repeated manipulations of the genetic algorithm resulted in the change of body shape and locomotion pattern from those of chimpanzee to those of human. It was suggested that improving locomotive efficiency and the load on the musculoskeletal system are feasible factors driving the evolution of the human body shape and the bipedal locomotion pattern. The hypothetical evolution method employed in this study can be a new powerful tool for investigation of the evolution process.

• Journal of Ecology and Environment
• /
• v.30 no.4
• /
• pp.331-340
• /
• 2007

We examined the evolutionary and ecological processes shaping current geographical distributions of a Korean wood-eating cockroach species, Cryptocercus kyebangensis. Our research aims were to understand evolutionary pattern of DNA sequences, to construct genetic network of Cryptocercus kyebangensis local populations and to understand evolutionary and ecological processes shaping their current geographical distribution patterns via DNA sequence information and genetic networks, using sequence data of two genes (ITS-2 and AT region) from local populations of C. kyebangensis. The results suggest that the ITS-2 and AT region are appropriate molecular markers for elucidating C. kyebangensis geographic patterns at the population level. The MSN-A based on the ITS-2 showed two possible routes, the Hwaak-san and Myeongji-san route and the Seorak-san and Gyebang-san route, for migration of ancestral C. kyebangensis into South Korea. The MSNs (MSN-A and -B) elucidate migration routes well within South Korea, especially the route of Group I and Group II.

• Journal of Electrical Engineering and Technology
• /
• v.9 no.2
• /
• pp.415-422
• /
• 2014

This paper presents a new approach to solve the multi area unit commitment problem (MAUCP) using an evolutionary programming based particle swarm optimization (EPPSO) method. The objective of this paper is to determine the optimal or near optimal commitment schedule for generating units located in multiple areas that are interconnected via tie lines. The evolutionary programming based particle swarm optimization method is used to solve multi area unit commitment problem, allocated generation for each area and find the operating cost of generation for each hour. Joint operation of generation resources can result in significant operational cost savings. Power transfer between the areas through the tie lines depends upon the operating cost of generation at each hour and tie line transfer limits. Case study of four areas with different load pattern each containing 7 units (NTPS) and 26 units connected via tie lines have been taken for analysis. Numerical results showed comparing the operating cost using evolutionary programming-based particle swarm optimization method with conventional dynamic programming (DP), evolutionary programming (EP), and particle swarm optimization (PSO) method. Experimental results show that the application of this evolutionary programming based particle swarm optimization method has the potential to solve multi area unit commitment problem with lesser computation time.

• Journal of the Korea Society of Computer and Information
• /
• v.23 no.9
• /
• pp.7-13
• /
• 2018

Recent advancement in data gathering technique improves the capability of information collecting, thus allowing the learning process between gathered data patterns and application sub-tasks. A pattern can be associated with multiple labels, demanding multi-label learning capability, resulting in significant attention to multi-label feature selection since it can improve multi-label learning accuracy. However, existing evolutionary multi-label feature selection methods suffer from ineffective search process. In this study, we propose a evolutionary search process for the task of multi-label feature selection problem. The proposed method creates large set of offspring or new feature subsets and then retains the most promising feature subset. Experimental results demonstrate that the proposed method can identify feature subsets giving good multi-label classification accuracy much faster than conventional methods.

• Nuclear Engineering and Technology
• /
• v.48 no.5
• /
• pp.1126-1139
• /
• 2016

In this research, for the first time, a new optimization method, i.e., strength Pareto evolutionary algorithm II (SPEA-II), is developed for the burnable poison placement (BPP) optimization of a nuclear reactor core. In the BPP problem, an optimized placement map of fuel assemblies with burnable poison is searched for a given core loading pattern according to defined objectives. In this work, SPEA-II coupled with a nodal expansion code is used for solving the BPP problem of Kraftwerk Union AG (KWU) pressurized water reactor. Our optimization goal for the BPP is to achieve a greater multiplication factor ($K_{eff}$) for gaining possible longer operation cycles along with more flattening of fuel assembly relative power distribution, considering a safety constraint on the radial power peaking factor. For appraising the proposed methodology, the basic approach, i.e., SPEA, is also developed in order to compare obtained results. In general, results reveal the acceptance performance and high strength of SPEA, particularly its new version, i.e., SPEA-II, in achieving a semioptimized loading pattern for the BPP optimization of KWU pressurized water reactor.