• Journal of Auto-vehicle Safety Association
• /
• v.11 no.2
• /
• pp.17-22
• /
• 2019

This paper describes the tracking algorithm performance evaluation for autonomous vehicle using a safety envelope based path. As the level of autonomous vehicle technologies evolves along with the development of relevant supporting modules including sensors, more advanced methodologies for path generation and tracking are needed. A safety envelope zone, designated as the obstacle free regions between the roadway edges, would be introduced and refined for further application with more detailed specifications. In this paper, the performance of the path tracking algorithm based on the generated path would be evaluated under safety envelop environment. In this process, static obstacle map for safety envelope was created using Lidar based vehicle information such as current vehicle location, speed and yaw rate that were collected under various driving setups at Seoul National University roadways. A level of safety was evaluated through CarSim simulation based on paths generated with two different references: a safety envelope based path and a GPS data based one. A better performance was observed for tracking with the safety envelop based path than that with the GPS based one.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.18 no.2
• /
• pp.178-183
• /
• 2013

The study of lightning surge have been conducted on information and communications equipment and power system. However, the research on SMPS itself is an inactive field. This paper analyzes surge current path of flyback converter with the combination wave generator by lightning surge. Also, this paper discloses that there exists the surge current with high-frequency component besides the low-frequency component based on the standard surge current. This high-frequency surge current is the major reason to damage the semiconductor devices such as FET and IC. To confirm the validity of the proposed issue, the analysis and experimental results are presented.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.709-712
• /
• 2012

In this paper, current-voltage have been considered for DGMOSFET, using the analytical model. The Possion equation is used to analytical. Threshold voltage is defined as top gate voltage when drain current is $10^{-7}A$. Investigated current-voltage characteristics of channel length changed length of channel from 20nm to 100nm. Also, The changes of current-voltage have been investigated for various channel thickness and doping concentration using this model, given that these parameters are very important in design of DGMOSFET. The deviation of conduction path and the influence of conduction path on current-voltage have been considered according to the dimensional parameters of DGMOSFET.

• Ocean and Polar Research
• /
• v.30 no.1
• /
• pp.21-31
• /
• 2008

Analyzing the results of East Sea Regional Ocean Model using a 3-dimensional variational data assimilation scheme, we investigated spatial and temporal variability of the North Korean Cold Current (NKCC) in the East Sea. The climatological monthly mean transport of the NKCC clearly shows seasonal variation of the NKCC within the range of about 0.35 Sv ($=0^6m^3/s$), which increases from its minimum (about 0.45 Sv) through December-January to March, decreases during March and May, and then increases again to the maximum (about 0.8 Sv) in August-September. The volume transport of the NKCC shows interannual variation of the NKCC with the range of about 1.0 Sv that is larger than seasonal variation. The southward current of the NKCC appears often not only in summer but in winter as well. The width of the NKCC is about 35 km near the Korean coast and its core is located under the East Korea Warm Current. The North Korean Cold Water (NKCW), characterized by low salinity and low temperature, is located both under the Tsushima Warm Water and in the western side of the maximum southward current of the NKCC that means the NKCC advects the NKCW southward along the Korean coast. It is revealed that the intermediate low salinity water, formed off the Vladivostok in winter, flows southward to the south of $37^{\circ}N$ through $2{\sim}3$ paths; one path along the Korean coast, another one along $132^{\circ}E$, and the middle path along $130^{\circ}E$. The path of the intermediate low salinity varies with years. The reanalysis fields suggest that the NKCW is advected through the paths along the Korean coast and along $130^{\circ}E$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.652-659
• /
• 2006

The routing algorithm is one of the key research areas in ad hoc networks. The most of existing routing algorithms depends on current availability of wireless link when finding the feasible path. Dependence on current information may mislead to a fragile communication path. Some routing approaches that take statistical average on received signal power enhance the possibility to find the most stable path, but have limitation on considering only the average power level. In this paper, we propose routing algorithm based on link stability for ad hoc network. The proposed algorithm not only takes statistical average, but also traces the degree of variations in received signal power. The simulation result support that the proposed algorithm is more likely to find the most stable path under the severe communication environment.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3164-3170
• /
• 2000

The use of the A' for the path search of the agent in the game map give the overhead of computing time in real time game processing. The other heuristic search algorithms do not guarantee the optical path. The route table of which the row is defined by current position, goal position, visiting position is presented in this paper. This route table is made in the game development phase and tilized in game playing. The visiting position which is contatined in the optimal path to the goal position from the current position can guarantee the optical path, and this mothod has no overhead on computing time. But the memory space is requred too much. This problem can also be solved using the data compression by skipping the duplicated route table.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.2
• /
• pp.678-690
• /
• 2014

The current networks do not disclose information about a management domain due to scalability, manageability and commercial reasons. Therefore, it is very hard to calculate an optimal path to the destination. Also, due to poor information sharing, if an error occurs in the intermediate path, it is very difficult to re-search the path and find the best path. Hence, to manage each domain more efficiently, an architecture with top-level path computation node which can obtain information of separate nodes are highly needed This study aims to investigate a federation of a united network around NRN(National Research Network) that could allow resource sharing between countries and also independent resource management for each country. Considering first the aspects that can be accessed from the perspective of a national research network, ICE(Information Control Element) and GFO(Global Federation Organizer)-based architecture is designed as a top-level path computation element to support traffic engineering and applied to the multi-domain network. Then, the federation for the independent management of resources and resource information sharing among national research networks have been examined.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.759-762
• /
• 2005

Recently, Intelligent Transportation System(ITS) has been applied to satisfy increasing traffic demand every year and to solve many traffic problems. Especially, Advanced Traveller Information System(ATIS) is a transportation system to optimize the trip of each other vehicle. It is important to provide the driver with quick and comfortable path from source to destination. However, it is difficult to provide a shortest path in a road network with dynamic cost. Because the existing research has a static cost. Therefore, in this paper we propose an operator for searching traffic dependent shortest path. The proposed operator finds the shortest path from source to destination using a current time cost and a difference cost of past time cost. Such a method can be applied to the road status with time. Also, we can expect a predicted arrival time as well as the shortest path from source to destination. It can be applied to efficiently application service as ITS and have the advantages of using the road efficiently, reducing the distribution cost, preparing an emergency quickly, reducing the trip time, and reducing an environmental pollution owing to the saving the fuel.

• Journal of Korean Society for Quality Management
• /
• v.26 no.1
• /
• pp.192-200
• /
• 1998

The quickest path problem is one of the important things for quality of services in communication networks. It is to find a path to send a given amount of data from the source to the sink with minimum transmission time, where the transmission time is dependent on both the capacities and the traversal times of the arcs in the network. This is found under the networks that the capacity and the lead time of each ring are predetermined. It is general to solve the quickest path problem using shortest path algorithms. The relevant algorithms proposed till now are based on the capacity of rings in distributed environments. When the configuration of networks is changed, there can be two a, pp.oaches to find the quickest paths. The one is to find new quickest paths, and the other is to update the current quickest paths. As one of the algorithms for the latter, the distributed quickest path update algorithm was proposed. This paper aims to propose the distributed algorithm a, pp.icable to find the quickest path, when the configuration of networks is changed, using the quickest path tree update altorithm, and to verify its possibility of a, pp.ication by analyzing the transmission amount of data from one node to another from the theoretical point of view.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2009.06a
• /
• pp.3-4
• /
• 2009

As device process technology advances, effective channel length, the thickness of gate oxide, and supply voltage decreases. This paper describes a novel electrostatic discharge (ESD) protection device which has current feedback for high ESD immunity. A conventional Gate-Grounded NMOS (GGNMOS) transistor has only one ESD current path, which makes, the core circuit be in the safe region, so an GGNMOS transistor has low current immunity compared with our device which has current feedback path. To simulate our device, we use conventional $0.18\;{\mu}m$ technology parameters with a gate oxide thickness of $43\;{\AA}$ and power supply voltage of 1.8 V. Our simulation results indicate that the area of our ESD protection, device can be smaller than a GGNMOS transistor, and ESD immunity is better than a GGNMOS transistor.