• Title/Summary/Keyword: on line algorithm

Search Result 2,422, Processing Time 0.025 seconds

On-Line Identification Algorithm for Unknown Linear MIMO Systems (미지의 선형 MIMO 시스템에 대한 On-Line 모델링 알고리즘)

  • 최수일;김병국
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.7
    • /
    • pp.58-65
    • /
    • 1994
  • A recursive on-line algorithm for orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters time delay and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursiveform by using new functions of two dimensional autocorrelations and crosscorrelations of inputs and outputs. This proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

  • PDF

On-line identification algorithm for unknown linear MIMO systems (미지의 선형 MIMO 시스템에 대한 On-line 모델링 알고리즘)

  • 최수일;김병국
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.58-63
    • /
    • 1993
  • A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear MIMO systems with unknown parameters, time delay, and order. This algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extended to a recursive form by using new functions of two dimensional autocorrelations and cross-correlations of inputs and outputs. The proposed algorithm can also cope with slowly time-varying or order-varying systems. Various simulations reveal the performance of the algorithm.

  • PDF

A Modified Heuristic Algorithm for the Mixed Model Assembly Line Balancing

  • Lee, Sung-Youl
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.15 no.3
    • /
    • pp.59-65
    • /
    • 2010
  • This paper proposes a modified heuristic mixed model assembly line (MMAL) balancing algorithm that provides consistent station assignments on a model by model basis as well as on a station by station. Basically, some of single model line balancing techniques are modified and incorporated to be fit into the MMAL. The proposed algorithm is based on N.T. Thomopoulos' [8] method and supplemented with several well proven single model line balancing techniques proposed in the literature until recently. Hoffman's precedence matrix [2] is used to indicate the ordering relations among tasks. Arcus' Rule IX [1] is applied to generate rapidly a fairly large number of feasible solutions. Consequently, this proposed algorithm reduces the fluctuations in operation times among the models as well as the stations and the balance delays. A numerical example shows that the proposed algorithm can provide a good feasible solution in a relatively short time and generate relatively better solutions comparing to other three existing methods.

A Study on the Algorithm Detecting DC Line Faults (직류선로 고장 검출 알고리즘에 관한 연구)

  • Kim Chan-Ki
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.9 no.5
    • /
    • pp.498-506
    • /
    • 2004
  • The protection algorithm of DC line grounding for the subway is proposed in this paper. Compared to the conventional protection algorithm, the proposed algorithm has a advantage that can distinguish the difference between service line and faulted line. The contents of the proposed algorithm are by using blocking filter and PLC(Power Line Carrier). Results of the simulation show that the proposed algorithm is very useful.

Optimal Seam-line Determination for the Image Mosaicking Using the Adaptive Cost Transform (적응 정합 값 변환을 이용한 영상 모자이크 과정에서의 최적 Seam-Line 결정)

  • CHON Jaechoon;KIM Hyongsuk
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.54 no.3
    • /
    • pp.148-155
    • /
    • 2005
  • A seam-line determination algorithm is proposed to determine image border-line in mosaicing using the transformation of gray value differences and dynamic programming. Since visually good border-line is the one along which pixel differences are as small as possible, it can be determined in association with an optimal path finding algorithm. A well-known effective optimal path finding algorithm is the Dynamic Programming (DP). Direct application of the dynamic programming to the seam-line determination causes the distance effect, in which seam-line is affected by its length as well as the gray value difference. In this paper, an adaptive cost transform algorithm with which the distance effect is suppressed is proposed in order to utilize the dynamic programming on the transformed pixel difference space. Also, a figure of merit which is the summation of fixed number of the biggest pixel difference on the seam-line (SFBPD) is suggested as an evaluation measure of seamlines. The performance of the proposed algorithm has been tested in both quantitively and visually on various kinds of images.

An Algorithm of Automatic 2D Quadrilateral Mesh Generation with the Line Constraints (라인(line) 제약조건을 가지는 2차원 사각 메쉬의 자동 생성 알고리즘)

  • 김인일;이규열;조두연;김태완
    • Korean Journal of Computational Design and Engineering
    • /
    • v.8 no.1
    • /
    • pp.10-18
    • /
    • 2003
  • FEM (Finite Element Method) is a fundamental numerical analysis technique in wide spread use in engineering application. As the solving time occupies small portion of entire FEM analysis time because of development of hardware, the relative lime to the whole analysis time to make mesh mod-els is growing. In particular, in the case of stiffeners such as features attached to plate in ship structure, the line constraints are imposed on mesh model together with other constraints such as holes. To auto-matically generate two dimensional quadrilateral mesh with the line constraints, an algorithm is pro-posed based on the constrained Delaunay triangulation and Q-Morph algorithm in which the line constraints are not considered. The performance of the proposed algorithm is evaluated. And some numerical results of our proposed algorithm ate presented.

Enhanced Fault Location Algorithm for Short Faults of Transmission Line (1회선 송전선로 단락사고의 개선된 고장점 표정기법)

  • Lee, Kyung-Min;Park, Chul-Won
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.65 no.6
    • /
    • pp.955-961
    • /
    • 2016
  • Fault location estimation is an important element for rapid recovery of power system when fault occur in transmission line. In order to calculate line impedance, most of fault location algorithm uses by measuring relaying waveform using DFT. So if there is a calculation error due to the influence of phasor by DC offset component, due to large vibration by line impedance computation, abnormal and non-operation of fault locator can be issue. It is very important to implement the robust fault location algorithm that is not affected by DC offset component. This paper describes an enhanced fault location algorithm based on the DC offset elimination filter to minimize the effects of DC offset on a long transmission line. The proposed DC offset elimination filter has not need any erstwhile information. The phase angle delay of the proposed DC offset filter did not occurred and the gain error was not found. The enhanced fault location algorithm uses DFT filter as well as the proposed DC offset filter. The behavior of the proposed fault location algorithm using off-line simulation has been verified by data about several fault conditions generated by the ATP simulation program.

A Study on the Gustafson-Kessel Clustering Algorithm in Power System Fault Identification

  • Abdullah, Amalina;Banmongkol, Channarong;Hoonchareon, Naebboon;Hidaka, Kunihiko
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.5
    • /
    • pp.1798-1804
    • /
    • 2017
  • This paper presents an approach of the Gustafson-Kessel (GK) clustering algorithm's performance in fault identification on power transmission lines. The clustering algorithm is incorporated in a scheme that uses hybrid intelligent technique to combine artificial neural network and a fuzzy inference system, known as adaptive neuro-fuzzy inference system (ANFIS). The scheme is used to identify the type of fault that occurs on a power transmission line, either single line to ground, double line, double line to ground or three phase. The scheme is also capable an analyzing the fault location without information on line parameters. The range of error estimation is within 0.10 to 0.85 relative to five values of fault resistances. This paper also presents the performance of the GK clustering algorithm compared to fuzzy clustering means (FCM), which is particularly implemented in structuring a data. Results show that the GK algorithm may be implemented in fault identification on power system transmission and performs better than FCM.

Drive of Induction Motors Using a Pseudo-On-Line Fuzzy-PID Controller Based on Genetic Algorithm

  • Ahn, Taechon;Kwon, Yangwon;Kang, Haksoo
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.2 no.2
    • /
    • pp.85-91
    • /
    • 2000
  • This paper proposes a novel method with pseudo-on-line scheme using the optimized look-up table based on the genetic algorithm which does not use the gradient and finds the global optimum of an un-constraint optimization problem. The technique is a pseudo-on-line method that optimally estimates the parameters of fuzzy PID(FPID) controller for systems with non-linearity, using the genetic algorithm. The proposed controller(GFPID) with the auto-tuning function is applied to the on-line and real-time control of speed at 3-phase induction motor, and its computer simulation is carried out. simulation results show that the proposed methodis more excellent that conventional FPID and PID controllers.

  • PDF

On-Line Identification Algorithm of Unknown Linear Systems (미지의 선형 시스템에 대한 On-Line 모델링 알고리즘)

  • 최수일;김병국
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.31B no.4
    • /
    • pp.48-54
    • /
    • 1994
  • A recursive on-line algorithm with orthogonal ARMA identification is proposed for linear systems with unkonwn time delay, order, and parameters. The algorithm is based on the Gram-Schmidt orthogonalization of basis functions, and extendedto recursive form by using two dimensional autocorrelations and crosscorrelations of input and output with constant data length. The proposed algorith can cope with slowly time-varying or order-varying delayed system. Various simulations reveal the performance of the algorithm.

  • PDF