• 제목/요약/키워드: Evolutionary Pattern

검색결과 128건 처리시간 0.023초

An Evolutionary Optimization Approach for Optimal Hopping of Humanoid Robots

  • Hong, Young-Dae
    • Journal of Electrical Engineering and Technology
    • /
    • 제10권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.

양자화 진화알고리즘을 적용한 널 패턴합성 알고리즘의 특성 연구 (A Study on Characteristics of Null Pattern Synthesis Algorithm Using Quantum-inspired Evolutionary Algorithm)

  • 서종우;박동철
    • 한국군사과학기술학회지
    • /
    • 제19권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.

유전자 알고리즘을 이용한 타이어 공력소음의 저감 (Reduction of Air-pumping Noise based on a Genetic Algorithm)

  • 김의열;황성욱;김병현;이상권
    • 한국소음진동공학회논문집
    • /
    • 제22권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.

차분진화 알고리즘을 이용한 지역 Linear Discriminant Analysis Classifier 기반 패턴 분류 규칙 설계 (Design of Pattern Classification Rule based on Local Linear Discriminant Analysis Classifier by using Differential Evolutionary Algorithm)

  • 노석범;황은진;안태천
    • 한국지능시스템학회논문지
    • /
    • 제22권1호
    • /
    • pp.81-86
    • /
    • 2012
  • 본 논문에서는 전형적인 Linear Discriminant Analysis을 확장시켜 전체 입력공간을 다수의 지역공간으로 분할하고 분할된 공간에 Local Linear Discriminant Analysis 기반으로 하여 패턴 분류 규칙을 설계하는 새로운 방법을 제안한다. 전체 입력공간을 여러 개의 지역공간으로 분할하기 위한 방법으로 unsupervised clustering의 대표적인 방법인 k-Means 클러스터링 기법과 최적화 알고리즘인 차분 진화 연산 알고리즘을 사용한다. 제안된 알고리즘의 성능 평가를 위해 기존의 패턴 분류기와 비교 결과를 제시한다.

Applications of artificial intelligence and data mining techniques in soil modeling

  • Javadi, A.A.;Rezania, M.
    • Geomechanics and Engineering
    • /
    • 제1권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.

인류 보행의 진화: 컴퓨터 시뮬레이션 연구 (Evolution of Human Locomotion: A Computer Simulation Study)

  • 엄광문;하세카즈노리
    • 한국정밀공학회지
    • /
    • 제21권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.

Biogeography and Distribution Pattern of a Korean Wood-eating Cockroach Species, Cryptocercus kyebangensis, Based on Genetic Network Analysis and DNA Sequence Information

  • Park, Yung-Chul;Choe, Jae-Chun
    • Journal of Ecology and Environment
    • /
    • 제30권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.

EP Based PSO Method for Solving Multi Area Unit Commitment Problem with Import and Export Constraints

  • Venkatesan, K.;Selvakumar, G.;Rajan, C. Christober Asir
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권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.

Effective Multi-label Feature Selection based on Large Offspring Set created by Enhanced Evolutionary Search Process

  • Lim, Hyunki;Seo, Wangduk;Lee, Jaesung
    • 한국컴퓨터정보학회논문지
    • /
    • 제23권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.

Implementation of Strength Pareto Evolutionary Algorithm II in the Multiobjective Burnable Poison Placement Optimization of KWU Pressurized Water Reactor

  • Gharari, Rahman;Poursalehi, Navid;Abbasi, Mohammadreza;Aghaie, Mahdi
    • Nuclear Engineering and Technology
    • /
    • 제48권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.