• 자동차안전학회지
• /
• 제11권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.

• 전력전자학회논문지
• /
• 제18권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.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2012년도 춘계학술대회
• /
• pp.709-712
• /
• 2012

본 연구에서는 분석학적 모델을 이용하여 DGMOSFET의 전류-전압을 고찰하고자 한다. 분석학적 모델을 유도하기 위하여 포아송 방정식을 이용하였다. 드레인 전류가 $10^{-7}A$일 때 상단게이트전압을 문턱전압으로 정의하였다. 채널의 길이를 20nm에서 100nm까지 변화시켜 채널길이에 따른 전류-전압특성을 분석하였다. 또한 본 연구에서 제시한 모델을 사용하여 DGMOSFET 설계시 중요한 도핑농도와 채널두께 등의 요소변화에 대한 전류-전압의 변화를 관찰하였다. 구조적 파라미터의 변화에 따라 전도중심의 변화와 전도중심이 전류-전압에 미치는 영향을 분석하였다.

• Ocean and Polar Research
• /
• 제30권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$.

• 한국통신학회논문지
• /
• 제31권7B호
• /
• pp.652-659
• /
• 2006

애드 혹 네트워크에서 라우팅 알고리즘은 매우 중요한 연구 분야중의 하나이다. 기존의 라우팅 알고리즘은 현재의 네트워크 토폴로지 상황만을 고려하여 라우팅 경로를 설정하기 때문에 안정적인 라우팅 경로를 설정하는데 많은 어려움이 있다. 이와 같은 문제점을 해결하기 위해 수신 신호 세기를 이용하여 라우팅을 수행하는 알고리즘들이 제안되었지만, 이들은 평균 수신 신호 세기만을 고려하였기 때문에 라우팅 프로토콜의 성능 향상에는 한계가 있다. 따라서 본 논문에서는 평균 수신 신호 세기와 수신 신호 세기의 변화를 고려한 링크 안정성 기반의 라우팅 알고리즘을 제안하였다. 제안된 알고리즘의 성능을 분석하기 위해 다양한 환경에서의 모의실험을 수행하였으며, 그 결과 기존의 알고리즘보다 우수한 성능을 보임을 확인하였다.

• 한국정보처리학회논문지
• /
• 제7권10호
• /
• pp.3164-3170
• /
• 2000

게임지도상에서 에이젼트 이동을 위한 경로탐색에 A+를 이용하는 경우에 실시간 게임진행에 지장을 주고 있다. 다른 경험적 탐색방법은 경로에 대한 최적성 보장이 없어서 문제가 된다. 이러한 문제를 해결하기 위하여 본 논문에서는 현 위치, 목표위치, 최적경로위치로 정의되는 행으로 구성되는 경로표를 제안하였다. 이 경로표를 게임개발시에 미리 작성하여 게임진행시에 이를 이용한다. 이 경로표는 목표위치로의 이동을 위한 최적의 경유위치를 가지고 있어서 최적의 경로도 보장이 되며 탐색으로 인한 시간의 부하도 없다는 장점을 가지고 있다. 그러나 경로표 저장에 메모리가 많이 소요되는 단점이 있다. 이 논문에서는 이 같은 단점을 해소하기 위해 경로표는 생략하는 방법을 이용해도 데이터압축효과를 얻을 수 있음을 보여주었다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권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.

• 대한원격탐사학회:학술대회논문집
• /
• 대한원격탐사학회 2005년도 Proceedings of ISRS 2005
• /
• 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.

• 품질경영학회지
• /
• 제26권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.

• 한국전기전자재료학회:학술대회논문집
• /
• 한국전기전자재료학회 2009년도 하계학술대회 논문집
• /
• 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.