• 제목/요약/키워드: optimal algorithm

검색결과 6,798건 처리시간 0.04초

최적 다변수 $H_{\infty}$ 제어 시스템의 설계를 위한 GA의 적용 (Application of GA to Design on Optimal Multivariable $H_{\infty}$ Control System)

  • 황현준;김동완;정호성;박준호;황창선
    • 제어로봇시스템학회논문지
    • /
    • 제5권3호
    • /
    • pp.257-266
    • /
    • 1999
  • The aim of this paper is to suggest a design method of the optimal multivariable $H_{\infty}$ control system using genetic algorithm (GA). This $H_{\infty}$ control system is designed by applying GA to the optimal determination of weighting functions and design parameter $\gamma$ that are given by Glover-Doyle algorithm which can design $H_{\infty}$ controller in the state space. The first method to do this is that the gains of weighting functions and $\gamma$ are optimized simultaneously by GA with tournament method. And the second method is that not only the gains and $\gamma$ but also the dynamics of weighting functions are optimized at the same time by eA with roulette-wheel method. The effectiveness of this $H_{\infty}$ control system is verified by computer simulation.

  • PDF

설계민감도 해석을 이용한 정전소자의 형상최적화 (OPTIMAL SHAPE DESIGN OF ELECTROSTATIC DEVICES USING DESIGN SENSITIVITY ANALYSIS)

  • 고창섭;정현교;한송엽
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 1991년도 하계학술대회 논문집
    • /
    • pp.93-96
    • /
    • 1991
  • This paper describes a new algorithm based on design sensitivity analysis for optimal shape design of electrostatic devices. The design sensitivity, the variation of the object function with respect to the design variables, is derived by using implicit differentiation and direct boundary element methods. The proposed algorithm is applied to the optimal shape design of a concentric cable and the rod electrode enclosed by earthed case, It is shown, from the numerical results, that the algorithm is very usefull for the optimal shape design of the electrostatic devices.

  • PDF

수송 네트워크에서 최대 물동량 경로문제의 근사해법 (A Heuristic Algorithm for Maximum Origin-Destination Flow Path in the Transportation Network)

  • 성기석;박순달
    • 대한산업공학회지
    • /
    • 제16권2호
    • /
    • pp.91-98
    • /
    • 1990
  • This paper studies a heuristic method for the Maximum Origin-Destination Flow Path (MODFP) in an acyclic transportation network. We construct a mathematical formulation for finding the MODFP. Then by applying Benders' partitioning method, we generate two subproblems which should be solved in turn so that they may give an optimal solution. We solve one subproblem by an optimal seeking algorithm and the other by a hueristic method. so that, we finally obtain a good solution. The computational complexity of calculating the optimal solution of the first subproblem is 0(mn) and that of calculating the heuristic solution of the other subproblem is $0(n^2).$ From the computational experiments, we estimated the performance of the heuristic method as being 99.3% and the computing time relative to optimal algorithm as being 28.76%.

  • PDF

Optimal Power Flow of DC-Grid Based on Improved PSO Algorithm

  • Liu, Xianzheng;Wang, Xingcheng;Wen, Jialiang
    • Journal of Electrical Engineering and Technology
    • /
    • 제12권4호
    • /
    • pp.1586-1592
    • /
    • 2017
  • Voltage sourced converter (VSC) based direct-current (DC) grid has the ability to control power flow flexibly and securely, thus it has become one of the most valid approaches in aspect of large-scale renewable power generation, oceanic island power supply and new urban grid construction. To solve the optimal power flow (OPF) problem in DC grid, an adaptive particle swarm optimization (PSO) algorithm based on fuzzy control theory is proposed in this paper, and the optimal operation considering both power loss and voltage quality is realized. Firstly, the fuzzy membership curve is used to transform two objectives into one, the fitness value of latest step is introduced as input of fuzzy controller to adjust the controlling parameters of PSO dynamically. The proposed strategy was applied in solving the power flow issue in six terminals DC grid model, and corresponding results are presented to verify the effectiveness and feasibility of proposed algorithm.

2차원 공간에서의 휴리스틱 배치 알고리즘 및 구현에 관한 연구 (A Study and Implementation of the Heuristic Autonesting Algorithm in the 2 Dimension Space)

  • 양성모;임성국;고석호;김현정;한관희
    • 한국CDE학회논문집
    • /
    • 제4권3호
    • /
    • pp.259-268
    • /
    • 1999
  • In order to reduce the cost of product and save the processing time, optimal nesting of two-dimensional part is an important application in number of industries like shipbuilding and garment making. There have been many studies on finding the optimal solution of two-dimensional nesting. The problem of two-dimensional nesting has a non-deterministic characteristic and there have been various attempts to solve the problem by reducing the size of problem rather than solving the problem as a whole. Heuristic method and linearlization are often used to find an optimal solution of the problem. In this paper, theoretical and practical nesting algorithm for rectangular, circular and irregular shape of two-dimensional parts is proposed. Both No-Fit-Polygon and Minkowski-Sum are used for solving the overlapping problem of two parts and the dynamic programming technique is used for reducing the number search spae in order to find an optimal solution. Also, nesting designer's expertise is complied into the proposed algorithm to supplement the heuristic method.

  • PDF

시간논리구조에서 이산사건시스템의 최적화 및 추론 (Optimization and reasoning for Discrete Event System in a Temporal Logic Frameworks)

  • 황형수;정용만
    • 한국지능시스템학회논문지
    • /
    • 제7권2호
    • /
    • pp.25-33
    • /
    • 1997
  • A DEDS is a system whose states change in response to the occurence of events from a predefined event set. In this paper, we consider the optimal control and reasoning problem for Discrete Event Systems(DES) in the Temporal Logic Framework(TEL) which have been recnetly defined. The TLE is enhanced with objective functions(event cost indices) and a measurement space is alos deined. A sequence of event which drive the system form a give initial state to a given final state is generated by minimizing a cost functioin index. Our research goal is the reasoning of optimal trajectory and the design of the optimal controller for DESs. This procedure could be guided by the heuristic search methods. For the heuristic search, we suggested the Stochastic Ruler algorithm, instead of the A algorithm with difficulties as following ; the uniqueness of solutions, the computational complexity and how to select a heuristic function. This SR algorithm is used for solving the optimal problem. An example is shown to illustrate our results.

  • PDF

Three Dimensional Aerial Combat Simulation

  • Choi, Gi-Sang;Unhavanich, SumaLee
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2001년도 ICCAS
    • /
    • pp.90-90
    • /
    • 2001
  • This paper deals with the development of a practical control system or an algorithm for optimal aerobatic maneuvers and aerial combat maneuvers. First, a nonlinear flight trajectory tracking control system is synthesized and used to realize the optimal aerobatic maneuver. Some simulation results show that the trajectory achieved with the proposed tracking system is close to the optimal one. This means that the tracking system presented is the practical and effective method to realize the optimal aerobatic maneuvers. Second, the algorithm for a fighter in air combat is presented. This is a simple algorithm that uses a proportional navigation, some dynamic rules based on the conservation of specific energy and some experiential rules in air combat. However ...

  • PDF

발전용 최적 Soot Blowing 시스템 개발 (The Development of Optimal Soot Blowing System for Power Plant)

  • 김성호;정해원;육심균
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 추계학술대회논문집B
    • /
    • pp.897-902
    • /
    • 2001
  • SBOS(Soot blower Optimum System) analyzes the accumulated fouling rate of a coal-fired boiler plant at short intervals, compares it with a reference data, and determines the optimal time of soot blowing. In this paper, ANFIS algorithm which is an optimal algorithm to detect variation of boiler performance with time, updating the reference data and to eliminate the effects of noise in field signal is used to clean heating surface and to reduce steam needed to blow the soot.

  • PDF

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

  • Park, W.W.;J.S. Yoon
    • 한국정밀공학회지
    • /
    • 제14권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

Advanced controller design for AUV based on adaptive dynamic programming

  • Chen, Tim;Khurram, Safiullahand;Zoungrana, Joelli;Pandey, Lallit;Chen, J.C.Y.
    • Advances in Computational Design
    • /
    • 제5권3호
    • /
    • pp.233-260
    • /
    • 2020
  • The main purpose to introduce model based controller in proposed control technique is to provide better and fast learning of the floating dynamics by means of fuzzy logic controller and also cancelling effect of nonlinear terms of the system. An iterative adaptive dynamic programming algorithm is proposed to deal with the optimal trajectory-tracking control problems for autonomous underwater vehicle (AUV). The optimal tracking control problem is converted into an optimal regulation problem by system transformation. Then the optimal regulation problem is solved by the policy iteration adaptive dynamic programming algorithm. Finally, simulation example is given to show the performance of the iterative adaptive dynamic programming algorithm.