• Title/Summary/Keyword: Path extension

Search Result 154, Processing Time 0.028 seconds

Path Planning Algorithm for Mobile Robot using Region Extension (영역 확장을 이용한 이동 로봇의 경로 설정)

  • Kwak, Jae-Hyuk;Lim, Joon-Hong
    • 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.

  • PDF

A Comparative Analysis of Path Planning and Tracking Performance According to the Consideration of Vehicle's Constraints in Automated Parking Situations (자율주차 상황에서 차량 구속 조건 고려에 따른 경로 계획 및 추종 성능의 비교 분석)

  • Kim, Minsoo;Ahn, Joonwoo;Kim, Minsung;Shin, Minyong;Park, Jaeheung
    • The Journal of Korea Robotics Society
    • /
    • v.16 no.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.

Outbreak of Water Mass into the East Coast of Japan Evident in the Kuroshio Extension in June 2001

  • Yang Chan-Su;Suga Toshio
    • Korean Journal of Remote Sensing
    • /
    • v.20 no.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.

Performance Comparison of Path Reestablishment Schemes for a Backward Handover in Wireless ATM Networks (무선 ATM 망의 역방향 핸드오버에서 경로 재설정 방식에 따른 성능 비교)

  • 전협우;김도현
    • Proceedings of the IEEK Conference
    • /
    • 1998.10a
    • /
    • 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.

  • PDF

The Effect of Ambient Sadness on Hedonic Choice

  • Choi, Nak-Hwan;Oyunbileg, Tamir;Tsogtbayar, Naranzul
    • Journal of Distribution Science
    • /
    • v.13 no.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.

The Effectiveness of Image and Attitude on Extension Brand Loyalty in the Foodservice Industry (확장된 외식브랜드이미지와 브랜드태도가 브랜드충성도에 미치는 영향에 관한 연구)

  • Kwon, Kum-Tack
    • Management & Information Systems Review
    • /
    • v.28 no.2
    • /
    • pp.1-19
    • /
    • 2009
  • In the severely competitive market, brand extension strategy has become a key strategy to the companies that are trying to expand in the new market and to cut down the marketing cost. In conclusion, following results are deduced. First, hypothesis 1(H-1) refers to the relationship between image of extension brand and attitude of extension brand, and it shows path-coefficients value of 0.43, and t-value of 4.21 which supports the hypothesis statistically. Second, H-2 is the result of the analysis of relationship between attitude of extension brand and loyalty of extension brand and consequently the hypothesis is supported by the path-coefficients value of 0.29 and t-value of 3.08. The results of this study provided very useful information for both foodservice industry and academics. At first, in the theocratical point of view, this study suggests a new concept the foodservice brand extension. Consequently in marketing point of view, the results of this study recommend several strategies of foodservice brand extension using foodservice image, attitude and loyalty.

  • PDF

Loop Cancellation and Path Optimization of Path Extension Handover in a Wireless ATM LAN (무선 ATM LAN 환경에서 경로 확장 기법의 루프 제거 및 경로 최적화 알고리즘 연구)

  • 최우진;박영근
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.5A
    • /
    • pp.602-610
    • /
    • 2000
  • There has been increasing interest in broadband services to mobile terminals. Wireless ATM will be used to support broadband services for future generation mobile service. We propose an algorithm for handover in wireless ATM LANs. We have studied how to treat the loop cancellation and optimization of path extension handover scheme, and present path optimization algorithms : polyangular loop cancellation and triangular loop cancellation. We express the location of MT(mobile terminal) by direction angle, and the direction angles can be converted into direction vectors. Using direction vectors, we can find the current optimal path of MT. The analysis and the experimental results show that the proposed scheme provides the better performance than that of anchor rerouting scheme in average handover delay, handover disruption delay, and buffer requirements.

  • PDF

Path-based new Timing Optimization Algorithm for Combinational Networks (조합논리회로를 위한 새로운 Path-Based 타이밍 최적화 알고리듬)

  • 양세양;홍봉희
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.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.

  • PDF

The development of EASI-based multi-path analysis code for nuclear security system with variability extension

  • Andiwijayakusuma, Dinan;Setiadipura, Topan;Purqon, Acep;Su'ud, Zaki
    • Nuclear Engineering and Technology
    • /
    • v.54 no.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 (PI) calculation. EASI uses a single value of the probability of detection (PD) and the probability of alarm communications (PC) 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 PI considers the variability and uncertainty of PD and PC 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 PI 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 PD 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 PD value correctly or set a higher standard for PPS performance that remains reliable.

Virtual Channel Re-establishment Scheme for Shortest Path in WATM LAN (무선 ATM LAN 핸드오프에서 Shortest Path를 위한 가상채널 재설정 기법)

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

  • PDF