• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• 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.

• 로봇학회논문지
• /
• 제16권3호
• /
• pp.250-259
• /
• 2021

Path planning is one of the important technologies for automated parking. It requires to plan a collision-free path considering the vehicle's kinematic constraints such as minimum turning radius or steering velocity. In a complex parking lot, Rapidly-exploring Random Tree^* (RRT^*) can be used for planning a parking path, and Reeds-Shepp or Hybrid Curvature can be applied as a tree-extension method to consider the vehicle's constraints. In this case, each of these methods may affect the computation time of planning the parking path, path-tracking error, and parking success rate. Therefore, in this study, we conduct comparative analysis of two tree-extension functions: Reeds-Shepp (RS) and Hybrid Curvature (HC), and show that HC is a more appropriate tree-extension function for parking path planning. The differences between the two functions are introduced, and their performances are compared by applying them with RRT^*. They are tested at various parking scenarios in simulation, and their advantages and disadvantages are discussed by computation time, cross-track error while tracking the path, parking success rate, and alignment error at the target parking spot. These results show that HC generates the parking path that an autonomous vehicle can track without collisions and HC allows the vehicle to park with lower alignment error than those of RS.

• 대한원격탐사학회지
• /
• 제20권5호
• /
• pp.307-313
• /
• 2004

The trajectories of 8 autonomous profiling floats deployed in the Kuroshio Extension region in February 2001 are used to depict the circulation pattern at the surface and 2000db. The corresponding sea surface topography maps created from satellite altimeter and dynamic height climatology were compared with the tracks of nearly coincident floats and were found to agree well in most cases except for the period June 5 to 16 2001. It is shown that over the period the conspicuous breakaway of the floats from an expected path is possibly associated with the abnormal path of the Kuroshio Extension such as an outbreak event, as revealed by AVHRR infrared and SeaWiFS chlorophyll-a images and cruise data in cross sections.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1998년도 추계종합학술대회 논문집
• /
• pp.119-122
• /
• 1998

Wireless ATM(WATM) intends to provide a broad range of mobile multimedia services through wireless access by mobility extensions from the fixed ATM-based network. Recently, there have been active researches about new handover techniques to support terminal mobility in WATM. In this paper we classify path reestablishment schemes into full reestablishment, path rerouting with a static COS, path rerouting with a dynamic COS, and path extension. For a backward lossy handover procedure, we analyze and compare the performances of path reestablishment schemes in terms of delay, service disruption time and cell loss.

• 유통과학연구
• /
• 제13권3호
• /
• pp.11-19
• /
• 2015

Purpose - This study examines the strength of sadness and the belief it will last, as regards the effects of the degree of self-extension to the sad-evoking event on choice behavior related to self-control dilemmas. Research Design, Data, and Methodology - In an experiment involving high and low self-extension groups, 261 undergraduates answered self-administered questionnaires. The hypotheses were tested using AMOS 19.0 and path analysis. Results - The positive relationship between the degree of self-extension to the sad-evoking event and hedonic vs. utilitarian food choices was mediated by the belief that the sadness will last. There is a significant indirect path from the degree of self-extension (to the sad-evoking event) to the strength of the sadness, and to the belief that it will last with respect to hedonic vs. utilitarian food choices. Conclusions - These results show that beliefs about sad emotion transience depend on both the degree of self-extension to the sad-evoking event and the strength of sadness, and that the belief that sad emotions are transient makes sad people susceptible to temptation when facing self-control related dilemmas.

• 경영과정보연구
• /
• 제28권2호
• /
• pp.1-19
• /
• 2009

많은 외식기업들은 시장에서 이미 성공한 브랜드를 무형의 자산으로 취급하고, 이를 보다 적극적으로 활용하기 위한 마케팅 전략의 일환으로 브랜드확장을 이용하고 있다. 브랜드확장전략은 브랜드이미지를 강화하고 마케팅비용을 감소한다. 본 연구의 결과는 다음과 같다. 첫째, 본 연구의 가설 (H-1)에 해당하는 확장브랜드에 대한 이미지와 확장브랜드에 대한 태도와의 관계를 검증한 결과, 계수 값이 0.43, t값이 4.21로 나타나 통계적인 유의성이 검증되었다. 확장된 브랜드 이미지는 확장된 브랜드 태도에 가장 강력하게 영향을 미친다. 둘째, 확장브랜드에 대한 태도와 확장브랜드의 충성도간의 관계(H-2)에 있어서도 계수의 값이 0.29, t값이 3.08로 나타나 확장브랜드에 대한 태도가 확장브랜드의 충성도에 영향을 미친다는 것을 알 수 있다. 본 연구결과, 외식브랜드는 고객과 외식기업간의 단순한 거래의 수단이 아닌 지속적인 관계의 개념의 확장으로써 적용되는 상호작용적 수단으로 인식해야 한다. 특히 이미지와 태도, 그리고 재방문의도, 추천의도와 같은 충성도와 어떠한 영향관계가 있는지 조명한 부분은 이와 유사한 선행연구들의 이론적 한계를 극복할 하나의 이론적 실마리를 제공한다.

• 한국통신학회논문지
• /
• 제25권5A호
• /
• pp.602-610
• /
• 2000

본 논문에서 무선 ATM LAN 환경에서 기지국 기반 기법의 루프 제거 및 경로 최적화 알고리즘을 제안한다. 제안하는 경로 최적화 알고리즘은 다각 루프 제거법과 삼각 루프 제거법의 두 단계로 이루어져 있다. 단말기의 이동각을 고려한 순서쌍의 기념을 도입하여 핸드오버하는 단말기의 위치를 표현하고, 계산된 순서쌍을 이용하여 경로 최적화를 수행한다. 우리는 핸드오버 지연 시간, 통신 단절 시간, 버퍼 요구량, 그리고 총시그널링 교환 시간 등을 이용하여 제안하는 기법과 앵커 재라우팅 기법을 비교하였다. 이러한 비교 평가를 통하여 제안하는 기법이 경로 확장 기법의 장점인 빠른 핸드오버를 보장하면서 경로 상에서 발생하는 루프의 제거와 경로의 최적화를 효과적으로 수행할 수 있음을 보였다.

• 전자공학회논문지A
• /
• 제29A권9호
• /
• pp.85-93
• /
• 1992

In this paper, the new timing optimization algorithm for combinational networks is proposed. First, we introduce the concept of P-path redundancy which is the extension of redundancy concept used in the testing of combinational networks. In this approach, the critical delay is minimized by removing the P-path redundant side inputs of the critical path, and more accurate timing optimization is possible by systematically considering the statically unsensitizable paths as well as the statically sensitizable paths. It's possible with all previous longest path based approaches that the critical delay of resulting network after timing optimization may be even increased. However, the proposed method guarantees to exclude such a possibility, and can be applied to optimize the timing of combinational networks in technology independent, and dependent phase.

• Nuclear Engineering and Technology
• /
• 제54권10호
• /
• pp.3604-3613
• /
• 2022

The Physical Protection System (PPS) plays an important role and must effectively deal with various adversary attacks in nuclear security. In specific single adversary path scenarios, we can calculate the PPS effectiveness by EASI (Estimated Adversary Sequence Interruption) through Probability of Interruption (P_I) calculation. EASI uses a single value of the probability of detection (P_D) and the probability of alarm communications (P_C) in the PPS. In this study, we develop a multi-path analysis code based on EASI to evaluate the effectiveness of PPS. Our quantification method for P_I considers the variability and uncertainty of P_D and P_C value by Monte Carlo simulation. We converted the 2-D scheme of the nuclear facility into an Adversary Sequence Diagram (ASD). We used ASD to find the adversary path with the lowest probability of interruption as the most vulnerable paths (MVP). We examined a hypothetical facility (Hypothetical National Nuclear Research Facility - HNNRF) to confirm our code compared with EASI. The results show that implementing the variability extension can estimate the P_I value and its associated uncertainty. The multi-path analysis code allows the analyst to make it easier to assess PPS with more extensive facilities with more complex adversary paths. However, the variability of the P_D value in each protection element allows a significant decrease in the PI value. The possibility of this decrease needs to be an important concern for PPS designers to determine the P_D value correctly or set a higher standard for PPS performance that remains reliable.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1999년도 가을 학술발표논문집 Vol.26 No.2 (3)
• /
• pp.414-416
• /
• 1999

무선 ATM은 무선 멀티미디어 서비스를 종단간 ATM 기술로 제공하는 전송방식으로 최근에 그 요구가 급증하여 단말기의 개발과 보급이 폭증하고 있다. 이에 따라 사용자 및 전송용량의 증가로 인하여 셀의 크기가 작아지게 되고 더 많은 핸드오프가 발생하게 되는데, 좀 더 빠르고 망 자원을 보다 효율적으로 이용하도록 하기 위한 기법들에 대한 연구가 증대되고 있다. 본 논문에서는 보다 빠른 핸드오프를 위하여 사용되어지는 여러 가지 routing 방법들 중 단말기가 접속된 기지국이 바뀔 경우 VC(Victual Connection)를 재설정하는 방식인 Path Extension과 Path Rerouting을 사용하여 LAN 환경에서 해당 MSC에 속한 BS의 개수에 따라 어떠한 VC path length와 receive latencies를 나타내는지 비교하여 핸드오프 지연이 보다 적은 기법을 제안한다.