• Computers and Concrete
• /
• 제2권5호
• /
• pp.411-421
• /
• 2005

A linear programming problem of the optimal proportioning of concrete aggregates is discussed; and a self-adaptive genetic algorithm is developed to solve this problem. The proposed method is based on changing a range of variables for capturing the feasible region of the optimum solution. A computational verification of this method is compared with the results of the linear programming.

• Journal of Ship and Ocean Technology
• /
• 제11권4호
• /
• pp.21-28
• /
• 2007

Recently the importance of the utilization of engineering data is gradually increasing. Engineering data contains the experiences and know-how of experts. Data mining technique is useful to extract knowledge or information from the accumulated existing data. This paper deals with generating optimal polynomials using genetic programming (GP) as the module of Data Mining system. Low order Taylor series are used to approximate the polynomial easily as a nonlinear function to fit the accumulated data. The overfitting problem is unavoidable because in real applications, the size of learning samples is minimal. This problem can be handled with the extended data set and function node stabilization method. The Data Mining system for the ship design based on polynomial genetic programming is presented.

• 전기학회논문지
• /
• 제65권12호
• /
• pp.2069-2074
• /
• 2016

This paper presents a methodology based on evolutionary optimization for simultaneously optimizing design parameters of controller and components of plant. Genetic programming(GP) based bond graph model generation is adopted to open-ended search for the plant. Also GP is applied to represent the controller with a unified method. The formulations of simultaneous plant-controller design optimization problem and the description of solution techniques based on bond graph are derived. A feasible solutions for a plant/controller design using the simultaneous optimization methodology is illustrated.

• Geomechanics and Engineering
• /
• 제18권4호
• /
• pp.373-389
• /
• 2019

It is important to study the problem of durability for tunnel structures. As a main influence on the durability of tunnel structures, carbonation-induced corrosion is studied. For the complicated environment of tunnel structures, based on the data samples from real engineering examples, the intelligent method (genetic programming) is used to construct the service life prediction model of tunnel structures. Based on the model, the prediction of service life for tunnel structures in carbonation environments is studied. Using the data samples from some tunnel engineering examples in China under carbonation environment, the proposed method is verified. In addition, the performance of the proposed prediction model is compared with that of the artificial neural network method. Finally, the effect of two main controlling parameters, the population size and sample size, on the performance of the prediction model by genetic programming is analyzed in detail.

• 한국지능시스템학회논문지
• /
• 제19권6호
• /
• pp.749-754
• /
• 2009

4족 보행로봇의 빠른 걸음새를 자동으로 생성하는 문제에 대해서 GP(Genetic Programming)와 CPG(Central Pattern Generator) 기반의 두 가지 방식을 비교한다. GP(Genetic Programming)를 이용한 관절좌표계 상에서의 걸음새 생성 기법은 발끝의 자취와 수 많은 자세 파라미터를 사용하는 대신에 적은수의 관절 궤적을 생성하므로 효율적이다. CPG는 뇌로부터의 입력을 받아서 진동적인 출력을 생성하는 신경회로로 고등생물의 걸음 원리를 수학적으로 모델링한 것이다. 바이올로이드로 구성된 4족 보행로봇에 대하여 Webots기반의 ODE 시뮬레이션을 통해 접근 기법들에 대한 최적화를 수행하고 결과를 비교 분석한다. 그리고, 구해진 시뮬레이션과 결과를 실제 로봇에 대해서 각 동작을 실행시켜 보면서 CPG와 GP 기반의 걸음새 방식의 실제적인 성능 및 특성을 고찰한다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1999년도 제14차 학술회의논문집
• /
• pp.292-297
• /
• 1999

Evolving in artificial agent is an extremely difficult problem, but on the other hand, a challenging task. At present the studies mainly centered on single agent learning problem. In our case, we use simulated soccer to investigate multi-agent cooperative learning. Consider the fundamental differences in learning mechanism, existing reinforcement learning algorithms can be roughly classified into two types-that based on evaluation functions and that of searching policy space directly. Genetic Programming developed from Genetic Algorithms is one of the most well known approaches belonging to the latter. In this paper, we give detailed algorithm description as well as data construction that are necessary for learning single agent strategies at first. In following step moreover, we will extend developed methods into multiple robot domains. game. We investigate and contrast two different methods-simple team learning and sub-group loaming and conclude the paper with some experimental results.

• Journal of Electrical Engineering and Technology
• /
• 제9권2호
• /
• pp.749-754
• /
• 2014

In this paper, we suggest tree-structure-aware GP (Genetic Programming) operators that heed tree distributions in structure space and their possible structural difficulties. The main idea of the proposed GP operators is to place the generated offspring of crossover and/or mutation in a specified region of tree structure space insofar as possible by biasing the tree structures of the altered subtrees, taking into account the observation that most solutions are found in that region. To demonstrate the effectiveness of the proposed approach, experiments on the binomial-3 regression, multiplexor and even parity problems are performed. The results show that the results using the proposed tree-structure-aware operators are superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• 전기학회논문지
• /
• 제67권6호
• /
• pp.767-772
• /
• 2018

Recently, some meta-heuristic algorithms, such as GA(Genetic Algorithm) and GP(Genetic Programming), have been used to optimize CNN(Convolutional Neural Network). The CNN, which is one of the deep learning models, has seen much success in a variety of computer vision tasks. However, designing CNN architectures still requires expert knowledge and a lot of trial and error. In this paper, the recent attempts to automatically construct CNN architectures are investigated and analyzed. First, two GA based methods are summarized. One is the optimization of CNN structures with the number and size of filters, connection between consecutive layers, and activation functions of each layer. The other is an new encoding method to represent complex convolutional layers in a fixed-length binary string, Second, CGP(Cartesian Genetic Programming) based method is surveyed for CNN structure optimization with highly functional modules, such as convolutional blocks and tensor concatenation, as the node functions in CGP. The comparison for three approaches is analysed and the outlook for the potential next steps is suggested.

• 한국지능시스템학회:학술대회논문집
• /
• 한국지능시스템학회 2007년도 추계학술대회 학술발표 논문집
• /
• pp.324-327
• /
• 2007

유전프로그래밍(GP)은 GA, ES, 그리고 EA등에 비해 구조의 복잡함으로 인해 상대적으로 진화방식 및 진화연산자에 대한 연구가 미진한 실정이다. 본 논문에서는 유전프로그래밍에 대한 점진형 진화 방식과 트리 깊이 및 부모간의 거리를 기반으로 한 새로운 진화연산자를 제안한다. 이항식 벤치마크 문제에 대하여 실험을 수행하였고, 세대형 진화 방식 및 기존 연산자와의 성능을 비교하였다.

• 융합신호처리학회논문지
• /
• 제11권1호
• /
• pp.80-87
• /
• 2010

함수합성법은 주어진 입출력 데이터 쌍으로부터 입출력관계를 충족하는 함수를 예측하는 것으로, 특성을 알 수 없는 시스템을 제어할 때에 필수적이다. 일반적으로 시스템은 비선형인 성질을 갖는 경우가 많고, 함수 합성에 취급하는 변수, 정수, 제약 등으로 조합된 문제가 발생하기가 쉽다. 그 함수를 합성하는 방법 중 한 가지로 유전적 프로그래밍이 제안되고 있다. 이것은 함수를 트리구조로 표시한 함수 트리에 유전적 조작을 적용하여, 입출력 관계를 충족하는 함수 트리를 탐색하는 방법이다. 본 논문에서는 기존의 유전적 프로그래밍에 의한 함수 합성법의 문제점을 지적하고, 새로운 4종류의 개선법을 제안한다. 즉, 함수 트리를 탐색할 때에 함수가 복잡하게 되는 것을 방지하기 위하여 함수 트리의 성장 억제, 조기 수렴을 목표로 하는 국소 탐색법의 채택, 함수 트리 내의 필요 없이 길어지는 요소의 효과적인 삭제, 대상으로 하는 문제의 특성을 이용하는 방법이다. 이러한 개선법을 이용할 경우, 기존의 유전적 프로그래밍에 의한 함수 합성법보다도 짧은 시간에 우수한 구조의 함수 트리가 구해지는 것을 2-spirals 문제에 대하여 컴퓨터 시뮬레이션을 통하여 확인하였다.