• Title/Summary/Keyword: Unconstrained Optimization Problem

Search Result 68, Processing Time 0.025 seconds

Visual Servo Navigation of a Mobile Robot Using Nonlinear Least Squares Optimization for Large Residual (비선형 최소 자승법을 이용한 이동 로봇의 비주얼 서보 네비게이션)

  • Kim, Gon-Woo;Nam, Kyung-Tae;Lee, Sang-Moo;Shon, Woong-Hee
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.4
    • /
    • pp.327-333
    • /
    • 2007
  • We propose a navigation algorithm using image-based visual servoing utilizing a fixed camera. We define the mobile robot navigation problem as an unconstrained optimization problem to minimize the image error between the goal position and the position of a mobile robot. The residual function which is the image error between the position of a mobile robot and the goal position is generally large for this navigation problem. So, this navigation problem can be considered as the nonlinear least squares problem for the large residual case. For large residual, we propose a method to find the second-order term using the secant approximation method. The performance was evaluated using the simulation.

  • PDF

Formulation of Seismic Drift Control Method (동적 변위 제어법의 정식화)

  • 박효선;박성무;권준혁
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1998.10a
    • /
    • pp.481-488
    • /
    • 1998
  • The drift and inter-story drift control method for steel structures subjected to seismic forces is formulated into a structural optimization problem in this paper. The formulated optimization problem with constraints on drift, inter-story drifts, and member strengthes are transformed into an unconstrained optimization problem. For the solution of the tranformed optimization problem an searching algorithm based on the gradient projection method utilizing gradient information on eigenvalues and eigenvectors are developed and presented in detail. The performance of the proposed algorithm is demonstrated by application to drift control of a verifying example.

  • PDF

An efficient method for nonlinear optimization problems using modified genetic algorithms (수정된 유전 알고리즘을 이용한 비선형최적화 문제의 효율적인 해법)

  • 윤영수;이상용
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 1996.04a
    • /
    • pp.519-524
    • /
    • 1996
  • This paper describes the application of Genetic Algorithms(GAs) to nonlinear constrained mixed optimization problems. Genetic Algorithms are combinatorial in nature, and therefore are computationally suitable for treating discrete and integer design variables. But, several problems that conventional GAs are ill defined are applicaiton of penalty function that can be adapted to transform a constrained optimization problem into an unconstrained optimization problem into an unconstrained one and premature convergence of solution. Thus, we developed an modified GAs to solve this problems, and two examples are given to demonstrate the effectiveness of the methodology developed in this paper.

  • PDF

An Optimization Algorithm to Compute Pre-Loads of the Given Static Equilibrium State in Train Dynamics (열차동역학에서 주어진 정적평형상태의 초기하중을 계산하기 위한 최적화 알고리즘)

  • 김종인;박정훈;유홍희;황요하
    • Journal of the Korean Society for Railway
    • /
    • v.2 no.3
    • /
    • pp.9-17
    • /
    • 1999
  • This paper presents a new algorithm to determine the pre-loads that sustain the static equilibrium state in a given position. The algorithm which uses a partial velocity matrix leads to an unconstrained optimization problem to compute the pre-loads of the suspensions. To demonstrate the validity of the proposed algorithm, the static analysis results that employ the pre-loads of three examples are presented using a reliable commercial program. Results of the analysis confirm the validity of the proposed algorithm.

  • PDF

A NOTE ON OPTIMIZATION WITH MORSE POLYNOMIALS

  • Le, Cong-Trinh
    • Communications of the Korean Mathematical Society
    • /
    • v.33 no.2
    • /
    • pp.671-676
    • /
    • 2018
  • In this paper we prove that the gradient ideal of a Morse polynomial is radical. This gives a generic class of polynomials whose gradient ideals are radical. As a consequence we reclaim a previous result that the unconstrained polynomial optimization problem for Morse polynomials has a finite convergence.

Seismic vibration control of bridges with excessive isolator displacement

  • Roy, Bijan K.;Chakraborty, Subrata;Mishra, Sudib K.
    • Earthquakes and Structures
    • /
    • v.10 no.6
    • /
    • pp.1451-1465
    • /
    • 2016
  • The effectiveness of base isolation (BI) systems for mitigation of seismic vibration of bridges have been extensively studied in the past. It is well established in those studies that the performance of BI system is largely dependent on the characteristics of isolator yield strength. For optimum design of such systems, normally a standard nonlinear optimization problem is formulated to minimize the maximum response of the structure, referred as Stochastic Structural Optimization (SSO). The SSO of BI system is usually performed with reference to a problem of unconstrained optimization without imposing any restriction on the maximum isolator displacement. In this regard it is important to note that the isolator displacement should not be arbitrarily large to fulfil the serviceability requirements and to avoid the possibility of pounding to the adjacent units. The present study is intended to incorporate the effect of excessive isolator displacement in optimizing BI system to control seismic vibration effect of bridges. In doing so, the necessary stochastic response of the isolated bridge needs to be optimized is obtained in the framework of statistical linearization of the related nonlinear random vibration problem. A simply supported bridge is taken up to elucidate the effect of constraint condition on optimum design and overall performance of the isolated bridge compared to that of obtained by the conventional unconstrained optimization approach.

An Improved Exact Algorithm for the Unconstrained Two-Dimensional Cutting Problem (개수 제한이 없는 2차원 절단문제를 위한 향상된 최적해법)

  • Gee, Young-Gun;Kang, Maing-Kyu
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.27 no.4
    • /
    • pp.424-431
    • /
    • 2001
  • This paper is concerned with the unconstrained two-dimensional cutting problem of cutting small rectangles (products), each of which has its own profit and size, from a large rectangle (material) to maximize the profit-sum of products. Since this problem is used as a sub-problem to generate a cutting pattern in the algorithms for the two-dimensional cutting stock problem, most of researches for the two-dimensional cutting stock problem have been concentrated on solving this sub-problem more efficiently. This paper improves Hifi and Zissimopoulos's recursive algorithm, which is known as the most efficient exact algorithm, by applying newly proposed upper bound and searching strategy. The experimental results show that the proposed algorithm has been improved significantly in the computational amount of time as compared with the Hifi and Zissimopulos's algorithm.

  • PDF

Optimal Design of Single-sided Linear Induction Motor Using Genetic Algorithm (유전알고리즘을 이용한 편측식 선형유도전동기의 최적설계)

  • Ryu, Keun-Bae;Choi, Young-Jun;Kim, Chang-Eob;Kim, Sung-Woo;Im, Dal-Ho
    • Proceedings of the KIEE Conference
    • /
    • 1993.07b
    • /
    • pp.923-928
    • /
    • 1993
  • Genetic algorithms are powerful optimization methods based on the mechanism of natural genetics and natural selection. Genetic algorithms reduce chance of searching local optima unlike most conventional search algorithms and especially show good performances in complex nonlinear optimization problems because they do not require any information except objective function value. This paper presents a new model based on sexual reproduction in nature. In the proposed Sexual Reproduction model(SR model), individuals consist of the diploid of chromosomes, which are artificially coded as binary string in computer program. The meiosis is modeled to produce the sexual cell(gamete). In the artificial meiosis, crossover between homologous chromosomes plays an essential role for exchanging genetic informations. We apply proposed SR model to optimization of the design parameters of Single-sided Linear Induction Motor(SLIM). Sequential Unconstrained Minimization Technique(SUMT) is used to transform the nonlinear optimization problem with many constraints of SLIM to a simple unconstrained problem, We perform optimal design of SLIM available to FA conveyer systems and discuss its results.

  • PDF

Optimum Design of a Linear Induction Motor for Electromagnetic Pump using Genetic Algorithm (유전알고리즘을 이용한 전자기 펌프용 선형유도전동기의 최적설계)

  • Kim, Chang-Eob;Hong, Sung-Ok
    • Proceedings of the KIEE Conference
    • /
    • 2000.07b
    • /
    • pp.744-746
    • /
    • 2000
  • This paper presents an optimum design of a linear induction motor(LIM) using genetic algorithm(GA). Sequential unconstrained minimization technique(SUMT) is used to transform the nonlinear optimization with constraints to a simple unconstrained problem. The objective functions of LIM such as trust, weight are optimized and the result was applied to the design of linear induction pump.

  • PDF

Member Design of Frame Structure Using Genetic Algorithm (유전자알고리즘에 의한 골조구조물의 부재설계)

  • Lee, Hong-Woo
    • Journal of Korean Association for Spatial Structures
    • /
    • v.4 no.4 s.14
    • /
    • pp.91-98
    • /
    • 2004
  • Genetic algorithm is one of the best ways to solve a discrete variable optimization problem. This method is an unconstrained optimization technique, so the constraints are handled in an implicit manner. The most popular way of handling constraints is to transform the original constrained problem into an unconstrained problem, using the concept of penalty function. I present the 3 fitness functions which represent the reject strategy, the penalty strategy, and the combined strategy. I make the design program using the 3 fitness Auctions and it is applied to the design problem of a gable frame and a 2 story 3 span frame.

  • PDF