• Title/Summary/Keyword: $D^*$ Lite algorithm

Search Result 6, Processing Time 0.018 seconds

Efficient Online Path Planning Algorithm for Mobile Robots in Dynamic Indoor Environments (이동 로봇을 위한 동적 실내 환경에서의 효율적인 온라인 경로 계획 알고리즘)

  • Kang, Tae-Ho;Kim, Byung-Kook
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.7
    • /
    • pp.651-658
    • /
    • 2011
  • An efficient modified $D^*$ lite algorithm is suggested, which can perform online path planning for mobile robots in dynamic indoor environment. Online path planning should plan and execute alternately in a short time, and hence it enables the robot avoid unknown dynamic obstacles which suddenly appear on robot's path. Based on $D^*$ Lite algorithm, we improved representation of edge cost, heuristic function, and priority queue management, to build a modified $D^*$ Lite algorithm. Performance of the proposed algorithm is revealed via extensive simulation study.

A Study on the Improvement and Verification of D* Lite Algorithm for Autonomous Ship Paths (선박 자율 운항 경로를 위한 D* Lite 알고리즘 개선 및 검증에 관한 연구)

  • Yun-seung Shin;Hyung-jin Kwon;In-young Park;Hyun-ho Kwon;Dong-seop Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2023.11a
    • /
    • pp.1078-1079
    • /
    • 2023
  • 해양 분야에서의 정보기술 발전으로 선박 자율운항의 중요성이 증대되고 있다. 이에 선박 자율운항기술의 핵심인 경로 계획에는 그리드 기반 알고리즘이 주목을 받고 있다. 본 논문은 D* Lite 알고리즘을 선박자율운항에 적합하게 조정한 D* Opt 알고리즘을 소개하며, 기존 알고리즘과의 경로 비용 및 생성 시간을 비교 분석하여 성능을 확인한다. 이를 통해서 D* Opt 알고리즘이 선박 자율 운항경로 핵심기술로 응용 가능성과 기대효과를 제시한다.

Optimal Path Planning Algorithm for Visiting Multiple Mission Points in Dynamic Environments (동적 변화 환경에서 다중 임무점 방문을 위한 최적 경로 계획 알고리즘)

  • Lee, Hohyeong;Chang, Woohyuk;Jang, Hwanchol
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.47 no.5
    • /
    • pp.379-387
    • /
    • 2019
  • The complexity of path planning for visiting multiple mission points is even larger than that of single pair path planning. Deciding a path for visiting n mission points requires conducting $n^2+n$ times of single pair path planning. We propose Multiple Mission $D^*$ Lite($MMD^*L$) which is an optimal path planning algorithm for visiting multiple mission points in dynamic environments. $MMD^*L$ reduces the complexity by reusing the computational data of preceding single pair path planning. Simulation results show that the complexity reduction is significant while its path optimality is not compromised.

DL-RRT* algorithm for least dose path Re-planning in dynamic radioactive environments

  • Chao, Nan;Liu, Yong-kuo;Xia, Hong;Peng, Min-jun;Ayodeji, Abiodun
    • Nuclear Engineering and Technology
    • /
    • v.51 no.3
    • /
    • pp.825-836
    • /
    • 2019
  • One of the most challenging safety precautions for workers in dynamic, radioactive environments is avoiding radiation sources and sustaining low exposure. This paper presents a sampling-based algorithm, DL-RRT*, for minimum dose walk-path re-planning in radioactive environments, expedient for occupational workers in nuclear facilities to avoid unnecessary radiation exposure. The method combines the principle of random tree star ($RRT^*$) and $D^*$ Lite, and uses the expansion strength of grid search strategy from $D^*$ Lite to quickly find a high-quality initial path to accelerate convergence rate in $RRT^*$. The algorithm inherits probabilistic completeness and asymptotic optimality from $RRT^*$ to refine the existing paths continually by sampling the search-graph obtained from the grid search process. It can not only be applied to continuous cost spaces, but also make full use of the last planning information to avoid global re-planning, so as to improve the efficiency of path planning in frequently changing environments. The effectiveness and superiority of the proposed method was verified by simulating radiation field under varying obstacles and radioactive environments, and the results were compared with $RRT^*$ algorithm output.

Comparison and Analysis of Dense Optical Flow Algorithm for Realtime System (Dense Optical Flow 기술의 실시간 시스템 적용을 위한 성능 비교 및 분석)

  • Kim, Byungjoon;Seo, Changwook;Seo, Yongduek
    • Proceedings of the Korean Society of Broadcast Engineers Conference
    • /
    • 2020.11a
    • /
    • pp.215-216
    • /
    • 2020
  • Optical Flow는 컴퓨터 비전 분야의 많은 응용기술에 사용된다. 객체 탐지, 추적, 연속 영상 보간, 3D Reconstruction과 같은 최근에 활발히 연구되는 여러 분야에서 사용되는 기반 기술이다. 최근 딥러닝을 기반으로 한 다양한 연구가 활발히 진행되어 왔으며 높은 정확도를 보이고 있다. 이런 분야들은 많은 경우에 실시간 시스템에 적용되어 이미지로부터 정보를 연산한다. 본 논문은 MaskFlownet, SelFlow, LiteFlowNet2 등과 같은 높은 정확도를 가진 신경망 네트워크로 추정된 Optical Flow를 살펴본다. 각 신경망 네트워크로 얻어진 정확도를 비교하고 디스플레이 기술과 이미지 센서 기술의 발전으로 사용 수요가 많아진 고화질의 이미지를 실시간으로 처리하는 경우, 적용 가능한 Optical Flow의 성능을 분석하였다.

  • PDF

Implementation of Acoustic Echo Canceller with A Post-processor Using A Fixed-Point DSP (고정 소수점 DSP를 이용한 후처리기를 가지는 음향 반향제거기의 구현)

  • 이영호;박장식;박주성;손경식
    • Journal of Korea Multimedia Society
    • /
    • v.3 no.3
    • /
    • pp.263-271
    • /
    • 2000
  • In this paper, an acoustic echo canceller(AEC) is implemented by ADSP-2181. This AEC uses a noise robust adaptive algorithm and a postprocessing method which attenuates residual echo using cross-correlation between estimated error signal and microphone input signal. We propose new postprocessing method that uses two thresholds to prevent signal distortion after postprocessing and to improve the performance of AEC without extra computational burden. Through experiments using a 16 bit fixed-point DSP board (ADSP-2181 EZ-KIT Lite board), it is shown that the noise robust adaptive algorithm performs well in the double-talk situations and the convergence speed is comparable to NLMS. Using the postprocessor, ERLE is improved about 20 dB. As a result, the AEC with a postprocessor shows better performance than conventional ones.

  • PDF