• 제목/요약/키워드: The Constraint Programming

검색결과 260건 처리시간 0.019초

Evolutionary Design for Multi-domain Engineering System - Air Pump

  • 서기성
    • 한국지능시스템학회:학술대회논문집
    • /
    • 한국퍼지및지능시스템학회 2005년도 추계학술대회 학술발표 논문집 제15권 제2호
    • /
    • 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

Tunnel Barrier Engineering for Non-Volatile Memory

  • Jung, Jong-Wan;Cho, Won-Ju
    • JSTS:Journal of Semiconductor Technology and Science
    • /
    • 제8권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.

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

  • 이영신
    • 한국국방경영분석학회지
    • /
    • 제30권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.

최적 제어 이론을 사용한 비행 경로 선정 (Determination of flight route using optimal control theory)

  • 김을곤
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
    • /
    • pp.407-411
    • /
    • 1992
  • A method for optimal route planning is presented with the assumption that the overall defended area is known in terms of threat potential function. This approach employes tangent plane to reduce the dimension of the state space for optimal programming problems with a state equality constraint. One-dimensional search algorithm is used to select the optimal route among the extermal fields which are obtained by integrating three differential equations from the initial values. In addition to being useful for the route planning through threat potential area, the trajectory planning will be suitable for general two-dimensional searching problems.

  • PDF

슬라이딩모드 제어 기법을 이용한 구조-제어 시스템의 통합 최적 설계 (Combined Optimal Design of Structure-Control Systems by Sliding Mode Control)

  • 박중현
    • 한국정밀공학회지
    • /
    • 제19권10호
    • /
    • pp.45-51
    • /
    • 2002
  • To achieve the lightweight and robust design of a structure, it is requested to design a structure and its control system simultaneously, which is called as the combined optimal design. A constant-cross-sectional area cantilever beam was chosen as an example for the applying the optimum design method. An initial load and a time varying disturbance were applied at the free end of the beam. Sliding mode control was selected due to its insensitiveness to the disturbance compared with other modes. It is known that the sliding mode control is robust to the disturbance and the uncertainty only if a matching condition is met, after giving a switching hyper plane. In this study, the optimum method was used for the design of the switching hyper plane and the objective function of the optimum switching hyper plane was assumed to be the objective one of the control system. The total weight of the structure was treated as a constraint and the cross sectional areas of the beam were considered as design variables, which means a nonlinear programming problem. The sequential linear programming method was applied to solve it. As a result of the optimum design, the effect of attenuating vibrations has been improved obviously. Moreover, lightweight design of the structure became possible from the relationship of the weight of the structure and the control objective function.

Combined Optimal Design of Flexible Beam with Sliding Mode Control System

  • Park, Jung-Hyen;Kim, Soon-Ho
    • 한국해양공학회지
    • /
    • 제17권4호
    • /
    • pp.59-65
    • /
    • 2003
  • In order to achieve the desired lightweight and robust design of a structure, it is preferable to design a structure and its control system, simultaneously, which is termed the combined optimal design. A constant-cross-sectional area cantilever beam was chosen as the optimum design method, An initial load and a time-varying disturbance were applied at the free end of the beam. Sliding mode control was selected, due to its insensitivity to the disturbance, compared with other modes. It is known that the sliding mode control is robust to the disturbance and is uncertain, only if a matching condition is met, after giving a switching hyper plane. In this study, the optimum method was used for the design of the switching hyper plane, and the objective function of the optimum switching hyper plane was assumed to be the objective of the control system. The total weight of the structure was treated as a constraint, and the cross sectional areas of the beam were considered as design variables, the result being a nonlinear programming problem. To solve it, the sequential linear programming method was applied. As a result of the optimum design, the effect of attenuating vibrations has been substantially improved. Moreover, the lightweight design of the structure became possible as a result of the relationship of the weight of the structure to the control objective function.

PSEUDO-RELIABILITY MODEL OF COMBAT TANK SYSTEM

  • Lie, Chang-Hoon
    • 한국국방경영분석학회지
    • /
    • 제3권1호
    • /
    • pp.137-150
    • /
    • 1977
  • The effectiveness of an actual combat tank system is analyzed. A measure of effectiveness which includes performance and reliability called pseudo-reliability is introduced. A model is introduced to optimize the design of the system in which the system pseudo-reliability is maximized subject to cost constraint. This model is a nonlinear programming problem and is solved by the sequential unconstrained minimization technique (SUMT). A numerical exampl with actual data from the test evaluation of five combat tanks is used to illustrate the model.

  • PDF

철강 공정의 일정계획을 위한 혼합정수계획 모델 (Mixed-Integer programming model for scheduling of steelmaking processes)

  • 복진광;이동엽;박선원
    • 제어로봇시스템학회논문지
    • /
    • 제5권6호
    • /
    • pp.714-723
    • /
    • 1999
  • This paper presents a short-term scheduling algorithm for the operation of steelmaking processes. The scope of the problem covers refining of the hot iron transferred form a blast furnace, ladle treatment, continuous casting, hot-rolling, and coiling for the final products that should satisfy the given demand. The processing time at each unit depends on how much the batch amount is treated, and te dedicated intermediate storage with finite capacity between the units is considered. Resource constraints and initial amount of each state are incorporated into the presented scheduling model for the algorithm of on-line scheduling. We propose amixed integer linear programming (MILP) model with two objectives for the scheduling. The first is to maximize the total profit while atisfying the due date constraint for each product. And the second is to minimize the total processing time, makespan, while satisfying the demand for each product. Especially, we observe the effect of penalizing the intermediate storage and the inventory level of the final product on the scheduling results.

  • PDF

A Form-finding Technique for Three-dimensional Spatial Structures

  • Lee, Sang Jin
    • Architectural research
    • /
    • 제15권4호
    • /
    • pp.207-214
    • /
    • 2013
  • A form-finding technique is proposed for three-dimensional spatial structures. Two-step discrete finite element (FE) mesh generator based on computer aided geometric design (CAGD) is introduced and used to control the shape of three-dimensional spatial structures. Mathematical programming technique is adopted to search new forms (or shapes) of spatial structures. For this purpose, the strain energy is introduced as the objective function to be minimized and the initial volume (or the initial weight) is considered as constraint function. Numerical examples are carried out to test the capability of the proposed form-finding techniques and provided as benchmark tests.

LMI 가능성 문제를 위한 타원 알고리즘의 개선 (An improved ellipsoid algorithm for LMI feasibility problems)

  • 방대인;최진영
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2002년도 합동 추계학술대회 논문집 정보 및 제어부문
    • /
    • pp.188-192
    • /
    • 2002
  • The ellipsoid algorithm solves some feasibility(or optimization) problems with LMI(Linear Matrix Inequality) constraint in polynomial time. Recently, it has been replaced by interior point algorithm due to its slow convergence and incapability of verifying feasibility. This paper proposes a method to improve its convergence by using the deep-cut method of linear programming. Simulation results show that the improved algorithm is more effective than the original one.

  • PDF