• 제목/요약/키워드: Inequality Constraints

검색결과 166건 처리시간 0.022초

자동차 엔진 밸브 스프링에 사용되는 비원형 스프링 선의 단면 형상 최적화 (Shape Optimization of the Cross Section for a Non-circular Spring Wire of Valve Springs for an Automotive Engine)

  • 김도중;김영경
    • 한국자동차공학회논문집
    • /
    • 제19권2호
    • /
    • pp.117-124
    • /
    • 2011
  • Valve springs with non-circular cross-section are widely used in automotive engines. Because of the reduced height, the oval cross-section provides some merits in its install height and stress distribution. This paper introduces a new method to generate optimal shape of the non-circular cross-section. For given width and height, arbitrary shape of the cross-section are described using the Hermite spline curves. Cross-section area and maximum stress level are chosen as performance indices, and nonlinear optimization problems are formulated with inequality constraints. Compared to a production spring wire, cross-section area can be reduced about 2.4 [%] without increasing maximum stress level. In addition, the other approach gives an optimum cross-section which reduces maximum stress level of 2.0 [%] without increasing cross-section area.

A numerical method for the limit analysis of masonry structures

  • Degl'Innocenti, Silvia;Padovani, Cristina
    • Structural Engineering and Mechanics
    • /
    • 제18권1호
    • /
    • pp.1-20
    • /
    • 2004
  • The paper presents a numerical method for the limit analysis of structures made of a rigid no-tension material. Firstly, we formulate the constrained minimum problem resulting from the application of the kinematic theorem, which characterizes the collapse multiplier as the minimum of all kinematically admissible multipliers. Subsequently, by using the finite element method, we derive the corresponding discrete minimum problem in which the objective function is linear and the inequality constraints are linear as well as quadratic. The method is then applied to some examples for which the collapse multiplier and a collapse mechanism are explicitly known. Lastly, the solution to the minimum problem calculated via numerical codes for quadratic programming problems, is compared to the exact solution.

고장용량 감소를 위한 송전선 개방 운용에 신경회로망 적용 연구 (Neural Network Application to the T/L Operation for Suppression of Short Circuit Capacity)

  • 이광호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권1호
    • /
    • pp.26-30
    • /
    • 2000
  • Switching of the transmission lines(T/L) is one of the methods for wuppressing the short circuit capacity. This paper presents the T/L switching operation by using the Hopfield neural network(HNN). The switching of T/L can make the line powers and the bus voltages deteriorated, as well as the fault current decreased. Such an insecure state should be avoided when the T/L is operated to be open. In this studies, the inequality constraints are formulated into the objective function to be incorporated with the HNN. Test results show that the convergence characteristics of HNN lead to the adequate solution of T/L switching.

  • PDF

A dual approach to input/output variance constrained control problem

  • Kim, Jac-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1994년도 Proceedings of the Korea Automatic Control Conference, 9th (KACC) ; Taejeon, Korea; 17-20 Oct. 1994
    • /
    • pp.28-33
    • /
    • 1994
  • An optimal controller, e.g. LQG controller, may not be realistic in the sense that the required control power may not be achieved by existing actuators, and the measured output is not satisfactory. To be realistic, the controller should meet such constraints as sensor or actuator limitation, performance limit, etc. In this paper, the lnput/Output Variance Constrained (IOVC) control problem will be considered from the viewpoint of mathematical programming. A dual version shall be developed to solve the IOVC control problem, whose objective is to find a stabilizing control law attaining a minimum value of a quadratic cost function subject to the inequality constraint on each input and output variance for a stabilizable and detectable plant. One approach to the constrained optimization problem is to use the Kuhn-Tucker necessary conditions for the optimality and to seek an optimal point by an iterative algorithm. However, since the algorithm uses only the necessary conditions, the convergent point may not be optimal solution. Our algorithm will guarantee a sufficiency.

  • PDF

정합조건을 만족시키지 않는 불확실한 시스템을 위한 선형 슬라이딩 평면의 LMI 매개변수화 (LMI Parameterization of Lineny Sliding Surfaces for Mismatched Uncertain Systems)

  • 이재관;최한호
    • 제어로봇시스템학회논문지
    • /
    • 제11권11호
    • /
    • pp.907-912
    • /
    • 2005
  • In this paper, we consider the problem of designing sliding surfaces fur a class of dynamic systems with mismatched uncertainties in the state space model. In terms of LMIs, we give necessary and sufficient conditions fir the existence of a linear sliding surface such that the reduced order sliding mode dynamics is asymptotically stable and completely independent of uncertainties. We parameterize all such linear sliding surfaces by using the solution to the given LMI conditions. And, we consider the problem of designing linear sliding surfaces guaranteeing pole placement constraints or $H_2/H_infty$ performances. Finally, we give a design example in order to show the effectiveness of our method.

Repetitive Periodic Motion Planning and Directional Drag Optimization of Underwater Articulated Robotic Arms

  • Jun Bong-Huan;Lee Jihong;Lee Pan-Mook
    • International Journal of Control, Automation, and Systems
    • /
    • 제4권1호
    • /
    • pp.42-52
    • /
    • 2006
  • In order to utilize hydrodynamic drag force on articulated robots moving in an underwater environment, an optimum motion planning procedure is proposed. The drag force acting on cylindrical underwater arms is modeled and a directional drag measure is defined as a quantitative measure of reaction force in a specific direction in a workspace. A repetitive trajectory planning method is formulated from the general point-to-point trajectory planning method. In order to globally optimize the parameters of repetitive trajectories under inequality constraints, a 2-level optimization scheme is proposed, which adopts the genetic algorithm (GA) as the 1st level optimization and sequential quadratic programming (SQP) as the 2nd level optimization. To verify the validity of the proposed method, optimization examples of periodic motion planning with the simple two-link planner robot are also presented in this paper.

스마트 스페이스를 위한 난방, 환기 및 공기조화 시스템의 지능형 디지털 제어 (Intelligent Digital Control of Heating, Ventilating, and Air Conditioning System for Smart Space)

  • 김도완;박진배;주영훈
    • 제어로봇시스템학회논문지
    • /
    • 제13권4호
    • /
    • pp.365-370
    • /
    • 2007
  • This paper studies an automation problem of a heating, a ventilating, and an air conditioning (HVAC) for the development of smart space. The HVAC system is described by the fuzzy system for the stability analysis and the controller design. The linear matrix inequalities (LMIs) conditions are derived for the stabilization problem of the closed-loop system under the analog control. Also, it is required to digitally redesign the pre-designed the analog HVAC control system in order to accomplish the remote control via web. It is shown the this digital redesign problem can be converted to the convex optimization problem with the LMI constraints. An example is provided to show the effectiveness of the proposed method.

입찰함수에 의한 전력거래에서의 최적조류 계산에 의한 혼잡비용 처리연구 (A Study on the Congestion Management by OPF in the Electricity Power Market with the Bidding Function)

  • 김광호;정재옥
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제49권8호
    • /
    • pp.374-379
    • /
    • 2000
  • The nodal marginal cost and the congestion charge are used as the econimic signals for the electricity price and new invetments in deregulated power systems. In this paper, the nodal marginal cost and the congestion charge are calculated by using the shadow prices resulted from the calculation of Optimal Power Flow(OPF). Linearization of inequality constraints and piecewise linear cost functions make an OPF problem LP-based forms. In order to use the shadow price, the Interior Point(IP) algorithm is applied as a solution technique to the formulation. This paper proposes an algorithm to determine efficients initial points which are guaranteed to be interior points.

  • PDF

홉필드 신경회로망을 이용한 배전계통계획의 최적 경로 탐색 (Optimal Routing of Distribution System Planning using Hopfield Neural Network)

  • 김대욱;이명환;김병섭;신중린;채명석
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1999년도 하계학술대회 논문집 C
    • /
    • pp.1117-1119
    • /
    • 1999
  • This paper presents a new approach for the optimal routing problem of distribution system planning using the well known Hopfield Neural Network(HNN) method. The optimal routing problem(ORP) in distribution system planning(DSP) is generally formulated as combinational mixed integer problem with various equality and inequality constraints. For the exceeding nonlinear characteristics of the ORP most of the conventional mathematical methods often lead to a local minimum. In this paper, a new approach was made using the HNN method for the ORP to overcome those disadvantages. And for this approach, a appropriately designed energy function suited for the ORP was proposed. The proposed algorithm has been evaluated through the sample distribution planning problem and the simulation results are presented.

  • PDF

Robust Evolutionary Programming Technique for Optimal Control Problems

  • Park, C.;Lee, T.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.50.2-50
    • /
    • 2001
  • Optimal control problems are notoriously difficult to solve either analytically or numerically except for limited cases of having simple dynamics. Evolutionary programming is a promising method of solving various optimal control problem arising in practice since it does not require the expression of Lagrange´s adjoint system and that it can easily implement the inequality constraints on the control variable, In this paper, evolutionary programming is combined with spline method, so the smoother control profile and the Jumping times could be obtained. The optimal profiles obtained by the proposed method are compared with exact solution if it is available. With more complicated model equation, the proposed method showed better performance than other researchers´. It is demonstrated that the evolutionary programming with spline method can ...

  • PDF