• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.9
• /
• pp.1266-1272
• /
• 2014

We define the mobile robot navigation problem as an optimization problem to minimize the cost function with the pose error between the goal position and the position of a mobile robot. Using Gauss-Newton method for the optimization, the optimal speeds of the left and right wheels can be found as the solution of the optimization problem. Especially, the rotational speed of wheels of a mobile robot can be directly related to the overall speed of a mobile robot using the Jacobian derived from the kinematic model. When the robot detects the obstacle using sensors, the sub-goal switching method is adopted for the efficient obstacle avoidance during the navigation. The performance was evaluated using the simulation and the simulation results show the validity of the proposed method.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.26 no.2
• /
• pp.13-46
• /
• 2001

SDP (Semidefinite Programming), as a sort of “cone-LP”, optimizes a linear function over the intersection of an affine space and a cone that has the origin as its apex. SDP, however, has been developed in the process of searching for better solution methods for NP-hard combinatorial optimization problems. We surveyed the basic theories necessary to understand SDP researches. First, We examined SDP duality, comparing it to LP duality, which is essential for the interior point method, Second, we showed that SDP can be optimized from an interior solution in polynomial time with a desired error limit. finally, we summarized several research papers that showed SDP can improve solution methods for some combinatorial optimization problems, and explained why SDP has become one of the most important research topics in optimization. We tried to integrate SDP theories. relatively diverse and complicated. to survey research papers with our own perspective, and thus to help researcher to pursue their SDP researches in depth.

• International Journal of Contents
• /
• v.12 no.3
• /
• pp.22-28
• /
• 2016

Tensor with missing or incomplete values is a ubiquitous problem in various fields such as biomedical signal processing, image processing, and social network analysis. In this paper, we considered how to reconstruct a dataset with missing values by using tensor form which is called tensor completion process. We applied Tucker factorization to solve tensor completion which was built base on optimization problem. We formulated the optimization objective function using components of Tucker model after decomposing. The weighted least square matric contained only known values of the tensor with low rank in its modes. A first order optimization method, namely Nonlinear Conjugated Gradient, was applied to solve the optimization problem. We demonstrated the effectiveness of the proposed method in EEG signals with about 70% missing entries compared to other algorithms. The relative error was proposed to compare the difference between original tensor and the process output.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2542-2547
• /
• 2005

In this paper, we propose a support vector machine (SVM) hyper and kernel parameter optimization method which is based on minimizing radius/margin bound which is a kind of estimation of leave-one-error. This method uses dynamic encoding algorithm for search (DEAS) and gradient information for better optimization performance. DEAS is a recently proposed optimization algorithm which is based on variable length binary encoding method. This method has less computation time than genetic algorithm (GA) based and grid search based methods and better performance on finding global optimal value than gradient based methods. It is very efficient in practical applications. Hand-written letter data of MNI steel are used to evaluate the performance.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.12 no.1
• /
• pp.29-35
• /
• 2012

This paper introduces an adaptive control method of strong mutation rate and probability for queen-bee genetic algorithms. Although the queen-bee genetic algorithms have shown good performances, it had a critical problem that the strong mutation rate and probability should be selected by a trial and error method empirically. In order to solve this problem, we employed the measure of convergence and used it as a control parameter of those. Experimental results with four function optimization problems showed that our method was similar to or sometimes superior to the best result of empirical selections. This indicates that our method is very useful to practical optimization problems because it does not need time consuming trials.

• Journal of Institute of Control, Robotics and Systems
• /
• v.14 no.12
• /
• pp.1278-1285
• /
• 2008

An optimization-based real-time joint angle extraction method of human elbow is proposed by processing the biomedical signal of surface EMG (electromyogram) measured at the center point of biceps brachii. The EMG signal is known as non-stationary (time-varying) signal, but we assume that it is quasi-stationary because a physical or physiological system has limitations in the rate at which it can change its characteristics. Based on the assumption, a pre-processing method to obtain pre-angle values from raw EMG signal is firstly suggested, and then an optimization method to minimize the error between the pre-angle and real joint angle is proposed in this paper. Finally, we suggest the experimental results showing the effectiveness of the proposed algorithm.

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

Transceiver optimization in multiple input multiple output (MIMO) cognitive systems is studied in this paper. The joint transceiver beamformer design is introduced to minimize the transmit power at secondary base station (SBS) while simultaneously controlling the interference to primary users (PUs) and satisfying the secondary users (SUs) signal-to-interference-plus-noise ratio (SINR) based on the convex optimization method. Due to the limited cooperation between SBS and PUs, the channel state information (CSI) usually cannot be obtained perfectly at the SBS in cognitive system. In this study, both perfect and imperfect CSI scenarios are considered in the beamformer design, and the proposed method is robust to CSI error. Numerical results validate the effectiveness of the proposed algorithm.

• Transactions of Materials Processing
• /
• v.26 no.1
• /
• pp.41-47
• /
• 2017

Cyclic behavior of advanced high strength steel sheets was measured using an inverse-optimization approach with pre-straining and bending. First, tensile specimens were pre-strained, and three-point bending was conducted for the pre-strained specimens. By using the inverse finite element optimization, the combined isotropic-kinematic hardening parameters that minimize the error between the measured and predicted bending force-displacement curves. The measured cyclic behavior agreed well with the cyclic behavior measured by sheet tension-compression test, which confirms the validity of the measuring procedure based on inverse optimization.

• Proceedings of the KSME Conference
• /
• 2008.11a
• /
• pp.1063-1068
• /
• 2008

A lens system of a camera module for mobile phones is comprised of the composition and design of various shapes of lens. To improve responses such as the modular transfer function (MTF), a lens system should always be constructed by considering uncertainty that can be caused by manufacturing and assembly error. In this study, tolerance optimization using the Latin Hypercube Sampling (LHS) technique is performed. In order to reduce the computational burden of the tolerance optimization process and decrease the influence from numerical noise effectively, we use the Progressive Quadratic Response Surface Modeling (PQRSM), which is one of Sequential Approximate Optimization (SAO) techniques. Using this method, we achieved optimal tolerance for each lens and obtained reliability for satisfying user‘s requirements. In addition, through the design process the manufacturing and assembly cost of a lens system was reduced.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2000.10a
• /
• pp.249-254
• /
• 2000

The contact forces between die components for the drawing of large size automotive panels introduce elastic deflections of the die components. Due to the deflections, the gap between blank holder and die varies locally resulting in nonuniform material flow. Such a nonuniform die gap usually requires correcting operation, so called die spotting, which is time consuming trial and error process. To reduce the die spotting time, the optimization of the blank holder bending deflection is needed. In this paper, we implemented an analysis procedure to predict the blank holder deflection. The analysis procedure and design of experiments techniques are applied to the optimization of balance block heights. The optimization results can be used as guidelines in actual die spotting process.