• 제목/요약/키워드: Fibonacci search

검색결과 5건 처리시간 0.021초

Maximum Power Point Tracking Control Employing Fibonacci Search Algorithm for Photovoltaic Power Generation System

  • Miyatake Masafumi;Kouno Tooru;Nakano Motomu
    • 전력전자학회:학술대회논문집
    • /
    • 전력전자학회 2001년도 Proceedings ICPE 01 2001 International Conference on Power Electronics
    • /
    • pp.622-625
    • /
    • 2001
  • Photovoltaic generation systems need MPPT (Maximum Power Point Tracking) control because the output power depends on the operating voltage and current. Therefore, many researchers propose various types of MPPT control methods. A new MPPT control scheme is proposed in this paper in order to realize higher efficiency with simple calculation. The line search algorithm with fibonacci sequence which is one of the optimizing method is employed for the MPPT. The line search method is modified for real-time operation. The method is verified by simulations and experiments. It is concluded that the scheme can respond fast variation of irradiance.

  • PDF

히스테리시스 특성을 고려한 전자계의 유한 요소 해석 (Finite Element Analysis of Electromagnetic Systems Considering Hysteresis Characteristics)

  • 김홍규;홍선기;정현교
    • 대한전기학회논문지:전기기기및에너지변환시스템부문B
    • /
    • 제48권3호
    • /
    • pp.118-123
    • /
    • 1999
  • This paper describes the finite element procedure including the magnetic hysteresis phenomena. The magnetization-dependent Preisach model is employed to simulate the magnetic hysteresis and applied to each elements. Magnetization is calculated by the Fibonacci search method for the applied field in the implementation of the magnetization-dependent model. This can calculate the magnetization very accurately with small iteration numbers. The magnetic field intensity and the magnetization corresponding to the magnetic flux density obtained by the finite element analysis(FEA) are computed at the same time under the condition that these balues must satisfy the constitutive equation. In order to reduce the total calculation cost, pseudo-permeability is used for the input for the FEA. It is found that the presented method is very useful in combining the hysteresis model with the finite element method.

  • PDF

Pseudospectra를 이용한 평행 평판 사이 유동에서 가장 불안정한 경우 (The most unstable case in plane Poiseuille flow on transition by using pseudospectra method)

  • 최상규;정명균
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2002년도 학술대회지
    • /
    • pp.691-694
    • /
    • 2002
  • The most unstable situation of laminar plane Poiseuille flow for transition to turbulence is investigated by using a pseudo-spectral method. A number of various disturbance modes are tested and it is found that the flow is the most unstable when it is disturbed by an oblique wave with an angle of $29.7^{\circ}$.

  • PDF

전기자동차 구동용 영구자석형 동기전동기의 온라인 최적 효율제어 (On-Line Optimal Efficiency Control for Permanent Magnet Synchronous Motors Driving electric Vehicles)

  • Chun, Tae-Won
    • 대한전기학회논문지
    • /
    • 제43권4호
    • /
    • pp.586-593
    • /
    • 1994
  • This paper suggests the algorithm for on-line efficiency control of permancent magnet synchronous motors driving the electric vehicles. The existance of unigue d-axis current is verified, which generates the maximum efficiency at operating points of motor. Using the Fibonacci search method, d-axis current converges to the minimization of inverter input power, and to prevent the variation of motor speed in process of the efficiency control, the voltage decoupled control strategy is introduced. Through the experiments, the effects of an efficiency control algorithm are verified.

블록 보간 탐색법 (Block Interpolation Search)

  • 이상운
    • 한국인터넷방송통신학회논문지
    • /
    • 제17권5호
    • /
    • pp.157-163
    • /
    • 2017
  • 데이터 탐색법 중 가장 널리 알려진 이진법은 평균과 최악의 경우 $O(log_2n)$, 보간법은 평균 $O(log_2log_2n)$, 최악의 경우 O(n)의 수행 복잡도를 갖고 있다. 또한 기존의 보간탐색법은 사전정보없이 킷값이 확률적으로 위치한 정보에 근거하여 탐색을 한다. 본 논문에서는 데이터의 MSB 인덱스를 블록으로 하는 블록탐색법으로 해당 블록범위를 결정하고, 블록 내에서는 보간법을 적용하여 탐색하는 하이브리드 블록과 보간탐색 알고리즘을 제안한다. 제안된 알고리즘은 블록탐색법의 사전 정보를 활용하여 탐색범위를 축소시키고 축소된 탐색범위내에서 무정보 방법으로 탐색하는 방법으로 평균과 최악의 경우 모두 수행복잡도는 $O(log_2log_2n_i)$, $n_i{\simeq}0.1n$으로 보간탐색법의 평균 수행복잡도에 비해 10배 정도 시간을 단축시킬 수 있다.