• Title/Summary/Keyword: Robust Optimization

Search Result 709, Processing Time 0.034 seconds

Robust Control for the Rewritable Optical Disk Drives with Sinusoidal Disturbance of Uncertain Frequencies (불확실한 주파수의 정현파 외란이 있는 기록형 광 디스크 드라이브의 강인 제어)

  • Lee, Moon-Noh;Jin, Kyoung-Bog;Moon, Jung-Ho
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.8 no.8
    • /
    • pp.682-690
    • /
    • 2002
  • This paper presents an output feedback controller design method for uncertain linear systems with sinusoidal disturbance of uncertain frequencies. The controller needs to compensate for the performance deterioration due to the uncertain frequencies of sinusoidal disturbance. To this end, we introduce a virtual system including the dynamics corresponding to the uncertain frequencies and design a controller which minimizes the output difference between the virtual system and the closed-loop system. In other words, the controller is designed so that the closed-loop system approximates the virtual system. The feedback controller is achieved by solving an LMI optimization problem involving a robust $H_{\infty}$ constraint. The advantages of the proposed design method are examined by comparing it with a design method that only minimizes the $H_{\infty}$ norm of the transfer function between the sinusoidal disturbance and the output. The proposed design method is applied to the track-following system of rewritable optical disk drives and is evaluated through an experiment.

The Robust Artillery Locating Radar Deployment Model Against Enemy' s Attack Scenarios (적 공격시나리오 기반 대포병 표적탐지레이더 배치모형)

  • Lee, Seung-Ryul;Lee, Moon-Gul
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.43 no.4
    • /
    • pp.217-228
    • /
    • 2020
  • The ROK Army must detect the enemy's location and the type of artillery weapon to respond effectively at wartime. This paper proposes a radar positioning model by applying a scenario-based robust optimization method i.e., binary integer programming. The model consists of the different types of radar, its available quantity and specification. Input data is a combination of target, weapon types and enemy position in enemy's attack scenarios. In this scenario, as the components increase by one unit, the total number increases exponentially, making it difficult to use all scenarios. Therefore, we use partial scenarios to see if they produce results similar to those of the total scenario, and then apply them to case studies. The goal of this model is to deploy an artillery locating radar that maximizes the detection probability at a given candidate site, based on the probability of all possible attack scenarios at an expected enemy artillery position. The results of various experiments including real case study show the appropriateness and practicality of our proposed model. In addition, the validity of the model is reviewed by comparing the case study results with the detection rate of the currently available radar deployment positions of Corps. We are looking forward to enhance Korea Artillery force combat capability through our research.

Parallel 3-D Aerodynamic Shape Optimization on Unstructured Meshes

  • Lee, Sang-Wook;Kwon, Oh-Joon
    • International Journal of Aeronautical and Space Sciences
    • /
    • v.4 no.1
    • /
    • pp.45-52
    • /
    • 2003
  • A three-dimensional aerodynamic shape optimization technique in inviscid compressible flows is developed by using a parallel continuous adjoint formulation on unstructured meshes. A new surface mesh modification method is proposed to overcome difficulties related to patch-level remeshing for unstructured meshes, and the effect of design sections on aerodynamic shape optimization is examined. Applications are made to three-dimensional wave drag minimization problems including an ONERA M6 wing and the EGLIN wing-pylon-store configuration. The results show that the present method is robust and highly efficient for the shape optimization of aerodynamic configurations, independent of the number of design variables used.

Improved Concurrent Subspace Optimization Using Automatic Differentiation (자동미분을 이용한 분리시스템동시최적화기법의 개선)

  • 이종수;박창규
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 1999.10a
    • /
    • pp.359-369
    • /
    • 1999
  • The paper describes the study of concurrent subspace optimization(CSSO) for coupled multidisciplinary design optimization (MDO) techniques in mechanical systems. This method is a solution to large scale coupled multidisciplinary system, wherein the original problem is decomposed into a set of smaller, more tractable subproblems. Key elements in CSSO are consisted of global sensitivity equation(GSE), subspace optimization (SSO), optimum sensitivity analysis(OSA), and coordination optimization problem(COP) so as to inquiry valanced design solutions finally, Automatic differentiation has an ability to provide a robust sensitivity solution, and have shown the numerical numerical effectiveness over finite difference schemes wherein the perturbed step size in design variable is required. The present paper will develop the automatic differentiation based concurrent subspace optimization(AD-CSSO) in MDO. An automatic differentiation tool in FORTRAN(ADIFOR) will be employed to evaluate sensitivities. The use of exact function derivatives in GSE, OSA and COP makes Possible to enhance the numerical accuracy during the iterative design process. The paper discusses how much influence on final optimal design compared with traditional all-in-one approach, finite difference based CSSO and AD-CSSO applying coupled design variables.

  • PDF

Trajectory Optimization for Impact Angle Control based on Sequential Convex Programming (순차 컨벡스 프로그래밍을 이용한 충돌각 제어 비행궤적 최적화)

  • Kwon, Hyuck-Hoon;Shin, Hyo-Sub;Kim, Yoon-Hwan;Lee, Dong-Hee
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.68 no.1
    • /
    • pp.159-166
    • /
    • 2019
  • Due to the various engagement situations, it is very difficult to generate the optimal trajectory with several constraints. This paper investigates the sequential convex programming for the impact angle control with the additional constraint of altitude limit. Recently, the SOCP(Second-Order Cone Programming), which is one area of the convex optimization, is widely used to solve variable optimal problems because it is robust to initial values, and resolves problems quickly and reliably. The trajectory optimization problem is reconstructed as convex optimization problem using appropriate linearization and discretization. Finally, simulation results are compared with analytic result and nonlinear optimization result for verification.

Robust Algorithms for Combining Multiple Term Weighting Vectors for Document Classification

  • Kim, Minyoung
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.81-86
    • /
    • 2016
  • Term weighting is a popular technique that effectively weighs the term features to improve accuracy in document classification. While several successful term weighting algorithms have been suggested, none of them appears to perform well consistently across different data domains. In this paper we propose several reasonable methods to combine different term weight vectors to yield a robust document classifier that performs consistently well on diverse datasets. Specifically we suggest two approaches: i) learning a single weight vector that lies in a convex hull of the base vectors while minimizing the class prediction loss, and ii) a mini-max classifier that aims for robustness of the individual weight vectors by minimizing the loss of the worst-performing strategy among the base vectors. We provide efficient solution methods for these optimization problems. The effectiveness and robustness of the proposed approaches are demonstrated on several benchmark document datasets, significantly outperforming the existing term weighting methods.

A Taguchi Approach to Parameter Setting in a Genetic Algorithm for General Job Shop Scheduling Problem

  • Sun, Ji Ung
    • Industrial Engineering and Management Systems
    • /
    • v.6 no.2
    • /
    • pp.119-124
    • /
    • 2007
  • The most difficult and time-intensive issue in the successful implementation of genetic algorithms is to find good parameter setting, one of the most popular subjects of current research in genetic algorithms. In this study, we present a new efficient experimental design method for parameter optimization in a genetic algorithm for general job shop scheduling problem using the Taguchi method. Four genetic parameters including the population size, the crossover rate, the mutation rate, and the stopping condition are treated as design factors. For the performance characteristic, makespan is adopted. The number of jobs, the number of operations required to be processed in each job, and the number of machines are considered as noise factors in generating various job shop environments. A robust design experiment with inner and outer orthogonal arrays is conducted by computer simulation, and the optimal parameter setting is presented which consists of a combination of the level of each design factor. The validity of the optimal parameter setting is investigated by comparing its SN ratios with those obtained by an experiment with full factorial designs.

Modeling Approaches for Dynamic Robust Design Experiment

  • Bae, Suk-Joo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.373-376
    • /
    • 2006
  • In general, there are three kinds of methods in analyzing dynamic robust design experiment: loss model approach, response function approach, and response model approach. In this talk, we review the three modeling approaches in terms of several criteria in comparison. This talk also generalizes the response model approach based on a generalized linear model. We develop a generalized two-step optimization procedure to substantially reduce the process variance by dampening the effect of both explicit and hidden noise variables. The proposed method provides more reliable results through iterative modeling of the residuals from the fitted response model. The method is compared with three existing approaches in practical examples.

  • PDF

An Approximate Calculation Model for Electromagnetic Devices Based on a User-Defined Interpolating Function

  • Ye, Xuerong;Deng, Jie;Wang, Yingqi;Zhai, Guofu
    • Journal of Magnetics
    • /
    • v.19 no.4
    • /
    • pp.378-384
    • /
    • 2014
  • Optimization design and robust design are significant measures for improving the performance and reliability of electromagnetic devices (EMDs, specifically refer to relays, contactors in this paper). However, the implementation of the above-mentioned design requires substantial calculation; consequently, on the premise of guaranteeing precision, how to improve the calculation speed is a problem that needs to be solved. This paper proposes a new method for establishing an approximate model for the EMD. It builds a relationship between the input and output of the EMD with different coil voltages and air gaps, by using a user-defined interpolating function. The coefficient of the fitting function is determined based on a quantum particle swarm optimization (QPSO) method. The effectiveness of the method proposed in this paper is verified by the electromagnetic force calculation results of an electromagnetic relay with permanent magnet.

Mixed $\textrm{H}_2/\textrm{H}_\infty$ Robust Control with Diagonal Structured Uncertainty

  • Bambang, Riyanto;Uchida, Kenko;Shimemura, Etsujiro
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1992.10b
    • /
    • pp.575-580
    • /
    • 1992
  • Mixed H$_{2}$/H$_{\infty}$ robust control synthesis is considered for finite dimensional linear time-invariant systems under the presence of diagonal structured uncertainties. Such uncertainties arise for instance when there is real perturbation in the nominal model of the state space system or when modeling multiple (unstructured) uncertainty at different locations in the feedback loop. This synthesis problem is reduced to convex optimization problem over a bounded subset of matrices as well as diagonal matrix having certain structure. For computational purpose, this convex optimization problem is further reduced into Generalized Eigenvalue Minimization Problem where a powerful algorithm based on interior point method has been recently developed..

  • PDF