• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1419-1421
• /
• 1999

CADPAD program has been used as a distribution planning tool in KEPCO since 1989. In recent we've been upgraded the I/O modules. Now we analyze the key algorithm of FEEDERSITE module. The objective function is represented by the sum of the multiples of Power flow and cost. To minimize the objective function, it is used to Linear Programming algorithm. We will show this algorithm in this paper.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2002.05a
• /
• pp.8-14
• /
• 2002

This article presents a new algorithm for the K Shortest Paths Problem which develops initial K shortest paths, and repeal to expose hidden shortest paths with dual approach and to replace the longest path in the present K paths. The initial solution which comprises K shortest paths among shortest paths to traverse each arc is made from bidirectional Dijkstra algorithm. When a crossing node that have two or more inward arcs is found at least three time by turns in this K shortest paths, one inward arc of this crossing node, which has minimum detouring distance, is chosen, and a new path is exposed with joining a detouring subpath from source to this inward arc and a spur of a feasible path from this crossing node to sink. This algorithm, requires worst case time complexity of $O(Kn^2),\;and\;O(n^2)$ in the case $K{\leq}3$.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.30B no.4
• /
• pp.67-75
• /
• 1993

The Fourier series are employed to approximate the input/output(I/O) characteristics of a dynamic system and, based on the approximation, a new learing control algorithm is proposed in order to find iteratively the control input for tracking a desired trajectory. The use of the Fourier approximation of I/O renders at least a couple of useful consequences: the frequency characteristics of the system can be used in the controller design and the reconstruction of the system states is not required. The convergence condition of the proposed algorithm is provided and the existence and uniqueness of the desired control input is discussed. The effectiveness of the proposed algorithm is illustrated by computer simulation for a robot trajectory tracking. It is shown that, by adding feedback term in learning control algorithm, robustness and convergence speed can be improved.

• Journal of information and communication convergence engineering
• /
• v.9 no.1
• /
• pp.105-109
• /
• 2011

In this paper, we study the dominating-free sest which is defined as follows: k points called servers and n points called clients in the plane are given. For a point p in the plane is said to be dominated by a client c if for every server s, the distance between s and p is greater than the distance between s and c. The dominating-free set is the set of points in the plane which aren't dominated by any client. We present an O(nklogk+$n^2k$) time algorithm for computing the dominating-free set under the $L_1$-metric. Specially, we present an O(nlogn) time algorithm for the problem when k=2. The algorithm uses some variables and 1-dimensional arrays as its principle data structures, so it is easy to implement and runs fast.

• Proceedings of the KIEE Conference
• /
• 2006.10a
• /
• pp.224-226
• /
• 2006

In this paper, we have studied for analysis of the partial discharge(PD) signal in power transmission line. The PD signal has estimated as detected signal accumulation of a PRPDA method by using Labview, and analyzed with neuro-fuzzy algorithm. With practical PD logic implementation of theoretical detected system and hardware implementation, the device for Hipotronics Company's 22.9kV or 154kV setup has generated and then has applied with 18kV,20kV with 1:1 time probe. It's also used the LDPE O.27mmt (scratch error O.05mmt) to sample for making PD. Our new class of PD detected algorithm has also compared with previous PRPDA or Fuzzy algorithm, which has diagnose more conveniently by adding numerical values.

• Proceedings of the KIEE Conference
• /
• 2003.07b
• /
• pp.1359-1361
• /
• 2003

As the maximum power operating point(MPOP) of Photovoltaic(PV) power generation systems changes with changing atmospheric conditions such as solar radiation and temperature, an important consideration. In the design of efficient PV system is to track the MPOP correctly. Many maximum power point tracking(MPPT) techniques have been considered in the past, however, techniques using microprocessors with appropriate MPPT algorithms are favored because of their flexibility and compatibility with different PV arrays. Although the efficiency of these MPPT algorithms is usually high, it drops noticeably in case of rapidly changing atmospheric conditions. This pager proposed a new MPPT algorithm based on perturb & observe(P&O) algorithm with experiment. The results shows that the new P&O algorithm has successfully tracked the MPOP, even in case of rapidly changing atmospheric conditions, and has higher efficiency than ordinary algorithms.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.2
• /
• pp.111-123
• /
• 2009

We present an efficient algorithm for computing the Hausdorff distance between two 2D convex polygons. Two convex polygons are bounded by k-DOPs and the regions of interest are traced using the orientational and hierarchical properties of k-DOP. The algorithm runs in a logarithmic time in the average case, and the worst case time complexity is linear.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1387-1392
• /
• 1990

In this paper, an iterative learning control algorithm for unknown linear discrete systems is proposed by employing a parameter estimator together with an inverse system model. Regardless of initial error and inherent parameter uncertainty, a good tracking control performance is obtained using the proposed learning control algorithm characterized by recursive operations. A sufficient condition for convergency is provided to show the effectiveness of the proposed algorithm. To investigate the performance of the algorithm a series of simulations and experiments were performed for the tracking control of a servo motor.

• The KIPS Transactions:PartA
• /
• v.10A no.6
• /
• pp.665-670
• /
• 2003

In the applications like automatic masks generation for semiconductor production, a drawing consists of lots of polygons that are partitioned into trapezoids. The addition/deletion of a polygon to/from the drawing is performed through geometric operations such as insertion, deletion, and search of trapezoids. Depending on partitioning algorithm being used, a polygon can be partitioned differently in terms of shape, size, and so on. So, It's necessary to invent some comparison algorithm of sets of trapezoids in which each set represents interested parts of a drawing. This comparison algorithm, for example, may be used to verify a software program handling geometric objects consisted of trapezoids. In this paper, given k sets of trapezoids in which each set forms the regions of interest of each drawing, we present how to compare the k sets to see if all k sets represent the same geometric scene. When each input set has the same number n of trapezoids, the algorithm proposed has O(2$^{k-2}$ $n^2$(log n＋k)) time complexity. It is also shown that the algorithm suggested has the same time complexity O( $n^2$ log n) as the sweeping-based algorithm when the number k(<< n) of input sets is small. Furthermore, the proposed algorithm can be kn times faster than the sweeping-based algorithm when all the trapezoids in the k input sets are almost the same.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.12 no.1
• /
• pp.133-140
• /
• 2012

This paper suggests an algorithm that can shorten the complexity $O(n^2)$ of Dijkstra algorithm that is applied to the shortest path searching in real-time GPS Navigation System into an up-to-date O(n). Dijkstra algorithm manipulates the distance of the minimum length path by visiting all the nodes from the starting node. Hence, it has one disadvantage of not being able to provide the information on the shortest path every second, in a city that consists of sophisticated roads, since it has to execute number of node minus 1. The suggested algorithm, firstly, runs by means of organizing the set of out-neighbourhood nodes at each level of the tree, and root node for departure node. It also uses a method of manipulating the distance of the minimum path of all out-neighborhoods and interior of the out-neighborhoods. On applying the suggested algorithm to two sophisticated graphs consisted of bi-direction and uni-direction, we have succeeded to obtain the distance of the minimum length path, just as same as Dijkstra algorithm. In addition, it has an effect of shortening the time taken 4 times from number of node minus1 to number of level minus 1. The satisfaction of the drivers can be increased by providing the information on shortest path of detour, every second, when occurs any rush hour or any traffic congestion due to car accident, by applying this suggested algorithm to the real-time GPS system.