• Title/Summary/Keyword: constraint programming

Search Result 262, Processing Time 0.026 seconds

Evolutionary Design for Multi-domain Engineering System - Air Pump

  • Seo, Ki-Sung
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2005.11a
    • /
    • pp.323-326
    • /
    • 2005
  • This paper introduces design method for air pump system using bond graph and genetic programming to maximize outflow subject to a constraint specifying maximum power consumption. The air pump system is a mixed domain system which includes electromagnetic, mechanical and pneumaticelements. Therefore an appropriate approach for a better system for synthesis is required. Bond graphs are domain independent, allow free composition, and are efficient for classification and analysis of models, Genetic programming is well recognized as a powerful tool for open-ended search. The combination of these two powerful methods for evolution of multi-domain system, BG/GP, was tested for redesign of air pump system.

  • PDF

ON NONLINEAR PROGRAMMING WITH SUPPORT FUNCTIONS

  • Husain, I.;Abha;Jabeen, Z.
    • Journal of applied mathematics & informatics
    • /
    • v.10 no.1_2
    • /
    • pp.83-99
    • /
    • 2002
  • Optimality conditions are derived for a nonlinear program in which a support function appears in the objective as well as in each constraint function. Wolfe and Mond-Weir type duals to this program are presented and various duality results are established under suitable convexity and generalized convexity assumptions. Special cases that often occur in the literature are those in which a support function is the square root of a positive semi- definite quadratic form or an Lp norm. It is pointed out that these special cases can easily be generated from our results.

Study on the Optimal Posture for Redundant Robot Manipulators Based on Decomposed Manipulability (분리된 조작도를 이용한 여유자유도 로봇의 최적 자세에 관한 연구)

  • 이지홍;원경태
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.5 no.3
    • /
    • pp.249-256
    • /
    • 1999
  • The conventional robot manipulability is decomposed into linear manipulability and angular manipulability so that they may be analysed and visualized in easy way even in the case of 3 dimensional task space with 6 variables. After the Jacobian matrix is decomposed into linear part and angular part, constraint on joint velocities is transformed into linear task velocity and angular task velocity through the decomposed Jacobian matrices. Under the assumption of redundant robot manipulators, several optimization problems which utilize the redundancy are formulated to be solved by linear programming technique or sequential quadratic programming technique. After deriving the solutions of the optimization problems, we give graphical interpretations for the solutions.

  • PDF

Structural Topology Optimization for the Natural Frequency of a Designated Mode

  • Lim, O-Kaung;Lee, Jin-Sik
    • Journal of Mechanical Science and Technology
    • /
    • v.14 no.3
    • /
    • pp.306-313
    • /
    • 2000
  • The homogenization method and the density function method are common approaches to evaluate the equivalent material properties for design cells composed of matter and void. In this research, using a new topology optimization method based on the homogenized material with a penalty factor and the chessboard prevention strategy, we obtain the optimal layout of a structure for the natural frequency of a designated mode. The volume fraction of nodes of each finite element is chosen as the design variable and a total material usage constraint is imposed. In this paper, the subspace method is used to evaluate the eigenvalue and its corresponding eigenvector of the structure for the designated mode and the recursive quadratic programming algorithm, PLBA algorithm, is used to solve the topology optimization problem.

  • PDF

Tunnel Barrier Engineering for Non-Volatile Memory

  • Jung, Jong-Wan;Cho, Won-Ju
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • v.8 no.1
    • /
    • pp.32-39
    • /
    • 2008
  • Tunnel oxide of non-volatile memory (NVM) devices would be very difficult to downscale if ten-year data retention were still needed. This requirement limits further improvement of device performance in terms of programming speed and operating voltages. Consequently, for low-power applications with Fowler-Nordheim programming such as NAND, program and erase voltages are essentially sustained at unacceptably high levels. A promising solution for tunnel oxide scaling is tunnel barrier engineering (TBE), which uses multiple dielectric stacks to enhance field-sensitivity. This allows for shorter writing/erasing times and/or lower operating voltages than single $SiO_2$ tunnel oxide without altering the ten-year data retention constraint. In this paper, two approaches for tunnel barrier engineering are compared: the crested barrier and variable oxide thickness. Key results of TBE and its applications for NVM are also addressed.

Analysis of an Inverse Heat Conduction Problem Using Maximum Entropy Method (최대엔트로피법을 이용한 역열전도문제의 해석)

  • Kim, Sun-Kyoung;Lee, Woo-Il
    • Proceedings of the KSME Conference
    • /
    • 2000.04b
    • /
    • pp.144-147
    • /
    • 2000
  • A numerical method for the solution of one-dimensional inverse heat conduction problem is established and its performance is demonstrated with computational results. The present work introduces the maximum entropy method in order to build a robust formulation of the inverse problem. The maximum entropy method finds the solution that maximizes the entropy functional under given temperature measurement. The philosophy of the method is to seek the most likely inverse solution. The maximum entropy method converts the inverse problem to a non-linear constrained optimization problem of which constraint is the statistical consistency between the measured temperature and the estimated temperature. The successive quadratic programming facilitates the maximum entropy estimation. The gradient required fur the optimization procedure is provided by solving the adjoint problem. The characteristic feature of the maximum entropy method is discussed with the illustrated results. The presented results show considerable resolution enhancement and bias reduction in comparison with the conventional methods.

  • PDF

Application of Dynamic Programming to Optimization of a System Reliability

  • Sok, Yong-U
    • Journal of the military operations research society of Korea
    • /
    • v.24 no.2
    • /
    • pp.130-145
    • /
    • 1998
  • This paper is concerned with the optimization of a system reliability. Two kinds of the reliability model for optimal allocation of parallel redundancy are considered. The algorithm for solving the optimal redundancy problem is proposed by the use of dynamic programming(DP) method. The problem is approached with a standard DP formulation and the DP algorithm is applied to the model and then the optimal solution is found by the backtracking method. The method is applicable to the models having no constraints or having a cost constraint subject to a specified minimum requirement of the system reliability. A consequence of this study is that the developed computer program package are implemental for the optimization of the system reliability.

  • PDF

A New Solution for Stochastic Optimal Power Flow: Combining Limit Relaxation with Iterative Learning Control

  • Gong, Jinxia;Xie, Da;Jiang, Chuanwen;Zhang, Yanchi
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.1
    • /
    • pp.80-89
    • /
    • 2014
  • A stochastic optimal power flow (S-OPF) model considering uncertainties of load and wind power is developed based on chance constrained programming (CCP). The difficulties in solving the model are the nonlinearity and probabilistic constraints. In this paper, a limit relaxation approach and an iterative learning control (ILC) method are implemented to solve the S-OPF model indirectly. The limit relaxation approach narrows the solution space by introducing regulatory factors, according to the relationship between the constraint equations and the optimization variables. The regulatory factors are designed by ILC method to ensure the optimality of final solution under a predefined confidence level. The optimization algorithm for S-OPF is completed based on the combination of limit relaxation and ILC and tested on the IEEE 14-bus system.

Fast Object Recognition using Local Energy Propagation from Combination of Saline Line Groups (직선 조합의 에너지 전파를 이용한 고속 물체인식)

  • 강동중
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2000.10a
    • /
    • pp.311-311
    • /
    • 2000
  • We propose a DP-based formulation for matching line patterns by defining a robust and stable geometric representation that is based on the conceptual organizations. Usually, the endpoint proximity and collinearity of image lines, as two main conceptual organization groups, are useful cues to match the model shape in the scene. As the endpoint proximity, we detect junctions from image lines. We then search for junction groups by using geometric constraint between the junctions. A junction chain similar to the model chain is searched in the scene, based on a local comparison. A Dynamic Programming-based search algorithm reduces the time complexity for the search of the model chain in the scene. Our system can find a reasonable matching, although there exist severely distorted objects in the scene. We demonstrate the feasibility of the DP-based matching method using both synthetic and real images.

  • PDF

A Study on Ammunition Resupply Allocation Model (전시탄약 재보급 할당에 관한 연구)

  • Lee Young-Shin
    • Journal of the military operations research society of Korea
    • /
    • v.30 no.2
    • /
    • pp.133-140
    • /
    • 2004
  • In this paper, with the limited range of ammunition supply point(ASP) at ammunition battalion in specific corps and light automobile battalion(LAB) directly supports its vehicle for ammunition supply, we propose optimal model to minimize transportation time and logistics cost using integer programming(IP) for efficient ammunition resupply allocation during a given operation period of front combat unit. And then, we consider ammunition treatment and supply capacity of ammunition supply point(ASP), constraint elements of transportation ability considering time and cost, ammunition storage capacity of combat unit, combat situation and unit mission to propose this model. Finally, through numerical example, we examine the applicable feasibility of proposed model.