• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1430-1434
• /
• 2003

In this paper, for the fuzzy-reaching law method which has the characteristic of elimination of chattering at sliding mode as well as the characteristic of fast response at the design of variable structure controller with reaching law, optimal solutions for the determination of parameters of fuzzy membership functions by using genetic algorithm are proposed. Generally, the design of fuzzy controller has difficulties in determining the parameters of fuzzy membership functions by using a tedious trial-and-error process. To overcome these difficulties, this paper develops genetic algorithm of an optimal searching method based on genetic operation, and to verify the validity of this proposed method it is simulated through 2 link robot manipulator.

• 제어로봇시스템학회논문지
• /
• 제9권2호
• /
• pp.168-175
• /
• 2003

A new algorithm based on Genetic Algorithms is proposed f3r solving process optimization problems formulated in MINLP, GDP and hybrid MINLP/GDP. This work is focused especially on the design of the Genetic Algorithm suitable to handle disjunctive programming with the same level of MINLP handling capability. Hybridization with the Simulated Annealing is experimented and many heuristics are adopted. Real and binary coded Genetic Algorithm initiates the global search in the entire search space and at every stage Simulated Annealing makes the candidates to climb up the local hills. Multi-Niche Crowding method is adopted as the multimodal function optimization technique. and the adaptation of probabilistic parameters and dynamic penalty systems are also implemented. New strategies to take the logical variables and constraints into consideration are proposed, as well. Various test problems selected from many fields of process systems engineering are tried and satisfactory results are obtained.

• 제어로봇시스템학회논문지
• /
• 제14권11호
• /
• pp.1110-1116
• /
• 2008

In this paper, we suggest GP operators based on tree structure considering tree distributions in structure space and structural difficulties. The main idea of the proposed genetic operators is to place generated offspring into the specific region which nodes and depths are balanced and most of solutions exist. To enable that, the proposed operators are designed to utilize region information where parents belong and node/depth rates of selected subtree. To demonstrate the effectiveness of our proposed approach, experiments of binomial-3 regression, multiplexer and even parity problem are executed. The experiments results show that the proposed operators based on tree structure is superior to the results of standard GP for all three test problems in both success rate and number of evaluations.

• 제어로봇시스템학회논문지
• /
• 제16권4호
• /
• pp.339-345
• /
• 2010

This paper introduces GP(Genetic Programming) based robust corner detectors for scaled and rotated images. Various empirical algorithms have been studied to improve computational speed and accuracy including approaches, such as the Harris and SUSAN, FAST corner detectors. These techniques are highly efficient for well-defined corners, but are limited to corner-like edges which are often generated in rotated images. It is very difficult to detect correctly edges which have characteristics similar to corners. In this paper, we have focused the above challenging problem and proposed Genetic Programming-based automated generation of corner detectors which is robust to scaled and rotated images. The proposed method is compared to the existing corner detectors on test images and shows superior results.

• 제어로봇시스템학회논문지
• /
• 제5권7호
• /
• pp.876-882
• /
• 1999

It is difficult to determine the feeding rate of coagulant in the water treatment process, due to nonlinearity, multivariables and slow response characteristics, etc. To deal with this difficulty, the genetic-fuzzy system was used in determining the feeding rate of the coagulant. The genetic algorithms are excellently robust in complex optimization problems. Since it uses randomized operators and searches for the best chromosome without auxiliary informations from a population consists of codings of parameter set. To apply this algorithms, we made the lookup table and membership function from the actual operation data of the water treatment process. We determined optimum dosages of coagulant(LAS) by the fuzzy operation, and compared it with the feeding rate of the actual operation data.

• 제어로봇시스템학회논문지
• /
• 제17권12호
• /
• pp.1210-1218
• /
• 2011

GA (Genetic Algorithms) are efficient for searching for global optima but may have some problems such as premature convergence, convergence to local extremum and divergence. These phenomena are related to the evolutionary operators. As population diversity converges to low value, the search ability of a GA decreases and premature convergence or converging to local extremum may occur but population diversity converges to high value, then genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we analyze the effects of the selection operator, crossover operator, and mutation operator on convergence properties, and propose the sweeping method of mutation probability and elitist propagation rate to maintain the diversity of the GA's population for getting out of the premature convergence. Results of simulation studies verify the feasibility of using these sweeping operators to avoid premature convergence and convergence to local extrema.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.140-140
• /
• 2000

Traditional genetic algorithms, though robust, are generally not the most successful optimization algorithm on any particular domain. Hybridizing a genetic algorithm with other algorithms can produce better performance than both the genetic algorithm and the other algorithms. In this paper, we use random process and simulated annealing instead of mutation operator in order to get well tuned fuzzy rules. The key of this approach is to adjust both the width and the center of membership functions so that the tuned rule-based fuzzy controller can generate the desired performance. The effectiveness of the proposed algorithm is verified by computer simulation.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.275-278
• /
• 1996

The application of genetic algorithms to fuzzy rule generation holds a great deal of promise in overcoming difficult problems in fuzzy systems design. There are some aspects to be considered when genetic algorithms are used for generating fuzzy rules. In this paper, we will present an aspect about the control surface constructed by the resultant rules. In the extensive simulations, an important observation that the rules searched by genetic algorithms are randomly scattered is made and a solution to this problem is provided by including a smoothness cost in the objective function. We apply the fuzzy rules generated by genetic algorithms to the fuzzy truck backer-upper control system and compare them with the rules made by an expert.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.1021-1023
• /
• 1996

This paper proposes a design of self-tuning fuzzy rules and membership functions based on genetic algorithms. Sub-optimal fuzzy rules and membership functions are found by using genetic algorithms. Genetic algorithms are used for tuning fuzzy rules and membership functions. A arbitrary speed trajectories are selected for the reference input of the proposed methods. Experimental results show the good performance in the DC motor control system with the self-tuning fuzzy controller based on genetic algorithms.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.71.2-71
• /
• 2001

This paper deals with nonlinear system modelling using neural network and genetic algorithm. Application of neural network to control and identification is actively studied because of their approximating ability of nonlinear function. It is important to design the neural network with optimal structure for minimum error and fast response time. Genetic algorithm is getting more popular nowadays because of their simplicity and robustness. In this paper, We optimize neural network structure using genetic algorithm. The genetic algorithm uses binary coding for neural network structure and search for optimal neural network structure of minimum error and response time. Through extensive simulation, Optimal neural network structure is shown to be effective for ...