• Journal of Navigation and Port Research
• /
• v.35 no.6
• /
• pp.501-507
• /
• 2011

This paper focuses on dispatching strategy for AGVs(Automated Guided Vehicle). The goal of AGV dispatching is assigning AGVs to requested job to minimizing the delay of QCs and the travel distance of AGVs. Due to the high dynamic nature of container terminal environment, the effect of dispatching is hard to predict thus it leads to frequent modification of dispatching decisions. In this situation, approaches based on a single rule are widely used due to its simplicity and small computational cost. However, these approaches have a limitation that cannot guarantee a satisfactory performance for the various performance measures. In this paper, dispatching strategy based on multicriteria heuristics is proposed. The Proposed strategy consists of multiple decision criteria. A multi-objective evolutionary algorithm is applied to optimize weights of those criteria. The result of simulation experiment shows that the proposed approach outperforms single rule-based dispatching approaches.

• Transactions on Control, Automation and Systems Engineering
• /
• v.4 no.2
• /
• pp.176-187
• /
• 2002

This paper focuses on the study of simulation and evolution of Micro Air Vehicles. Micro Air Vehicles or MAVs are small flying robots that are used for surveillance, search and rescue, and other missions. The simulated robots are designed based on realistic characteristics and the brains (controllers) of the robots are generated using genetic algorithms, i .e., simulated evolution. The objective for the experiments is to investigate the effects of robot team size and topology (simulation environment) on the evolution of simulated robots. The testing of team sizes deals with finding an ideal number of robots to be deployed for a given mission. The goal of the topology experiments is to see if there is an ideal topology (environment) to evolve the robots in order to increase their utility in most environments. We compare the results of the various experiments by evaluating the fitness values of the robots i .e., performance measure. In addition, evolved robot teams are tested in different situation in order to determine if the results can be generalized, and statistical analysis is performed to evaluate the evolved results.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.19 no.1
• /
• pp.95-104
• /
• 2016

To make a firing table of artillery with trajectory simulation, a precise trajectory model which corresponds with real firing test is required. Recent 4-DOF modified point mass trajectory model is considered accurate as a theoretical model, but fitting coefficients are used in calculation to match with real firing test results. In this paper, modified point mass trajectory model is presented and method of setting ballistic coefficient is introduced by applying optimization algorithms. After comparing two different algorithms, Particle Swarm Optimization and Covariance Matrix Adaptation - Evolutionary Strategy, we found that using CMA-ES algorithm gives fine optimization result. This fitting coefficient setting method can be used to make trajectory simulation which is required for development of new projectiles in the future.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.9 no.2
• /
• pp.83-89
• /
• 2005

In this paper a new algorithm of learning and evolving artificial neural networks using gene expression programming (GEP) is presented. Compared with other traditional algorithms, this new algorithm has more advantages in self-learning and self-organizing, and can find optimal solutions of artificial neural networks more efficiently and elegantly. Simulation experiments show that the algorithm of evolving weights or thresholds can easily find the perfect architecture of artificial neural networks, and obviously improves previous traditional evolving methods of artificial neural networks because the GEP algorithm imitates the evolution of the natural neural system of biology according to genotype schemes of biology to crossover and mutate the genes or chromosomes to generate the next generation, and the optimal architecture of artificial neural networks with evolved weights or thresholds is finally achieved.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10a
• /
• pp.69-72
• /
• 1996

This paper considers a global resolution of kinematic redundancy under inequality constraints as a constrained optimal control. In this formulation, joint limits and obstacles are regarded as state variable inequality constraints, and joint velocity limits as control variable inequality constraints. Necessary and sufficient conditions are derived by using Pontryagin's minimum principle and penalty function method. These conditions leads to a two-point boundary-value problem (TPBVP) with natural, periodic and inequality boundary conditions. In order to solve the TPBVP and to find a global minimum, a numerical algorithm, named two-stage algorithm, is presented. Given initial joint pose, the first stage finds the optimal joint trajectory and its corresponding minimum performance cost. The second stage searches for the optimal initial joint pose with globally minimum cost in the self-motion manifold. The effectiveness of the proposed algorithm is demonstrated through a simulation with a 3-dof planar redundant manipulator.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.1
• /
• pp.1155-1161
• /
• 2001

We propose an adaptive nonlinear control algorithm for high precision tracking and stabilization of LOS(Line-of-Sight). The friction parameters of the LOS gimbal are estimated by off-line evolutionary strategy and the friction is compensated by estimated friction compensator. Especially, as the nonlinear control input in a small tracking error zone is enlarged by the nonlinear function, the steady state error is significantly reduced. The proposed algorithm is a direct adaptive control method based on the Lyapunov stability theory, and its convergence is guaranteed under the limited modeling error or torque disturbance. The performance of the pro-posed algorithm is verified by computer simulation on the LOS gimbal model of a moving vehicle.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.686-689
• /
• 2004

Genetic algorithm is well known for stochastic searching method in imitating natural phenomena. In recent times, studies have been conducted in improving conventional evolutionary computation speed and promoting precision. This paper presents an approach to optimize PID controller gains with the application of modified Genetic Algorithm using Support Vector Machine (SVMGA). That is, we aim to explore optimum parameters of PID controller using SVMGA. Simulation results are given to compare to those of tuning methods, based on Simple Genetic Algorithm and Ziegler-Nicholas tuning method.

• Journal of Computing Science and Engineering
• /
• v.8 no.4
• /
• pp.199-206
• /
• 2014

The ant colony optimization (ACO) algorithm is a new heuristic algorithm that offers good robustness and searching ability. With in-depth exploration, the ACO algorithm exhibits slow convergence speed, and yields local optimization solutions. Based on analysis of the ACO algorithm and the genetic algorithm, we propose a novel hybrid genetic ant colony optimization (NHGAO) algorithm that integrates multi-population strategy, collaborative strategy, genetic strategy, and ant colony strategy, to avoid the premature phenomenon, dynamically balance the global search ability and local search ability, and accelerate the convergence speed. We select the traveling salesman problem to demonstrate the validity and feasibility of the NHGAO algorithm for solving complex optimization problems. The simulation experiment results show that the proposed NHGAO algorithm can obtain the global optimal solution, achieve self-adaptive control parameters, and avoid the phenomena of stagnation and prematurity.

• Journal of Advanced Marine Engineering and Technology
• /
• v.25 no.2
• /
• pp.383-394
• /
• 2001

The stabilization control of inverted pendulum (IP) system is difficult because of its nonlinearity and structural unstability. In this paper, an Evolving Neural Network Controller (ENNC) without Error Back Propagation (EBP) is presented. An ENNC is described simply by genetic representation using an encoding strategy for types and slope values of each active functions, biases, weights and so on. By an evolutionary programming which has three genetic operation; selection, crossover and mutation, the predetermine controller is optimally evolved by updating simultaneously the connection patterns and weights of the neural networks. The performances of the proposed ENNC(PENNC)are compared with the one of conventional optimal controller and the conventional evolving neural network controller (CENNC) through the simulation and experimental results. And we showed that the finally optimized PENNC was very useful in the stabilization control of an IP system.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2005.09a
• /
• pp.300-304
• /
• 2005

Molecular dynamics of nanosecond timescale could provide a significant result for the structure analysis of oligopeptides. The most surprising was the fact that Chou-Fasman parameters which have no direct relationship with nanosecond molecular dynamics could implicate the result to a certain extent. A novel parameter termed X %-stickiness, which is another measure of compactness of a molecule, was first introduced effectively.