• Title/Summary/Keyword: constraint feasibility

Search Result 90, Processing Time 0.022 seconds

BPN Based Approximate Optimization for Constraint Feasibility (구속조건의 가용성을 보장하는 신경망기반 근사최적설계)

  • Lee, Jong-Soo;Jeong, Hee-Seok;Kwak, No-Sung
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2007.04a
    • /
    • pp.141-144
    • /
    • 2007
  • Given a number of training data, a traditional BPN is normally trained by minimizing the absolute difference between target outputs and approximate outputs. When BPN is used as a meta-model for inequality constraint function, approximate optimal solutions are sometimes actually infeasible in a case where they are active at the constraint boundary. The paper describes the development of the efficient BPN based meta-model that enhances the constraint feasibility of approximate optimal solution. The modified BPN based meta-model is obtained by including the decision condition between lower/upper bounds of a constraint and an approximate value. The proposed approach is verified through a simple mathematical function and a ten-bar planar truss problem.

  • PDF

Exponential Stability and Feasibility of Receding Horizon Control for Constrained Systems (구속조건이 있는 시스템에 대한 이동구간제어기의 지수 안정성과 실현 가능성)

  • Jae-Won Lee;Wook Hyun Kwon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.5
    • /
    • pp.567-573
    • /
    • 1998
  • 본 논문에서는 입력과 상태변수에 hard constraint가 있는 이산시간 시스템에 대한 새로운 이동구간 제어기를 제안한다. 제안된 이동구간제어기가 terminal ellipsoid constraint를 이용하여 지수 안정성(exponential stability)을 보장함을 보인다. Feasibility를 증가시키기 위하여 시스템을 안정 모드와 불안정 모드로 바꾸는 방법, constraint를 완화하는 방법을 제안한다. Constraint를 완화할 때 constraint를 만족시키지 못하는 부분의 성능을 개선시키는 방법을 제안하고 예제를 통해서 몇 가지 제안한 방법들을 비교한다.

  • PDF

On the Feasibility of Interference Alignment in the Cellular Network

  • Chen, Hua;Wu, Shan;Hu, Ping;Xu, Zhudi
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.11
    • /
    • pp.5324-5337
    • /
    • 2017
  • In this paper, we investigate the feasibility of interference alignment(IA) in signal space in the scenario of multiple cell and multiple user cellular networks, as the feasibility issue is closely related to the solvability of a multivariate polynomial system, we give the mathematical analysis to support the constraint condition obtained from the polynomial equations with the tools of algebraic geometry, and a new distribute IA algorithm is also provided to verify the accessibility of the constraint condition for symmetric system in this paper. Simulation results illustrate that the accessibility of the constraint condition is hold if and only if the degree of freedom(DoF) of each user can be divided by both the transmit and receive antenna numbers.

Robust Optimization of Automotive Seat by Using Constraint Response Surface Model (제한조건 반응표면모델에 의한 자동차 시트의 강건최적설계)

  • 이태희;이광기;구자겸;이광순
    • Proceedings of the Computational Structural Engineering Institute Conference
    • /
    • 2000.04b
    • /
    • pp.168-173
    • /
    • 2000
  • Design of experiments is utilized for exploring the design space and for building response surface models in order to facilitate the effective solution of multi-objective optimization problems. Response surface models provide an efficient means to rapidly model the trade-off among many conflicting goals. In robust design, it is important not only to achieve robust design objectives but also to maintain the robustness of design feasibility under the effects of variations, called uncertainties. However, the evaluation of feasibility robustness often needs a computationally intensive process. To reduce the computational burden associated with the probabilistic feasibility evaluation, the first-order Taylor series expansions are used to derive individual mean and variance of constraints. For robust design applications, these constraint response surface models are used efficiently and effectively to calculate variances of constraints due to uncertainties. Robust optimization of automotive seat is used to illustrate the approach.

  • PDF

Feasibility Determination Procedure with Automatic Control of Tolerance Level (공차 수준 자가 조정 능력을 갖춘 가능해 판별 절차)

  • Lee, Mi Lim
    • Journal of the Korea Society for Simulation
    • /
    • v.25 no.4
    • /
    • pp.85-91
    • /
    • 2016
  • We consider the problem of determining a set of feasible systems when a performance measure in a stochastic constraint needs to be evaluated via simulation. We develop a new procedure that controls tolerance level automatically by using a pair of existing feasibility determination procedures iteratively. When compared to the exiting procedure, the new procedure provides significantly better performance in accuracy and stability, while not depending on the given tolerance level.

A Study of the Value of Travel Time Reliability (통행시간 신뢰성 가치에 관한 연구)

  • Cho, Hanseon
    • International Journal of Highway Engineering
    • /
    • v.15 no.4
    • /
    • pp.155-165
    • /
    • 2013
  • PURPOSES : Benefits for improvement of travel time reliability obtained from construction of new highways should be considered as a major factor in the feasibility study for highway constructions. The purpose of this study is to develop a method of estimation for the value of travel time reliability. METHODS : Highway type (urban/rural highway) and traffic flow type(interrupted/uninterrupted) was considered to estimate he value of travel time reliability. And Double-bounded Dichotomous Choice among Contingent Valuation Method(CVM) was applied to survey the willingness-to-pay of drivers when travel time reliability is improved. Finally the value of travel time reliability was estimated using the results of survey and logit model. The value of travel time reliability was estimated considering travel objectives, time constraint travel and non-time constraint travel. RESULTS: The value of travel time reliability of business trip is higher than that of non-business trip. The value of travel time reliability of time constraint travel is higher than that of non-time constraint travel. The value of travel time reliability in urban area is higher than that in rural area. CONCLUSIONS: It was concluded that the proposed method in this study is more realistic and proper to estimate the value of travel time reliability because it reflects the situations of time constraint travel and non-time constraint travel.

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

  • Bahng, Dane;Choi, Jin-Young
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • 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

Perfect Tracking Control for Linear Systems with State Constraint

  • Baang, Dane;Choi, Jin-Young;Shim, Hyung-Bo
    • International Journal of Control, Automation, and Systems
    • /
    • v.5 no.2
    • /
    • pp.218-222
    • /
    • 2007
  • This paper presents a new Perfect Tracking Control (PTC) scheme for linear systems with state constraint. The proposed controller increases the number of the steps on-line for perfect tracking to satisfy the given ellipsoid-type state constraint. The unavoidable step delay that we impose is minimized by solving LMI feasibility problems and the possible feedback information loss is avoided. The proposed schemes are easy to develop, theoretically simple and clear, and include the conventional PTC as its special case.

맞춤구성을 위한 템플릿과 Option 기반의 추론

  • 이현정;이재규
    • Proceedings of the Korea Inteligent Information System Society Conference
    • /
    • 2002.05a
    • /
    • pp.181-190
    • /
    • 2002
  • 전자 카탈로그 상에서의 상품 검색은 카탈로그에 명시되어 있는 상품을 찾는 표준상품검색과 소비자가 원하는 상품을 맞춤 하는 맞춤상품검색으로 분류할 수 있다. 현재의 대부분의 상품 검색은 표준상품검색에 의존하고 있다. 특히 기업간 구성요소기반(Component-based) 상품의 경우 표준상품검색만으로는 구매자의 다양한 요구에 응하기가 어렵다. 따라서 웹 상의 전자 카탈로그에서의 동적인 맞춤검색에 대한 요구가 증가하고 있다. 본 연구에서는 구성기반 상품에 대해서 표준상품검색만으로는 구매자가 원하는 상품의 검색가능성(Feasibility)과 검색된 대안들이 조정(Adjust) 프로세스 과정을 거쳐 최적해 도달 가능성(Admissibility)이 보장되지 않음을 보이고, 이에 대한 효과적인 방법론으로 검색가능성과 최적해 도달 가능성을 지원하는Template-based Reasoning 방법론을 제안 한다. Template-based Reasoning은 구매자의 요구사항에 따른 대안탐색 부분과 선택된 대안에 대한 조정과정의 두 단계로 이루어진다. 구매자의 주요 선호도(MUST Preference)에 근거하여 대안들을 탐색하고, 탐색 된 대안들 간의 우선순위를 결정한다. 조정 단계에서는 옵션(Options)의 확장을 통해 구매자의 맞춤사양에 따른 상품을 제안하고, 제약 및 규칙기반 추론(Constraint and Rule Satisfaction Approach)을 이용하여 옵션(Options)들 간의 제약조건에 따른 호환성(Compatibility)을 조사하고, 적정가격의 상품을 제안한다. 본 방법론은 Template을 사용하여 기본적으로 구매자가 원하는 상품을 검색하기 위한 검색노력을 줄이고, 검색된 대안들로부터 구매자와 시스템이 웹상에서 서로 상호작용(interactivity) 하여 해를 찾고, 제약조건과 규칙들에 의해 적합한 해를 찾아가는 방법을 제시한다. 본 논문은 구성기반 예로서 컴퓨터 부품조립을 사용해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.

  • PDF