• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.7
• /
• pp.641-647
• /
• 2015

This paper proposes a new strategy for a quad-rotor to track a moving object efficiently by using image processing and an extended Kalman filter. The goal of path planning for the quad-rotor is to design an optimal path from the start point to the destination point. To lengthen the freight time of the quad-rotor, an optimal path is required to reduce the energy consumption. To track a moving object, the mark signed on the moving object has been detected by a camera mounted first on the quad-rotor. The center coordinates of the mark and its area are calculated through the blob analysis which is one type of image processing. The mark coordinates are utilized to obtain information on the motion direction and the area of the mark is utilized to recognize whether the object moves backward or forward from the camera on the quad-rotor. In addition, an extended Kalman filter has been applied to predict the direction and speed of the dynamically moving object. Through these schemes, it is aimed that the quad-rotor can track the dynamic object efficiently in terms of flight distance and time. Through the two different route freights of the quad-rotor, the performance of the proposed system has been demonstrated.

• Journal of KIISE:Databases
• /
• v.32 no.5
• /
• pp.558-566
• /
• 2005

The XML is the new standard fir data representation and exchange on the Internet. In this paper, we describe a new approach for evaluating a path-oriented query against XML document. In our approach, we propose the Parallel Match Indexing Fabric to speed up evaluation of path-oriented query using path signature and design the parallel match algorithm to perform a match process between a path signature of input query and path signatures of elements stored in the database. To construct a structure of the parallel match indexing, we first make the binary tie for all path signatures on an XML document and then which trie is transformed to the Parallel Match Indexing Fabric. Also we use the Parallel Match Indexing Fabric and a parallel match algorithm for executing a search operation of a path-oriented query. In our proposed approach, Time complexity of the algorithm is proportional to the logarithm of the number of path signatures in the XML document.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.3
• /
• pp.117-124
• /
• 2006

In this paper, we propose the optimal migration path searching method including path adjustment and reassignment techniques for an efficient migration of mobile agent which has an autonomous ability for some task processing. In traditional agent system, if the various and large quantify of task processing were required from the users, it could be derive excessive network traffic and overload due to increasing the size of agent. And also, if an agent migrates from node to node according to routing schedules specified by the user at which the most of network traffic occurs, it could not actively cope with particular situations such as communication loss and node obstacles and required much cost for node traversal Therefore. this paper presents the migration method of agent which can try to adjust and reassign path to the destination automatically through the optimal path search using by network traffic perception in stead of the passive routing schedule by the user. An optimal migration path searching and adjustment methods ensure the migration reliability on distributed nodes and reduce the traversal task processing time of mobile agent by avoiding network traffic paths and node obstacles.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2989-2996
• /
• 1998

As the circuit density of VLSI grows and its performance improves, delay fault testing of VLSI becomes very important. Delay faults in a circuit can be categorized into two classes, gate delay faults and path delay faults. This paper proposed two methods in dynamic memory usage in the path delay fault simulation. The first method is similar to that used in concurrent fault simulation for stuck-at faults and the second method reduces dynamic memory usage by not inserting a fault descriptor into the fault list when its value is X. The second method, called Implicit-X method, showed superior performance in both dynamic memory usage and simulation time than the first method, called Concurrent-Simulation-Like method.

• Laser Solutions
• /
• v.13 no.4
• /
• pp.14-20
• /
• 2010

Robot path generation and laser welding technology for manufacturing automotive body are studied. Laser welding and industrial robot systems are used with the robot based laser welding system. The laser system used in this study is 1.6kW Fiber laser, while the robot system is 6 axes Industrial robot (payload: 130kg). The robot based laser welding system is equipped with laser scanner system for remote laser welding. The laser source, robot and laser scanner system are used to increase the processing speed and to improve the process efficiency. The welding joints of steel plate are butt and lapped joints. The quality test of the laser welding are through the observation the shape of bead on plate and cross-section of welding part. The 3 dimensional laser welding for non-linear pipe welding line is performed. This paper introduces the robot based laser welding system to resolve the limited welding speed and accuracy of the conventional spot welding system.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.1A
• /
• pp.99-106
• /
• 2004

In this Paper, the matched filter for searching initial synchronization in DSSS (direct sequence spread spectrum) receiver is studied. The matched filter with a single data flow path is described which can be presented by HDL (Hardware Description Language). In order to improve the processing time of operations for the filter, equations are arranged to represent two data flow paths and the associated hardware model is proposed. The model has an architecture based on parallelism and pipeline for fast processing, in which two data flow paths with a series of memory, multiplier and accumulator are placed in parallel. The performance of the model is analyzed and compared with the matched filter with a single data flow path.

• Journal of Korea Game Society
• /
• v.13 no.6
• /
• pp.43-52
• /
• 2013

Path finder is one of the very important algorithm of artificial intelligence and is a process generally used in many game fields. Path finder requires many calculation, so it exerts enormous influences on performances. To solve this, many researches on the ways to reduce the amount of calculate operations have been made, and the typical example is A* algorithm but it has unnecessary computing process, reducing efficiency. In this paper, to reduce the amount of calculate operations such as node search with costly arithmetic operations, we proposes the weight based pre-processing A* algorithm. The simulation was materialized to measure the efficiency of the weight based pre-process A* algorithm, and the results of the experiments showed that the weight based method was approximately 1~2 times more efficient than the general methods.

• Annual Conference of KIPS
• /
• 2002.11b
• /
• pp.1595-1598
• /
• 2002

네트워크 장애로 인한 인터넷 서비스 품질의 저하는 사용자와 서비스 제공자에게 여러 가지 형태로 손실을 가져오므로 망의 우회경로 설정 및 복구방안은 중요한 요소가 되고 있다. 망 복구에 있어서 중요한 과제는 작업 경로(working path)에 대한 복구 경로(restoration path)를 설정하는 것이다. 장애가 발생하더라도 서비스의 중단이 없도록 하기 위해서는 복구 경로를 설정할 때 작업 경로의 대역을 보장할 수 있는 복구 경로를 실정해야 한다. 이를 위해 MPLS망에서는 명시적 Routing기법에 기반을 둔 Constraint-based routing이 제안되었고 또한 망의 경로 복구를 위해 정적 및 동적설정기법이 제안되고 있다. 본 논문에서 제안된 방식은 확장된 OSPF 프로토콜의 TE-LSAs를 이용하여 또 다른 virtual 망을 구성하고 기본경로 중간의 TE-LSR을 새로운 PIL로 설정하여 빠른 대체 LSP를 설정 및 복구하는 기법을 성능 비교를 통해 망 자원의 효율적 사용을 보고자 한다.

• Annual Conference of KIPS
• /
• 2014.11a
• /
• pp.196-198
• /
• 2014

Wireless Sensor Networks(WSN) 기반의 Border Surveillance Networks(BSN)는 다양한 제한조건을 동반하며 침입 혹은 환경 등을 감시함을 목적으로 하고 있기 때문에 이벤트 발생시 신뢰적인 데이터 전송은 매우 중요한 부분을 차치하게 된다. 본 논문에서 적용한 대표적인 요구기반 라우팅 방법인 Ad hoc On-demand Distance Vector Routing(AODV)는 BSN 에 적용하였을 경우 홉 수(Hop Count)를 메트릭으로 최적의 경로를 계산하고 선택하여 Uni-Path 로 데이터를 전송하게 된다. 이때 AODV 는 Uni-path 로 데이터 전송을 진행하게 되며 링크의 단절이 빈번히 발생하는 BSN 의 환경적 요인으로 데이터 전송의 신뢰성이 감소하게 될 것이며 이는 비효과적인 데이터 전송을 야기하게 된다. 따라서 본 논문에서는 Multi-path 개념을 도입하여 데이터 전송 시 링크단절에 의해 발생하는 시간의 지연을 줄이고 더욱 신뢰성 있게 데이터를 전송할 수 있는 방법을 제안한다. 제안하는 방법은 송, 수신하는 두 노드의 전송범위에 공통으로 속한 노드들이 전송되는 데이터를 중복 전송하게 된다. 그리하여 링크의 단절이 일어날 경우 발생하는 경로 재 탐색 및 경로복구의 발생 빈도를 줄이고 동시에 데이터 전송률을 증가시켜 신뢰적인 데이터 전송을 하게 된다.

• The KIPS Transactions:PartD
• /
• v.13D no.1 s.104
• /
• pp.87-96
• /
• 2006

This paper focused on the method for customizing software development path, considering the project environments and characteristics. he selection standard of development path is composed of ten items, based on the process of ISO/IEC TR 15721 Information Technology Guide for ISO/IEC 12207 (Software Life Cycle Process) and ISO/IEC 15504 Information technology - Process assessment. The ten items were reflected the project environments and characteristics, at the same time the items conduct the adjustment item of selecting project development path. An algorithm for selecting software development path through items of the project environments and characteristics is presented. To test the algerian in this paper, a system for selecting development path, which reflected algorithm was developed. The development project for web-based system were also adopted to the system for selecting development path. In addition, provened hand-worked project path process differed from machine-worked project path process. The reason why it differs is that outputs were mixed or their names were changed. The effect is to select easily software development route suitable for project environment and characteristics.