• Proceedings of the KAIS Fall Conference
• /
• 2007.11a
• /
• pp.81-84
• /
• 2007

In this thesis, we have designed the indirect adaptive controller using Dynamic Neural Units(DNU) for unknown nonlinear systems. Proposed indirect adaptive controller using Dynamic Neural Unit based upon the topology of a reverberating circuit in a neuronal pool of the central nervous system. In this thesis, we present a genetic DNU-control scheme for unknown nonlinear systems. Our method is different from those using supervised learning algorithms, such as the backpropagation (BP) algorithm, that needs training information in each step. The contributions of this thesis are the new approach to constructing neural network architecture and its training.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.04a
• /
• pp.147-152
• /
• 2000

In this paper we propose a Genetic Algorithm for the path planning of an autonomous mobile robot. Genetic Algorithms(GAs) have advantages of the adaptivity such as GAs work even if an environment is time-varying or unknown. Therefore, we propose the path planning algorithms using the GAs-based approach and show more adaptive and optimal performance by simulation.

• Journal of Internet Computing and Services
• /
• v.18 no.2
• /
• pp.43-51
• /
• 2017

As the game industry is blooming, the generation of contents is far behind the consumption of contents. With this reason, it is necessary to afford the game contents considering level of game player's skill. In order to effectively solve this problem, Procedural Content Generation(PCG) using Artificial Intelligence(AI) is one of the plausible options. This paper proposes the procedural method to generate various monsters considering level of player's skill using genetic algorithm. One gene consists of the properties of a monster and one genome consists of genes for various monsters. A generated monster is evaluated by battle simulation with a player and then goes through selection and crossover steps. Using our proposed scheme, players adaptive monsters are generated procedurally based on genetic algorithm and the variety of monsters which are generated with different number of genome is compared.

• Smart Structures and Systems
• /
• v.23 no.1
• /
• pp.1-14
• /
• 2019

Control algorithms are the most important aspects in successful control of structures against earthquakes. In recent years, intelligent control methods rather than classical control methods have been more considered by researchers, due to some specific capabilities such as handling nonlinear and complex systems, adaptability, and robustness to errors and uncertainties. However, due to lack of learning ability of fuzzy controller, it is used in combination with a genetic algorithm, which in turn suffers from some problems like premature convergence around an incorrect target. Therefore in this research, the introduction and design of the Fuzzy Cooperative Coevolution (Fuzzy CoCo) controller and Adaptive Neural-Fuzzy Inference System (ANFIS) have been innovatively presented for semi-active seismic control. In this research, in order to improve the seismic behavior of structures, a semi-active control of building using Magneto Rheological (MR) damper is proposed to determine input voltage of Magneto Rheological (MR) dampers using ANFIS and Fuzzy CoCo. Genetic Algorithm (GA) is used to optimize the performance of controllers. In this paper, the design of controllers is based on the reduction of the Park-Ang damage index. In order to assess the effectiveness of the designed control system, its function is numerically studied on a 9-story benchmark building, and is compared to those of a Wavelet Neural Network (WNN), fuzzy logic controller optimized by genetic algorithm (GAFLC), Linear Quadratic Gaussian (LQG) and Clipped Optimal Control (COC) systems in terms of seismic performance. The results showed desirable performance of the ANFIS and Fuzzy CoCo controllers in considerably reducing the structure responses under different earthquakes; for instance ANFIS and Fuzzy CoCo controllers showed respectively 38 and 46% reductions in peak inter-story drift ($J_1$) compared to the LQG controller; 30 and 39% reductions in $J_1$ compared to the COC controller and 3 and 16% reductions in $J_1$ compared to the GAFLC controller. When compared to other controllers, one can conclude that Fuzzy CoCo controller performs better.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.49 no.5
• /
• pp.205-211
• /
• 2000

This paper presents an optimal design method for fuzzy logic controller (FLC) of HVDC using an Adaptive Evolutionary Algorithm(AEA). We have proposed the AEA which uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary algorithms. The AEA is used for tuning fuzzy membership functions and scaling constants. Simulation results show that disturbances are well damped and the dynamic performances of FLC have better responses than those of PD controller when AC system load changes suddenly.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.160-162
• /
• 1999

This paper presents an optimal design method for fuzzy controllers of HVDC system using adaptive evolutionary algorithm(AEA). We have proposed an adaptive evolutionary algorithm which uses a genetic algorithm and an evolution strategy in an adaptive manner in order to take merits of two different evolutionary computations. AEA is used for tuning fuzzy membership functions, scaling constants and PD gains. The simulation results show that the disturbances are well damped by both controllers and the dynamic performances of fuzzy controllers have better responses than those of PD controllers when mechanical torque changes suddenly.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.11
• /
• pp.520-527
• /
• 2001

This paper suggests a new methodology of evolutionary computations - an Adaptive Evolutionary Algorithm (AEA) for solving the Economic Load Dispatch (ELD) problem which has piecewise quadratic cost functions and prohibited operating zones with many local minima. AEA uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations: global search capability of GA and local search capability of ES. In the reproduction procedure, proportions of the population by GA and the population by ES are adaptively modulated according to the fitness. Case studies illustrate the superiority of the proposed methods to existing conventional methods in power generation cost and computation time. The results demonstrate that the AEA can be applied successfully in the solution of ELD with piecewise quadratic cost functions and prohibited operating zones

• Journal of Construction Engineering and Project Management
• /
• v.7 no.2
• /
• pp.1-10
• /
• 2017

The Clonal Selection Algorithm (CSA) is an algorithm inspired by the human immune system mechanism. In CSA, several parameters needs to be optimized by large amount of sensitivity analysis for the optimal results. They limit the accuracy of the results due to the uncertainty and subjectivity. Adaptive Clonal Selection (ACS), a modified version of CSA, is developed as an algorithm without controls by pre-defined parameters in terms of selection process and mutation strength. In this paper, we discuss the ACS in detail and present its implementation in construction site utilization planning (CSUP). When applied to a developed model published in research literature, it proves that the ACS are capable of searching the optimal layout of temporary facilities on construction site based on the result of objective function, especially when the parameterization process is considered. Although the ACS still needs some improvements, obtaining a promising result when working on a same case study computed by Genetic Algorithm and Electimze algorithm prove its potential in solving more complex construction optimization problems in the future.

• International Journal of Computer Science & Network Security
• /
• v.23 no.6
• /
• pp.193-201
• /
• 2023

In this paper, we consider the maximum scatter traveling salesman problem (MSTSP), a travelling salesman problem (TSP) variant. The problem aims to maximize the minimum length edge in a salesman's tour that travels each city only once in a network. It is a very complicated NP-hard problem, and hence, exact solutions can be found for small sized problems only. For large-sized problems, heuristic algorithms must be applied, and genetic algorithms (GAs) are found to be very successfully to deal with such problems. So, this paper develops a hybrid GA (HGA) for solving the problem. Our proposed HGA uses sequential sampling algorithm along with 2-opt search for initial population generation, sequential constructive crossover, adaptive mutation, randomly selected one of three local search approaches, and the partially mapped crossover along with swap mutation for perturbation procedure to find better quality solution to the MSTSP. Finally, the suggested HGA is compared with a state-of-art algorithm by solving some TSPLIB symmetric instances of many sizes. Our computational experience reveals that the suggested HGA is better. Further, we provide solutions to some asymmetric TSPLIB instances of many sizes.

• Journal of Electrical Engineering and Technology
• /
• v.1 no.4
• /
• pp.435-447
• /
• 2006

This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.