• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.8 no.3
• /
• pp.83-90
• /
• 1983

N-path SC tracking filter is studied beyond the audio frequency range. First, the SC filter Cell which would determine total SC filter characteristics is analyzed by the two methods, charge equation method and difference equation method. Second, 4-path and 8-path SC filter are presented, including only capacitors and switches. Then, 4-path and 8-path SC tracking filter are constructed by conisting of SC filter block and PLL block. In this experiment, maximum response shift is confirmed. With respect to the capacitor ratios and the number of path, Q and Gain(dB) is considered. Also tracking range is measured.

• The Journal of Korea Robotics Society
• /
• v.5 no.2
• /
• pp.120-126
• /
• 2010

This paper presents to study the path tracking method of AGV(autonomous guided vehicle) which has a laser guidance system. An existing automatic guided vehicles(AGVs) which were able to drive on wired line only had a automatic guidance system. However, the automatic guidance systems that those used had the high cost of installation and maintenance, and the difficulty of system change according to variation of working environment. To solve such problems, we make the laser guidance system which is consisted of a laser navigation and gyro, encoder. That is robust against noise, and flexible according to working environment through sensor fusion. The laser guidance system can do a perfect autonomous driving. However, the commercialization of perfect autonomous driving system is difficult, because the perfect autonomous driving system must recognize the whole environment of working space. Hence, this paper studied the path tracking of AGV using laser guidance system without wired line. The path tracking method is consisted of virtual path generation method and driving control method. To experiment, we use the fork-type AGV which is made by ourselves, and do a path tracking experiments repeatedly on same experimental environment. In result, we verified that proposed system is efficient and stable for actual fork-type AGV.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.7 no.1
• /
• pp.87-99
• /
• 2015

In recent years, the development of autonomous surface vehicles has been a field of increasing research interest. There are two major areas in this field: control theory and path planning. This study focuses on path planning, and two objectives are discussed: path planning for Unmanned Surface Vehicles (USVs) and implementation of path planning in a real map. In this paper, satellite thermal images are converted into binary images which are used as the maps for the Finite Angle $A^*$ algorithm ($FAA^*$), an advanced $A^*$ algorithm that is used to determine safer and suboptimal paths for USVs. To plan a collision-free path, the algorithm proposed in this article considers the dimensions of surface vehicles. Furthermore, the turning ability of a surface vehicle is also considered, and a constraint condition is introduced to improve the quality of the path planning algorithm, which makes the traveled path smoother. This study also shows a path planning experiment performed on a real satellite thermal image, and the path planning results can be used by an USV.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.6
• /
• pp.131-137
• /
• 2007

I intend to seek the shortest path which an aircraft safely flies to its destination through the shadow volume of three dimensional terrain which propagation does not extend. Herein, I propose a method in which a relatively wide shadow volume is divided with a polygon type of block polygon, a path up to the intermediate destination is sought in the divided block polygons according to the weight, and then, the shortest path up to the final destination is sought by repeating courses for seeking a destination again from the adjacent polygon based on the starting point of the intermediate destination within the divided polygon. The shortest path was searched by using the revised algorithms which apply to a critical angle from graph growth algorithms on the shadow volume which propagation on the actual three dimensional terrain does not extend to. The experiment shows that a method proposed in this paper creates effective flying curves.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.04a
• /
• pp.25-29
• /
• 1997

In this thesis, we construct the microrobot succor system and navigate the real-time path planning and visual tracking of each robot. The system consists robots, vision system and a host computer. Because the robots are free-ranging mobile robot, it is needed to make and gallow the path. The path is planned and controlled by a host computer, ie. Supervisory control system. In path planning, we suggest a cost function which consists of three terms. One is the smoothness of the path, another is the total distance or time, and the last one is to avoid obstacles. To minimize the cost function, we choose the parametric cubic spline and update the coefficients in real time. We perform the simulation for the path planing and obstacle avoidance and real experiment for visual tracking

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.179-188
• /
• 2001

We analyze the property of candidate node set in the network graph, and propose an algorithm to decrease shortest path-finding computation time by using multiple dynamic-range queue(MDRQ) structure. This MDRQ structure is newly created for effective management of the candidate node set. The MDRQ algorithm is the shortest path-finding algorithm that varies range and size of queue to be used in managing candidate node set, in considering the properties that distribution of candidate node set is constant and size of candidate node set rapidly change. This algorithm belongs to label-correcting algorithm class. Nevertheless, because re-entering of candidate node can be decreased, the shortest path-finding computation time is noticeably decreased. Through the experiment, the MDRQ algorithm is same or superior to the other label-correcting algorithms in the graph which re-entering of candidate node didn’t frequently happened. Moreover the MDRQ algorithm is superior to the other label-correcting algorithms and is about 20 percent superior to the other label-setting algorithms in the graph which re-entering of candidate node frequently happened.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1995.04b
• /
• pp.157-163
• /
• 1995

This paper presents an algorithm to deternine the tool path height for rough machining of sculptured surface. To minimize rough machining of sculptured surface, it is necessary to determine the tool path heights of contour planes. the proposed algorithm searches for the height at which maximum metal removal rate is obtained. This bisection method is accomplished until all shoulder heights are within roughing tolerance. The machining experiment demonstrates the superiority of the algorithm presented in this thesis.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.763-767
• /
• 1994

The measured vibration on a machine or a structure is shaped by the excitation waveform and the path transfer function. Mechanism diagnostics tends to focus on retrieving source featurce by minimzing the effects of the structural path, while in structural diagnostics we are more interested in minimizing source effects and retrieving path parameters. In structural diagnostics, therefore, there are experimental issues of gathering data that are independent source effects and finding a transfer function signature that reveals structural defects. This paper describes how the transfer function can be obtained more accurately by experiment using the compatibility relationship which is newly discovered.

• Journal of the military operations research society of Korea
• /
• v.26 no.2
• /
• pp.120-130
• /
• 2000

The purpose of this study is to present a method for determining the k most vital arcs in shortest path problem using an evolutionary algorithm. The problem of finding the k most vital arcs in shortest path problem is to find a set of k arcs whose simultaneous removal from the network causes the greatest increase in the total length of shortest path. Generally, the problem determining the k most vital arcs in shortest path problem has known as NP-hard. Therefore, in order to deal with the problem of real world the heuristic algorithm is needed. In this study we propose to the method of finding the k most vital arcs in shortest path problem using an evolutionary algorithm which known as the most efficient algorithm among heuristics. The method presented in this study is developed using the library of the evolutionary algorithm framework and then the performance of algorithm is analyzed through the computer experiment.

• Convergence Security Journal
• /
• v.19 no.3
• /
• pp.3-12
• /
• 2019

BGP is the most important protocol among routing protocols that exchange routing information to create routing tables and update changed information so that users on the Internet can send information to destination systems. This paper analyzes how to prevent malicious attacks and problems caused by network administrator's mistakes by using vulnerabilities in BGPv4 that are currently used. We analyzed the attack methods by performing the actual attack experiment on the AS-PATH attack, which is the attack method for BGP's representative security vulnerability, and proposed the algorithm to identify the AS-PATH attack.