• Title/Summary/Keyword: on line algorithm

Search Result 2,422, Processing Time 0.029 seconds

A Study on Advanced Fault Locating for Short Fault of a Double Circuit Transmission Line (병행 2회선 송전선로의 선간단락시 고장점 표정의 개선에 관한 연구)

  • Park, Yu-Yeong;Park, Chul-Won
    • Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
    • /
    • v.30 no.1
    • /
    • pp.28-37
    • /
    • 2016
  • Fault locating is an important element to minimize the damage of power system. The computation error of fault locator may occur by the influence of the DC offset component during phasor extraction. In order to minimize the bad effects of DC offset component, this paper presents an improved fault location algorithm based on a DC offset removal filter for short fault in a double circuit transmission line. We have modeled a 154kV double circuit transmission line by the ATP software to demonstrate the effectiveness of the proposed fault locating algorithm. The line to line short faults were simulated and then collected simulation data was used. It can be seen that the error rate of fault locating estimation by the proposed algorithm decreases than the error rate of fault locating estimation by conventional algorithm.

Power System State Estimation and Identification in Consideration of Line Switching (선로개폐상태를 포함하는 전력통계 상태추정및 동정)

  • 박영문;유석한
    • 전기의세계
    • /
    • v.28 no.3
    • /
    • pp.57-64
    • /
    • 1979
  • The static state estimation are divided into two groups; estimation and detection & identification. This paper centers on detection and identification algorithm. Especially, the identification of line errors is focused on and is performed by the extended W.L.S. algorithm with line swithching states. Here, line switching states mean the discrete values of line admittance which are influenced by unexpected line switching. The numerical results are obtained from the assumption that the noise vector is independent zero mean Gaussian random variables.

  • PDF

A study on line balancing for serial assembly line (직렬 조립라인의 라인밸런싱에 관한 연구)

  • 장석호;이노성;안인석;박승규;최준열;우광방
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1993.10a
    • /
    • pp.1123-1128
    • /
    • 1993
  • In this paper, utilizing the line balancing algorithm proposed to deal with various situations of automated assembly line, the optimal solution can be derived by the branch and bound method of analysis. By the application of line balancing algorithm to telephone assembly line, thoughput is improved by 3.38%. Therefore, in the proposed line, blicking phenomena were reduced and smooth line-flow was achieved, and uniform distribution of utilization rate of each machine is obtained.

  • PDF

A Study on the Comparison of Line Balancing Algorithms with Theoretical Consideration (이론적인 고찰에 의한 라인 밸런싱 알고리즘의 비교 연구)

  • 강경식;박세영
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.8 no.12
    • /
    • pp.7-12
    • /
    • 1985
  • Line balancing algorithm can be classified by two class, the analytical method and the heuristic method. In this thesis the study was focused on the determinstic line balancing model of the single model production assembly line balancing which is one of the heuristic method. The algorithm of Tonge, Kilbridge & Wester, Helgeson & Birnie which is using the analytical method was examined with one example. And then the algorithms were compared with using line balancing-efficiency, number of work station, standard deviation and range. The result showed that Helgeson & Birnie algorithm is the most convenient in use. A computer program was run in order to use Helgeson & algorithm more conveniently.

  • PDF

Resource Augmentation Analysis on Broadcast Scheduling for Requests with Deadlines (마감시간을 가진 요청들에 대한 브로드캐스트 스케줄링의 자원추가 분석)

  • Kim, Jae-hoon
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.19 no.12
    • /
    • pp.2981-2986
    • /
    • 2015
  • In this paper, there are m servers to carry out broadcasts and the scheduling problem to serve the requests with deadlines is studied. If a server broadcasts a page, then all the requests which require the page are satisfied. A scheduling algorithm shall determine which pages are broadcasted on servers at a time. Its goal is to maximize the sum of weights of requests satisfied within their deadlines. The performance of an on-line algorithm is compared with that of the optimal off-line algorithm which can see all the inputs in advance. In general, the off-line algorithms outperform the on-line algorithms. So we will use the resource augmentation analysis in which the on-line algorithms can utilize more resources. We consider the case that the on-line algorithms can use more servers in this paper.

A Study on an Algorithm of Line Switching and Bus Separation for Alleviating Overloads by the Use of Line Power Tracing and Sensitivity (선로유효전력 Tracing과 민감도를 활용한 선로 과부하 해소 스위칭 및 모선분리 알고리즘에 관한 연구)

  • Lee, Byung-Ha;Hwang, Sung-Ho
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.60 no.11
    • /
    • pp.2007-2016
    • /
    • 2011
  • In this paper, a new algorithm for alleviating overloads in power networks by the use of line power tracing and sensitivity is proposed to perform line switching and bus separation effectively. Also, a new bus separation index based on line power tracing is presented to find the bus to be separated for relieving overloads effectively. By applying the sensitivity of the line flow with respect to the change of the line impedance, both switching-on and switching-off of the lines for alleviating overloads in power networks are performed systematically at once. The number of the considered cases for line switching and bus separation can be greatly reduced and the best combination of line switching and bus separation can be acquired efficiently by the use of the sensitivity and the bus separation index. In order to show the effects of this algorithm, it is applied to a small scale power system of IEEE 39-bus system and practical power systems of KEPCO.

AVM Stop-line Detection based Longitudinal Position Correction Algorithm for Automated Driving on Urban Roads (AVM 정지선인지기반 도심환경 종방향 측위보정 알고리즘)

  • Kim, Jongho;Lee, Hyunsung;Yoo, Jinsoo;Yi, Kyongsu
    • Journal of Auto-vehicle Safety Association
    • /
    • v.12 no.2
    • /
    • pp.33-39
    • /
    • 2020
  • This paper presents an Around View Monitoring (AVM) stop-line detection based longitudinal position correction algorithm for automated driving on urban roads. Poor positioning accuracy of low-cost GPS has many problems for precise path tracking. Therefore, this study aims to improve the longitudinal positioning accuracy of low-cost GPS. The algorithm has three main processes. The first process is a stop-line detection. In this process, the stop-line is detected using Hough Transform from the AVM camera. The second process is a map matching. In the map matching process, to find the corrected vehicle position, the detected line is matched to the stop-line of the HD map using the Iterative Closest Point (ICP) method. Third, longitudinal position of low-cost GPS is updated using a corrected vehicle position with Kalman Filter. The proposed algorithm is implemented in the Robot Operating System (ROS) environment and verified on the actual urban road driving data. Compared to low-cost GPS only, Test results show the longitudinal localization performance was improved.

On-line parameter estimation of continuous-time systems using a genetic algorithm (유전알고리즘을 이용한 연속시스템의 온라인 퍼래미터 추정)

  • Lee, Hyeon-Sik;Jin, Gang-Gyu
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.1
    • /
    • pp.76-81
    • /
    • 1998
  • This paper presents an on-line scheme for parameter estimation of continuous-time systems, based on the model adjustment technique and the genetic algorithm technique. To deal with the initialisation and unmeasurable signal problems in on-line parameter estimation of continuous-time systems, a discrete-time model is obtained for the linear differential equation model and approximations of unmeasurable states with the observable output and its time-delayed values are obtained for the nonlinear state space model. Noisy observations may affect these approximation processes and degrade the estimation performance. A digital prefilter is therefore incorporated to avoid direct approximations of system derivatives from possible noisy observations. The parameters of both the model and the designed filter are adjusted on-line by a genetic algorithm, A set of simulation works for linear and nonlinear systems is carried out to demonstrate the effectiveness of the proposed method.

  • PDF

Error Estimation Method for Matrix Correlation-Based Wi-Fi Indoor Localization

  • Sun, Yong-Liang;Xu, Yu-Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2657-2675
    • /
    • 2013
  • A novel neighbor selection-based fingerprinting algorithm using matrix correlation (MC) for Wi-Fi localization is presented in this paper. Compared with classic fingerprinting algorithms that usually employ a single received signal strength (RSS) sample, the presented algorithm uses multiple on-line RSS samples in the form of a matrix and measures correlations between the on-line RSS matrix and RSS matrices in the radio-map. The algorithm makes efficient use of on-line RSS information and considers RSS variations of reference points (RPs) for localization, so it offers more accurate localization results than classic neighbor selection-based algorithms. Based on the MC algorithm, an error estimation method using artificial neural network is also presented to fuse available information that includes RSS samples and localization results computed by the MC algorithm and model the nonlinear relationship between the available information and localization errors. In the on-line phase, localization errors are estimated and then used to correct the localization results to reduce negative influences caused by a static radio-map and RP distribution. Experimental results demonstrate that the MC algorithm outperforms the other neighbor selection-based algorithms and the error estimation method can reduce the mean of localization errors by nearly half.

A Fast Horizontal line detection algorithm based on edge information (에지 기반 고속 지평선 검출 알고리즘)

  • 나상일;이웅호;서동진;이웅희;정동석
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.199-202
    • /
    • 2003
  • In the research for Unmaned Air Vehicles(UAVs), the use of Vision-sensor has been increased. It is possible to calculate the position information of air vehicle by finding a horizontal line. In this paper, we proposed a vision-based algorithm for finding the horizontal line. Experimental results show that the proposed algorithm is faster than an existing algorithm.

  • PDF