• Title/Summary/Keyword: constrained nonlinear optimal problem

Search Result 37, Processing Time 0.026 seconds

Optimal Tuning of Linear Servomechanisms using a Disturbance Observer (외란관측기를 이용한 리니어 서보메커니즘의 최적튜닝)

  • Hong, Seong-Hwan;Chung, Sung-Chong
    • Proceedings of the KSME Conference
    • /
    • 2008.11a
    • /
    • pp.926-931
    • /
    • 2008
  • In order to design a high-performance controller with excellent positioning and tracking performance, an optimal tuning method based on the integrated design concept is studied. DOBs, feedforward controllers and CCC are applied to control the bi-axial linear servomechanism. To derive accurate dynamic models of mechanical subsystems equipped with linear servos for the integrated tuning, system identification processes are conducted through the sine sweeping. An optimal tuning problem with stability, robustness and overshoot constraints is formulated as a nonlinear constrained optimization problem. Optimal gains are obtained through the SQP method. Experimental results confirm that both tracking and contouring errors are significantly reduced by applying the proposed controller and integrated tuning method.

  • PDF

Optimal Tuning of Bi-axial Servomechanisms for High-Precision Motion Control (고정밀 운동제어를 위한 2축 서보메커니즘의 최적튜닝)

  • Sung, Chul-Mo;Chung, Sung-Chong
    • Transactions of the Korean Society of Machine Tool Engineers
    • /
    • v.17 no.5
    • /
    • pp.44-51
    • /
    • 2008
  • In this paper, the optimal tuning of a cross-coupled controller linked with the feedforward controller is studied to reduce contouring and tracking errors of a bi-axial servomechanisms by using the previously developed integrated tuning method. The CCC system for an arbitrary curve, which is combined with the feedforward controller, is formulated by a state-space based on a series of linear motion trajectories. An optimal tuning problem is formulated as a nonlinear constrained optimization problem including relevant controller parameters of the servo. To verify the effectiveness of the proposed optimal tuning procedure, linear and circular motion experiments are performed on the xy-table. Experimental results confirm that both tracking and contouring errors are significantly reduced by applying the proposed control and tuning system.

Improved Optimal Approximated Unfolding Algorithm of a Curved Shell Plate with Automatic Mesh Generation (자동 메쉬 생성을 적용한 향상된 자유 곡면의 최적 근사 전개 알고리즘)

  • Ryu C.H.;Shin J.G.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.157-163
    • /
    • 2006
  • Surfaces of many engineering structures, especially, those of ships are commonly made out of either single- or double-curved surfaces to meet functional requirements. The first step in the fabrication process of a three-dimensional design surface is unfolding or flattening the surface, otherwise known as planar development, so that manufacturers can determine the initial flat plate which is required to form the design shape. In this paper, an algorithm for optimal approximated development of a general curved surface, including both single- and double-curved surfaces, is established by minimizing the strain energy of deformation from its planar development to the design surface. The unfolding process is formulated into a constrained nonlinear programming problem, based on the deformation theory and finite element. Constraints are subjected to the characteristics of the fabrication method. And the design surface, or the curved shell plate is subdivided by automatic mesh generation.

The Security Constrained Economic Dispatch with Line Flow Constraints using the Multi PSO Algorithm Based on the PC Cluster System (PC 클러스터 기반의 Multi-HPSO를 이용한 안전도 제약의 경제급전)

  • Jang, Se-Hwan;Kim, Jin-Ho;Park, Jong-Bae;Park, June-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.58 no.9
    • /
    • pp.1658-1666
    • /
    • 2009
  • This paper proposes an approach of Mult_HPSO based on the PC cluster system to reduce or remove the stagnation on an early convergence effect of PSO, reduce an execution time and improve a search ability on an optimal solution. Hybrid PSO(HPSO) is combines the PSO(Particle Swarm Optimization) with the mutation of conventional GA(Genetic Algorithm). The conventional PSO has operated a search process in a single swarm. However, Multi_PSO operates a search process through multiple swarms, which increments diversity of expected solutions and reduces the execution time. Multiple Swarms are composed of unsynchronized PC clusters. We apply to SCED(security constrained economic dispatch) problem, a nonlinear optimization problem, which considers line flow constraints and N-1 line contingency constraints. To consider N-1 line contingency in power system, we have chosen critical line contingency through a process of Screening and Selection based on PI(performace Index). We have applied to IEEE 118 bus system for verifying a usefulness of the proposed approaches.

Optimal Scheduling of Detection and Tracking Parameters in Phased Array Radars (위상배열 레이다 검출 및 추적 매개변수의 최적 스케쥴링)

  • Jung, Young-Hun;Kim, Hyun-Soo;Hong, Sun-Mog
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.36S no.7
    • /
    • pp.50-61
    • /
    • 1999
  • \In this paper, we consider the optimal scheduling of detection and tracking parameters in phased array radars to minimize the radar energy required for track maintenance in a cluttered environment. We develop a mathematical model of target detection induced by a search process in phased array radars. In the mathematical development, we take into account the effect of unwanted measurements that may have originated from clutter or false alarms in the detection process. We use and analytic approximation of the modified Riccati equation of the probabilistic data association (PDA) filter to take into account the effect of clutter interference in tracking. Based on the search process and the tracking models, we formulate the optimal scheduling problem into a nonlinear optimal control problem. We solve a constrained nonlinear optimization problem to obtain the solution of the optimal control problem.

  • PDF

Optimal Design of Reinforced Concrete Frame Structure by Limit State Design Method (LSD에 의한 철근콘크리트 뼈대 구조의 최적설계)

  • 김동희;유홍렬;박문호
    • Magazine of the Korean Society of Agricultural Engineers
    • /
    • v.27 no.4
    • /
    • pp.61-67
    • /
    • 1985
  • This study is concerned with the optimum design of reinforced concrete frame structure with multi-stories and multi-bays by Limit State Design Method aimed to establish a synthetical optimal method that can simultaneously acomplish structural analysis and sectional desig. For optimum solution, the Successive Linear Programming known as effective to nonlinear optimization problem: including both multi-design variables and mulit-constrained condition was applied. The developed algorithm was applied to an actual structure and reached following results. 1)The developed algorithm was rvey effective converging to an optimal solution with 3 to 5 iteration. 2)An optimal solution was showed when bending moment redistribution factor a was 0.80. 3)The column was, regardless of story, controlled by the long column when unbraced, while in case of braced column, it is designed with 3 short column controlled by thrust and bending moment, and the supporting condition had little effect on the optimization results.

  • PDF

Time-optimal Control Utilizing Beural Networks (신경회로망을 이용한 시간최적 제어)

  • Park, W.W.;J.S. Yoon
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.14 no.6
    • /
    • pp.90-98
    • /
    • 1997
  • A time-optimal control law for quick, strongly nonlinear systems has been developed and demonstrated. This procedure involves the utilzation of neural networks as state feedback controllers that learn the time-optimal control actions by means of an iterative minimization of both the final time and the final state error for the systems with constrained inputs and/or states. A neural identifier or a genetic algorithm identifier could be utilized for modeling the partially known systems and the unknown systems. The nature of neural networks as a parallel processor would circumvent the problem of "curwe of dimensionality". The control law has been demonstrated for both a torque input motor and a velocity input motor identified by a genetic algorithm called GENOCOPed GENOCOP.

  • PDF

OPTIMAL IMPACT ANGLE CONSTRAINED GUIDANCE WITH THE SEEKER'S LOCK-ON CONDITION

  • PARK, BONG-GYUN
    • Journal of the Korean Society for Industrial and Applied Mathematics
    • /
    • v.19 no.3
    • /
    • pp.289-303
    • /
    • 2015
  • In this paper, an optimal guidance law with terminal angle constraint considering the seeker's lock-on condition, in which the target is located within the field-of-view (FOV) and detection range limits at the end of the midcourse phase, is proposed. The optimal solution is obtained by solving an optimal control problem minimizing the energy cost function weighted by a power of range-to-go subject to the terminal constraints, which can shape the guidance commands and the missile trajectories adjusting guidance gains of the weighting function. The proposed guidance law can be applied to both of the midcourse and terminal phases by setting the desired relative range and look angle to the final interception conditions. The performance of the proposed guidance law is analyzed through nonlinear simulations for various engagement conditions.

Optimal Tuning of a Ballscrew Driven Biaxial Servo System (외란관측기를 이용한 볼스크류 구동 2축 서보계의 최적튜닝)

  • Shin, Dong-Soo;Chung, Sung-Chong
    • Journal of the Korean Society of Manufacturing Technology Engineers
    • /
    • v.20 no.5
    • /
    • pp.589-597
    • /
    • 2011
  • In this paper, optimal tuning of a cross-coupled controller linked with the feedforward controller and the disturbance observer is studied to improve contouring and tracking accuracy as well as robustness against disturbance. Previously developed integrated design and optimal tuning methods are applied for developing the robust tuning method. Strict mathematical modeling of the multivariable system is formulated as a state-space equation. Identification processes of the servomechanism are conducted for mechanical servo models. An optimal tuning problem to minimize both the contour error and settling time is formulated as a nonlinear constrained optimization problem including the relevant controller parameters of the servo control system. Constraints such as relative stability, robust stability and overshoot, etc. are considered for the optimization. To verify the effectiveness of the proposed optimal tuning procedure, linear and circular motion experiments are performed on the xy-table. Experimental results confirm the control performance and robustness despite the variation of parameters of the mechanical subsystems.

A New Chance-Constrained Programming Approach to Capital Budgeting (확률제약조건계획법(確率制約條件計劃法)을 이용(利用)한 자본예산모형(資本豫算模型))

  • Lee, Ju-Ho
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.6 no.2
    • /
    • pp.21-29
    • /
    • 1980
  • This paper deals with the capital budgeting problem of a firm where investments are risky and interrelated. The established models might be classified into two categories; One is the chance-constrained programming model and the other is the expected utility maximization model. The former has a rather limited objective function and does not consider the risk in direct manner. The latter, on the other hand, might lead to a wrong decision because it uses an approximate value of expected utility. This paper attempts to extend the applicability of the chance-constrained programming model by modifying its objective function into a more general form. The capital budgeting problem is formulated as a nonlinear 0-1 integer programming problem first, and is formulated into a linear 0-1 integer programming problem for finding a lower-bound solution of the original problem. The optimal solution of the original problem is then obtained by branch & bound algorithm.

  • PDF