• Journal of the Institute of Convergence Signal Processing
• /
• v.6 no.4
• /
• pp.182-190
• /
• 2005

In the paper, we propose an intelligent automatic parking assist system. To realize an automatic parking, first, the prospective parking position and the location of a vehicle should be recognized. Second, the system should compute a path which introduces the parking position precisely with avoiding any obstacles. Third, the handle should be controlled so that the vehicle moves through the path. To calculate the location of the vehicle and its surroundings, the system applies the camera image method to transforming input images to the plane map. It also uses the inertial navigation method which recognizes the position and the direction of a moving vehicle by using a kinematic model of the vehicle. To generate a path of the vehicle, the simple path method and the Bezier spline method are tested. The divided arc method which generates multiple paths is also tested. We apply a method which makes the system choose the best path with multiple objective functions. We introduce the virtual road method, as a solution for the problem of mechanical time delay, to have the vehicle followed the designated path.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.27-34
• /
• 1994

There have been traditional approaches to model radio propagation path loss mechanism both theoretically ad empirically. Theoretical approach is simple to explain and effective in certain cases. Empirical approach accommodates the terrain configuration and distance between base station and mobile unit along the propagation path only. In other words, it does not accommodate natural terrain configuration over a specific area. In this paper, we propose a spatial prediction technique for the mobile radio propagation path loss accommodating complete natural terrain configuration over a specific area. Statistical uncertainty analysis is also considered.

• Journal of Korean Institute of Industrial Engineers
• /
• v.19 no.2
• /
• pp.43-51
• /
• 1993

This paper describes the flow path design of unidirectional automated guided vehicle systems. The objective is to find the flow path which will minimize total travel time of unloaded as well as loaded vehicles. The allocation of unloaded vehicles is determined by applying the transportation simplex method. The problem is solved using a branch-and-bound technique. A simple illustrative example is discussed to demonstrate the procedure.

• Communications of the Korean Mathematical Society
• /
• v.29 no.1
• /
• pp.213-218
• /
• 2014

J. Malkevitch defined the coded path in r-valent polytopal graphs of uniform face structure and showed many interesting properties of the coded paths. In this paper, we study the simplicity of coded paths in an m-valent planar multigraph which is not a polytopal graph.

• Proceedings of the IEEK Conference
• /
• 1999.06a
• /
• pp.723-728
• /
• 1999

In this paper, we designed a Circular Path Built-In Self Test circuit and embedded it into a simple 8-bit microprocessor. Register cells of the microprocessor have been modified into Circular Path register cells and each register cells have been connected to form a scan chain. A BIST controller has been designed for controlling BIST operations and its operation has been verified through simulation. The BIST circuit described in this paper has increased size overhead of the microprocessor by 29.8% and delay time in the longest delay path from clock input to output by 2.9㎱.

• Proceedings of the Korea Society for Simulation Conference
• /
• 1998.03a
• /
• pp.11-16
• /
• 1998

The classical algorithm for solving liner network flow problems are primal cost improvement method, including simplex method, which iteratively improve the primal cost by moving flow around simple cycles, which iteratively improve the dual cost by changing the prices of a subset of nodes by equal amounts. Typical iteration/shortest path algorithm is used to improve flow problem of liner network structure. In this paper we stdudied about the implemental method of shortest path which is a practical computational aspects. This method can minimize the best neighbor node and also implement the typical iteration which is $\varepsilon$-CS satisfaction using the auction algorithm of linear network flow problem

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.7
• /
• pp.97-103
• /
• 2009

This paper proposes efficient routing scheme named MP-DD(MultiPath-Direct Diffusion) which is simple enough to be applicable to the wireless sensor networks. Conventional DD uses only one optimal path, therefore it consumes more energy of specific nodes. MP-DD uses multiple path and has a information of hop upstream node in the direction of the base-station is determined which are obtainable via the process of self-organization of the network. Simulation results show the feasibility of the simple routing schemes for the sensor networks.

• Proceedings of the KIEE Conference
• /
• 2005.05a
• /
• pp.249-251
• /
• 2005

In this paper, an algorithm of path planning and obstacle avoidance for mobile robot is proposed. We call the proposed method Random Access Sequence(RAS) method. In the proposed method, a small region is set first and numbers are assigned to its neighbors. By processing assigned numbers all regions are covered and then the path from start to destination is selected by these numbers. The RAS has an advantage of fast planning because of simple operations. This implies that new path selection may be possible within a short time and helps a robot to avoid obstacles in any direction. The algorithm can be applied to unknown environments. When moving obstacles appear, a mobile robot avoids obstacles reactively. then new path is selected by RAS.

• Journal of the Korea Society for Simulation
• /
• v.8 no.3
• /
• pp.17-28
• /
• 1999

Recently studies have shown that conditional branches can be accurately predicted by recording the path leading up to the branch. But path predictors are more complex and uncompatible with existing pattern branch predictors. In order to solve these problems, we propose a simple path branch predictor(SPBP) that hashes together two most recent branch instruction addresses. In addition, we propose a pattern/path hybrid branch predictor composed of the SPBP and existing pattern branch predictors. Through the trace-driven simulation of six benchmark programs, the performance improvement by the proposed pattern/path hybrid branch prediction is analysed and validated. The proposed predictor can improve the prediction accuracy from 94.21% to 95.03%.

• Journal of the Korean Society for Precision Engineering
• /
• v.11 no.4
• /
• pp.88-98
• /
• 1994

A new local path planning algorithm for free-ranging robots is proposed. Considering that a laser range finder has the excellent resolution with respect to angular and distance measurements, a simple local path planning algorithm is achieved by a directional weighting method for obtaining a heading direction of nobile robot. The directional weighting method decides the heading direction of the mobile robot by estimating the attractive resultant force which is obtained by directional weighting function times range data, and testing whether the collision-free path and the copen parthway conditions are satisfied. Also, the effectiveness of the established local path planning algorithm is estimated by computer simulation in complex environment.