• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.432-436
• /
• 1991

This paper presents a new algorithm for the countermeasure to alleviate without shedding system loads the line overloads due to contingency in power system. This method for relieving by line switching is based on obtaining the line outage distribution factors - the linear sensitivity factors, which give the amount of change in the power flow of each line due to the removal of same other line in the power system. These factors are made up of the elements of Bus Reactance Matrix and branch reactances. In this paper a fast algorithm and program is presented for obtaining only the required Bus Reactance elements which corresponds to a non - zero elements of Bus Admittance Matrix and elements of columns which correspond to two terminal Buses of the overloaded(monitored) line. The proposed algorithm has been validated in tests on the 6 busbar test system

• Journal of Information Processing Systems
• /
• v.16 no.2
• /
• pp.406-420
• /
• 2020

In order to make up the deficiencies of the existing research results which cannot effectively deal with the nearest neighbor query based on the line segments in obstacle space, the k nearest neighbor query method of line segment in obstacle space is proposed and the STA_OLkNN algorithm under the circumstance of static obstacle data set is put forward. The query process is divided into two stages, including the filtering process and refining process. In the filtration process, according to the properties of the line segment Voronoi diagram, the corresponding pruning rules are proposed and the filtering algorithm is presented. In the refining process, according to the relationship of the position between the line segments, the corresponding distance expression method is put forward and the final result is obtained by comparing the distance. Theoretical research and experimental results show that the proposed algorithm can effectively deal with the problem of k nearest neighbor query of the line segment in the obstacle environment.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.800-804
• /
• 1999

An intelligent path planning algorithm for an autonomous cleaning robot is presented. This algorithm recognizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• International Journal of Contents
• /
• v.10 no.3
• /
• pp.35-40
• /
• 2014

Text line segmentation is a critical task in handwritten document recognition. In this paper, we propose a novel text-line-segmentation method using baseline estimation and watershed. The baseline-detection algorithm estimates the baseline using Adaptive Head-Tail Connection (AHTC) on the document. Then, the watershed method segments the line region using the baseline-detection result. Finally, the text lines are separated by watershed result and a post-processing algorithm defines the lines more correctly. The scheme successfully segments text lines with 97% accuracy from the handwritten document images in the ICDAR database.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2000.04a
• /
• pp.56-63
• /
• 2000

Abstract - In this paper, an adaptive mechanism based on immune algorithm is designed and it is applied for the autonomous guided vehicle(AGV) driving. When the immune algorithm is applied to the PID controller, there exists the case that the plant is damaged due to the abrupt change of PID parameters since the parameters are adjusted almost randomly. To solve this problem, a neural network is used to model the plant and the parameter tuning of the model is performed by the immune algorithm. After the PID parameters are determined in this off-line manner, these gains are then applied to the plant for the on-line control using immune adaptive algorithm. Moreover, even though the neural network model may not be accurate enough intially, the weighting parameters are adjusted to be accurate through the on-line fine tuning. The computer simulation for the control of steering and speed of AGV is performed. The results show that the proposed controller has better performances than other conventional controllers.

• Journal of Korean Port Research
• /
• v.14 no.2
• /
• pp.187-197
• /
• 2000

In this paper, an adaptive mechanism based on immune algorithm is designed and it is applied to the driving control of the autonomous guided vehicle(AGV). When the immune algorithm is applied to the PID controller, there exists the case that the plant is damaged by the abrupt change of PID parameters since the parameters are adjusted almost randomly. To solve this problem, a neural network used to model the plant and the parameter tuning of the model is performed by the immune algorithm. After the PID parameters are determined through this off-line manner, these parameters are then applied to the plant for the on-line control using immune adaptive algorithm. Moreover, even though the neural network model may not be accurate enough initially, the weighting parameters are adjusted more accurately through the on-line fine tuning. The experiment for the control of steering and speed of AGV is performed. The results show that the proposed controller provides better performances than other conventional controllers.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.7
• /
• pp.658-663
• /
• 2012

An accurate outdoor localization method using line/arc features is suggested for mobile robots with LRFs (Laser Range Finders) and odometry. Localization is a key process for outdoor mobile robots which are used for autonomous navigation, exploration and so on. In this paper, an accurate pose correction algorithm is proposed for mobile robots using LRFs, which use three feature types: line, circle, and arc. Using this method we can reduce the number of singular cases that robots couldn't find their pose. Finally we have got simulation results to validate the proposed algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.23 no.56
• /
• pp.9-18
• /
• 2000

This paper considers the problem of two-machine, M-parallel flow shop scheduling to minimize makespan, and proposes a series of heuristic algorithms and a branch and bound algorithm. Two processing times of each job at two machines on each line are identical on any line. Since each flow-shop line consists of two machines, Johnson's sequence is optimal for each flow-shop line. Heuristic algorithms are developed in this paper by combining a "list scheduling" method and a "local search with global evaluation" method. Numerical experiments show that the proposed heuristics can efficiently give optimal or near-optimal schedules with high accuracy. with high accuracy.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.10
• /
• pp.119-124
• /
• 2000

One of the main problems in 3D shape measuring systems that use the triangulation of line-shaped laser light is precise center line detection of line-shaped laser stripe. The intensity of a line-shaped laser light stripe on the CCD image varies following to the reflection angles, colors and shapes of objects. In this paper, a new center line detection algorithm to compensate the local intensity variation on a line-shaped laser light stripe is proposed. The 3-D surface shape measuring system using the proposed center line detection algorithm can measure 3-D surface shape with enhanced measurement resolution by using the dynamic shape reconstruction with adaptive pattern clustering of the line-shaped laser light. This proposed 3-D shape measuring system can be easily applied to practical situations of measuring 3-D surface by virtue of high speed measurement and compact hardware compositions.

• 전기의세계
• /
• v.26 no.3
• /
• pp.84-91
• /
• 1977

A modified version of algorithm and computer program is proposed to improve the currently available contingency analysis methode for the security control of power system. The underlying principle is based upon the reasonable modification of the current methods suggested by Stagg, Tinny, Alsac, and Stott in consideration of speed, aceuracy, reliability and convergency characteristics. The algorithm and program are desirgned especially for On-Line operation, although Off-Line applications are readily available. Several case studies on the Koren Power Company's 48-bus, 91-line system have shown that the method proposed is efficiently powerful in a sense of practical applicability.