• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.49-51
• /
• 2000

This paper presents a fault location algorithm for single-phase-to-ground faults on the teed circuit of a parallel transmission line. This algorithm uses only local end voltage and current information. Remote end and fault currents are calculated by using distribution factors. To reduce load current effect, negative sequence current is used. EMTP simulation result have shown effectiveness of the algorithm under various conditions.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1991.06a
• /
• pp.38-41
• /
• 1991

RLS algorithms are required for applications to adaptive line enhancers, adaptive equalizers for voiceband telephone and HF modems, and wide-badn digital spectrum mobile raio in which their convergence time and tracking speed are significant. The fast QR RLS algorithm satisfies above the requirements. Its computational complexity is linearly proportional to the tap number of a filter, N and its performance remains numerically stable. From the result of simumulation, the fast QR RLS algorithm represented Cioffi is better than gradient based algorithm in its initial performance when being applied to an adaptive line enhancer for cancelling noise.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.6
• /
• pp.709-713
• /
• 2005

A new algorithm is proposed for the extraction of line segments to construct 3D wire-frame models of building from the high-resolution aerial images. The purpose of this study Is the accurate and effective extraction of line segments, considering the problems such as discordance of lines and blurred edges existing in the conventional methods. Using the edge map extracted from aerial images, chain code tracking of edges was performed. Then, we extract the line segments considering the strength of edges and the direction of them. SUSAN (Smallest Uni-value Segment Assimilating Nucleus) algorithm proposed by Smith was used to extract an edge map. The proposed algorithm consists of 4 steps: removal of the horizontal, vertical and diagonal components of edges to reduce non-candidate point of line segments based on the chain code tracking of the edge map, removal of contiguous points, removal of the same angle points, and the extraction of the start and end points to be line segments. By comparing the proposed algorithm with Boldt algorithm, better results were obtained regarding the extraction of the representative line segments of buildings, having relatively less extraction of unnecessary line segments.

• Journal of Advanced Marine Engineering and Technology
• /
• v.29 no.1
• /
• pp.124-131
• /
• 2005

This paper suggests LOS(Line-Of-Sight) guidance system of a surface vessel in straight-line navigation under ocean currents An LOS vector from the vessel to a point on the path between two way-points is decided and a heading angle is calculated to converge to follow the desired path based on the LOS vector This guidance system is called LOS guidance system. The suggested LOS guidance law has parameters to be properly chosen according to navigational environment. Parameters of LOS guidance system are optimized to reduce propulsive energy and/or position error between desired Position and present position of a ship using genetic algorithm which is a strong optimization algorithm with adaptational random search The effectiveness of the suggested LOS guidance system is assured through computer simulations.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.310-313
• /
• 1996

In this paper, a neural control algorithm is proposed on the automation of adjustment process. The adjustment processes in camcoder production line are modelled, and the processes are adjusted automatically by means of off-line supervisory trained multi-layer neural network. We have made many experiments on the several adjustment processes by using the control algorithm. There are many unexpected troubles to achieve the desirable adjust time in the practical application. To overcome those, some auxiliary algorithms are demanded. As a result, our proposed algorithm has some advantages - simple architecture, easy extraction of the training data without expertises, adaptability to the varying systems, and wide application for the other resemble processes.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.2929-2931
• /
• 1999

In this paper, an adaptive fuzzy inference and HCM(Hard C-Means) clustering method are used for on-line fuzzy modeling of nonlinear and complex system. Here HCM clustering method is utilized for determining the initial parameter of membership function of fuzzy premise rules and also avoiding overflow phenomenon during the identification of consequence parameters. To obtain the on-line model structure of fuzzy systems. we use the recursive least square method for the consequent parameter identification. And the proposed on-line identification algorithm is carried out and is evaluated for sewage treatment process system.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.51 no.9
• /
• pp.467-473
• /
• 2002

In this paper, a fault location algorithm is suggested for line to line faults in distribution networks. Conventional fault location algorithms use the symmetrical component transformation, a very useful tool for transmission network analysis. However, its application is restricted to balanced network only. Distribution networks are, in general, operated in unbalanced manners, therefore, conventional methods cannot be applied directly, which is the reason why there are few research results on fault location in distribution networks. Especially, the line to line fault is considered as a more difficult subject. The proposed algorithm uses direct 3-phase circuit analysis, which means it can be applied not only to balanced networks but also to unbalanced networks like distribution a network. The comparisons of simulation results between one of conventional methods and the suggested method are presented to show its effectiveness and accuracy.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.489-496
• /
• 2002

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

• International Journal of Ocean System Engineering
• /
• v.2 no.3
• /
• pp.139-150
• /
• 2012

This paper presents an improved guidance algorithm for autonomous underwater vehicles (AUV) in 3D space for generating smoother vehicle turn during the course change at the way-points. The way-point guidance by the line-of-sight (LOS) method has been modified for correcting the reference angles to achieve minimal calculation and smoother transition at the way-points. The algorithm has two phases in which the first phase brings the vehicle to converge to a distance threshold point on the line segment connecting the first two way-points and the next phase generates an angular path with smoother transition at the way-points. Then the desired angles are calculated from the reference and correction angles. The path points are regularly parameterized in the spherical coordinates and mapped to the Cartesian coordinates. The proposed algorithm is found to be simple and can be used for real time implementation. The details of the algorithm and simulation results are presented.

• Proceedings of the KIEE Conference
• /
• 2003.07d
• /
• pp.2504-2506
• /
• 2003

In this paper, we propose an algorithm for driving line-tracer robot, considered as a kind of AGV. At first, we introduce the architecture of the line-tracer robot implemented for the experiment, and explain the driving algorithm using path information from infrared sensors. The proposed algorithm can overcome the difference between each sensor's characteristics. Finally, we make some experiments and show the performance of the algorithm in case of straight path.