• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.7
• /
• pp.889-897
• /
• 1999

In this paper, we propose a new method of path planning for autonomous mobile robot in mapped circumstance. To search the optimal path, we adopt the genetic algorithm which is based on the natural mechanics of selection, crossover and mutation. We propose a method for generating the path population, selection and evaluation in genetic algorithm. Simulations show the efficiency for the global path planning, if we adopt the proposed GA method

• Proceedings of the KIEE Conference
• /
• 1995.07b
• /
• pp.1006-1010
• /
• 1995

This paper describes Sexual Reproduction Genetic Algorithm(SRGA) for function optimization. In SRGA, each individual utilize a diploid chromosome structure. Sex cells(gametes) are produced through artificial meiosis in which crossover and mutation occur. The proposed method has two selection operators, one, individual selection which selects the individual to fertilize, and the other, gamete selection which makes zygote for offspring production. We consider the effects of multi-selection and diploidy on search performance. SRGA improves local and global search(exploitation and exploration) and show optimum tracking performance in nonstationary environments. Gray coding is incorporated to transforming the search space and Genic uniform distribution method is proposed to alleviate the problem of premature convergence.

• Journal of Life Science
• /
• v.19 no.1
• /
• pp.152-155
• /
• 2009

The old-gold-crimson ($og^c$) fruit color mutation produces deep red tomato fruit with high lycopene content. age is a null mutation allele of lycopene-${\beta}$-cyclase (Crt-b) gene (B locus) that converts lycopene to ${\beta}$-carotene in the cartenoid biosynthesis pathway in tomato. Breeding of high lycopene tomato cultivars can be accelerated by marker-assisted selection (MAS) for introgression of $og^c$ allele by using a gene-based DNA marker. In order to develop a marker, single nucleotide deletion of adenine(A) with. in a poly-A repeat that has been known to be responsible for frame-shift mutation of $og^c$ was confirmed by resequencing mutant allele and wild-type allele at B locus of several tomato lines. For allele discrimination and detection of $og^c$, derived CAPS (dCAPS) approach was used by designing a primer that artificially introduced restriction enzyme recognition site of Hin fI in PCR products from $og^c$ allele. This dCAPS marker is co-dominant gene-based PCR marker that can be efficiently used for MAS breeding program aiming the development of high lycopene tomato.

• Proceedings of the Korean Society of Applied Entomolohy Conference
• /
• 2001.11a
• /
• pp.60-60
• /
• 2001

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.12
• /
• pp.4776-4798
• /
• 2015

The location selection of virtual machines in distributed cloud is difficult because of the physical resource distribution, allocation of multi-dimensional resources, and resource unit cost. In this study, we propose a multi-object virtual machine location selection algorithm (MOVMLSA) based on group information, doubly linked list structure and genetic algorithm. On the basis of the collaboration of multi-dimensional resources, a fitness function is designed using fuzzy logic control parameters, which can be used to optimize search space solutions. In the location selection process, an orderly information code based on group and resource information can be generated by adopting the memory mechanism of biological immune systems. This approach, along with the dominant elite strategy, enables the updating of the population. The tournament selection method is used to optimize the operator mechanisms of the single-point crossover and X-point mutation during the population selection. Such a method can be used to obtain an optimal solution for the rapid location selection of virtual machines. Experimental results show that the proposed algorithm is effective in reducing the number of used physical machines and in improving the resource utilization of physical machines. The algorithm improves the utilization degree of multi-dimensional resource synergy and reduces the comprehensive unit cost of resources.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.26 no.6
• /
• pp.1092-1098
• /
• 2002

This paper discusses the composition of the theory of reinforcement teaming, which is applied in real-time teaming, and evolutionary strategy, which proves its the superiority in the finding of the optimal solution at the off-line teaming method. The individuals are reduced in order to team the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It is possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because of the teaming process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes. In the future, studies are needed on the proof of the theory through experiments and the characteristic considerations of the robustness against the outside disturbances.

• Journal of the Korean Society for Precision Engineering
• /
• v.14 no.3
• /
• pp.89-97
• /
• 1997

A genetic algorithm (GA) is a stochastic direct search strategy that mimics the process of genetic evolution. The GA applied herein works on a population of structural designs at any one time, and uses a structured information exchange based on the principles of natural selection and wurvival of the fittest to recombine the most desirable features of the designs over a sequence of generations until the process converges to a "maximum fitness" design. Principles of genetics are adapted into a search procedure for structural optimization. The methods consist of three genetics operations mainly named selection, cross- over and mutation. In this study, a method of finding the optimum topology of truss/beam structure is pro- posed by using the GA. In order to use GA in the optimum topology problem, chromosomes to FEM elements are assigned, and a penalty function is used to include constraints into fitness function. The results show that the GA has the potential to be an effective tool for the optimal design of structures accounting for sizing, geometrical and topological variables.variables.

• Journal of the Institute of Convergence Signal Processing
• /
• v.3 no.2
• /
• pp.71-75
• /
• 2002

We propose a new method to deal with the optimized auto-tuning for the PID controller which is used to the process-control in various fields. First of all, in this method, 1st order delay system with dead time which is modelled from the unit step response of the system is Pade-approximated, then initial values are determined by the Ziegler-Nichols method and deciding binary strings of parents generation using by the fitness values of genetic algorithms, we perform selection, crossover and mutation to generate the descendant generation. The advantage of this method is better than the Ziegler-Nickels method in characteristic of output, and has extent of applying without limit of K, L, T parameters.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1553-1557
• /
• 2004

A real-time processing system for embedded hardware genetic algorithm is suggested. In order to operate basic module of genetic algorithm in parallel, such as selection, crossover, mutation and evaluation, dual processors based architecture is implemented. The system consists of two Xscale processors and two FPGA with evolvable hardware, which enables to process genetic algorithm efficiently by distributing the computational load of hardware genetic algorithm to each processors equally. The hardware genetic algorithm runs on Linux OS and the resulted chromosome is executed on evolvable hardware in FPGA. Furthermore, the suggested architecture can be extended easily for a couple of connected processors in serial, making it accelerate to compute a real-time hardware genetic algorithm. To investigate the effect of proposed approach, performance comparisons is experimented for an typical computation of genetic algorithm.

• Computers and Concrete
• /
• v.11 no.6
• /
• pp.541-569
• /
• 2013

There is a wide variety of existing Genetic Algorithms (GA) operators and parameters in the literature. However, there is no unique technique that shows the best performance for different classes of optimization problems. Hence, the evaluation of these operators and parameters, which influence the effectiveness of the search process, must be carried out on a problem basis. This paper presents a comparison for the influence of GA operators and parameters on the performance of the damage identification problem using the finite element model updating method (FEMU). The damage is defined as reduction in bending rigidity of the finite elements of a reinforced concrete beam. A certain damage scenario is adopted and identified using different GA operators by minimizing the differences between experimental and analytical modal parameters. In this study, different selection, crossover and mutation operators are compared with each other based on the reliability, accuracy and efficiency criteria. The exploration and exploitation capabilities of different operators are evaluated. Also a comparison is carried out for the parallel and sequential GAs with different population sizes and the effect of the multiple use of some crossover operators is investigated. The results show that the roulettewheel selection technique together with real valued encoding gives the best results. It is also apparent that the Non-uniform Mutation as well as Parent Centric Normal Crossover can be confidently used in the damage identification problem. Nevertheless the parallel GAs increases both computation speed and the efficiency of the method.