• Title/Summary/Keyword: FastSLAM

Search Result 17, Processing Time 0.024 seconds

A Practical FastSLAM Implementation Method using an Infrared Camera for Indoor Environments (실내 환경에서 Infrared 카메라를 이용한 실용적 FastSLAM 구현 방법)

  • Zhang, Hairong;Lee, Heon-Cheol;Lee, Beom-Hee
    • The Journal of Korea Robotics Society
    • /
    • v.4 no.4
    • /
    • pp.305-311
    • /
    • 2009
  • FastSLAM is a factored solution to SLAM problem using a Rao-Blackwellized particle filter. In this paper, we propose a practical FastSLAM implementation method using an infrared camera for indoor environments. The infrared camera is equipped on a Pioneer3 robot and looks upward direction to the ceiling which has infrared tags with the same height. The infrared tags are detected with theinfrared camera as measurements, and the Nearest Neighbor method is used to solve the unknown data association problem. The global map is successfully built and the robot pose is predicted in real time by the FastSLAM2.0 algorithm. The experiment result shows the accuracy and robustness of the proposed method in practical indoor environment.

  • PDF

An Improved FastSLAM Algorithm using Fitness Sharing Technique (적합도 공유 기법을 적용한 향상된 FastSLAM 알고리즘)

  • Kwon, Oh-Sung;Hyeon, Byeong-Yong;Seo, Ki-Sung
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.22 no.4
    • /
    • pp.487-493
    • /
    • 2012
  • SLAM(Simultaneous Localization And Mapping) is a technique used by robots and autonomous vehicles to build up a map within an unknown environment and estimate a place of robot. FastSLAM(A Factored Solution to the SLAM) is one of representative method of SLAM, which is based on particle filter and extended Kalman filter. However it is suffered from loss of particle diversity. In this paper, new approach using fitness sharing is proposed to supplement loss of particle diversity, compared and analyzed with existing methods.

An Improved Resampling Technique using Particle Density Information in FastSLAM (FastSLAM 에서 파티클의 밀도 정보를 사용하는 향상된 Resampling 기법)

  • Woo, Jong-Suk;Choi, Myoung-Hwan;Lee, Beom-Hee
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.15 no.6
    • /
    • pp.619-625
    • /
    • 2009
  • FastSLAM which uses the Rao-Blackwellized particle filter is one of the famous solutions to SLAM (Simultaneous Localization and Mapping) problem that estimates concurrently a robot's pose and surrounding environment. However, the particle depletion problem arises from the loss of the particle diversity in the resampling process of FastSLAM. Then, the performance of FastSLAM degenerates over the time. In this work, DIR (Density Information-based Resampling) technique is proposed to solve the particle depletion problem. First, the cluster is constructed based on the density of each particle, and the density of each cluster is computed. After that, the number of particles to be reserved in each cluster is determined using a linear method based on the distance between the highest density cluster and each cluster. Finally, the resampling process is performed by rejecting the particles which are not selected to be reserved in each cluster. The performance of the DIR proposed to solve the particle depletion problem in FastSLAM was verified in computer simulations, which significantly reduced both the RMS position error and the feature error.

Geographical Group-based FastSLAM Algorithm for Maintenance of the Diversity of Particles (파티클 다양성 유지를 위한 지역적 그룹 기반 FastSLAM 알고리즘)

  • Jang, June-Young;Ji, Sang-Hoon;Park, Hong Seong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.19 no.10
    • /
    • pp.907-914
    • /
    • 2013
  • A FastSLAM is an algorithm for SLAM (Simultaneous Localization and Mapping) using a Rao-Blackwellized particle filter and its performance is known to degenerate over time due to the loss of particle diversity, mainly caused by the particle depletion problem in the resampling phase. In this paper, the GeSPIR (Geographically Stratified Particle Information-based Resampling) technique is proposed to solve the particle depletion problem. The proposed algorithm consists of the following four steps : the first step involves the grouping of particles divided into K regions, the second obtaining the normal weight of each region, the third specifying the protected areas, and the fourth resampling using regional equalization weight. Simulations show that the proposed algorithm obtains lower RMS errors in both robot and feature positions than the conventional FastSLAM algorithm.

OpenVSLAM-based Cooperative Mobile AR System Architecture (OpenVSLAM 기반의 협력형 모바일 SLAM 시스템 설계)

  • Kook, Joongjin
    • Journal of the Semiconductor & Display Technology
    • /
    • v.21 no.1
    • /
    • pp.136-141
    • /
    • 2022
  • In this paper, we designed, implemented, and verified the SLAM system that can be used on mobile devices. Mobile SLAM is composed of a stand-alone type that directly performs SLAM operation on a mobile device, and a mapping server type that additionally configures a mapping server based on FastAPI to perform SLAM operation on the server and transmits data for map visualization to a mobile device. The mobile SLAM system proposed in this paper is to mix the two types in order to make SLAM operation and map generation more efficient. The stand-alone type SLAM system was configured as an Android app by porting the OpenVSLAM library to the Unity engine, and the map generation and performance were evaluated on desktop PCs and mobile devices. The mobile SLAM system in this paper is an open source project, so it is expected to help develop AR contents based on SLAM in a mobile environment.

2D Pose Nodes Sampling Heuristic for Fast Loop Closing (빠른 루프 클로징을 위한 2D 포즈 노드 샘플링 휴리스틱)

  • Lee, Jae-Jun;Ryu, Jee-Hwan
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.22 no.12
    • /
    • pp.1021-1026
    • /
    • 2016
  • The graph-based SLAM (Simultaneous Localization and Mapping) approach has been gaining much attention in SLAM research recently thanks to its ability to provide better maps and full trajectory estimations when compared to the filtering-based SLAM approach. Even though graph-based SLAM requires batch processing causing it to be computationally heavy, recent advancements in optimization and computing power enable it to run fast enough to be used in real-time. However, data association problems still require large amount of computation when building a pose graph. For example, to find loop closures it is necessary to consider the whole history of the robot trajectory and sensor data within the confident range. As a pose graph grows, the number of candidates to be searched also grows. It makes searching the loop closures a bottleneck when solving the SLAM problem. Our approach to alleviate this bottleneck is to sample a limited number of pose nodes in which loop closures are searched. We propose a heuristic for sampling pose nodes that are most advantageous to closing loops by providing a way of ranking pose nodes in order of usefulness for closing loops.

Past and State-of-the-Art SLAM Technologies (SLAM 기술의 과거와 현재)

  • Song, Jae-Bok;Hwang, Seo-Yeon
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.20 no.3
    • /
    • pp.372-379
    • /
    • 2014
  • This paper surveys past and state-of-the-art SLAM technologies. The standard methods for solving the SLAM problem are the Kalman filter, particle filter, graph, and bundle adjustment-based methods. Kalman filters such as EKF (Extended Kalman Filter) and UKF (Unscented Kalman Filter) have provided successful results for estimating the state of nonlinear systems and integrating various sensor information. However, traditional EKF-based methods suffer from the increase of computation burden as the number of features increases. To cope with this problem, particle filter-based SLAM approaches such as FastSLAM have been widely used. While particle filter-based methods can deal with a large number of features, the computation time still increases as the map grows. Graph-based SLAM methods have recently received considerable attention, and they can provide successful real-time SLAM results in large urban environments.

Modified ORB-SLAM Algorithm for Precise Indoor Navigation of a Mobile Robot (모바일로봇의 정밀 실내주행을 위한 개선된 ORB-SLAM 알고리즘)

  • Ock, Yongjin;Kang, Hosun;Lee, Jangmyung
    • The Journal of Korea Robotics Society
    • /
    • v.15 no.3
    • /
    • pp.205-211
    • /
    • 2020
  • In this paper, we propose a modified ORB-SLAM (Oriented FAST and Rotated BRIEF Simultaneous Localization And Mapping) for precise indoor navigation of a mobile robot. The exact posture and position estimation by the ORB-SLAM is not possible all the times for the indoor navigation of a mobile robot when there are not enough features in the environment. To overcome this shortcoming, additional IMU (Inertial Measurement Unit) and encoder sensors were installed and utilized to calibrate the ORB-SLAM. By fusing the global information acquired by the SLAM and the dynamic local location information of the IMU and the encoder sensors, the mobile robot can be obtained the precise navigation information in the indoor environment with few feature points. The superiority of the modified ORB-SLAM was verified to compared with the conventional algorithm by the real experiments of a mobile robot navigation in a corridor environment.

Approaches to Probabilistic Localization and Tracking for Autonomous Mobility Robot in Unknown Environment (미지환경에서 무인이동체의 자율주행을 위한 확률기반 위치 인식과 추적 방법)

  • Jin, Taeseok
    • Journal of the Korean Society of Industry Convergence
    • /
    • v.25 no.3
    • /
    • pp.341-347
    • /
    • 2022
  • This paper presents a comparison result of two simultaneous localization and mapping (SLAM) algorithms for navigation that have been proposed in literature. The performances of Extended Kalman Filter (EKF) SLAM under Gaussian condition, FastSLAM algorithms using Rao-Blackwellised method for particle filtering are compared in terms of accuracy of state estimations for localization of a robot and mapping of its environment. The algorithms were run using the same type of robot on indoor environment. The results show that the Particle filter based FastSLAM has the better performance in terms of accuracy of localization and mapping. The experimental results are discussed and compared.

Path-planning using Modified Genetic Algorithm and SLAM based on Feature Map for Autonomous Vehicle (자율주행 장치를 위한 수정된 유전자 알고리즘을 이용한 경로계획과 특징 맵 기반 SLAM)

  • Kim, Jung-Min;Heo, Jung-Min;Jung, Sung-Young;Kim, Sung-Shin
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.3
    • /
    • pp.381-387
    • /
    • 2009
  • This paper is presented simultaneous localization and mapping (SLAM) based on feature map and path-planning using modified genetic algorithm for efficient driving of autonomous vehicle. The biggest problem for autonomous vehicle from now is environment adaptation. There are two cases that its new location is recognized in the new environment and is identified under unknown or new location in the map related kid-napping problem. In this paper, SLAM based on feature map using ultrasonic sensor is proposed to solved the environment adaptation problem in autonomous driving. And a modified genetic algorithm employed to optimize path-planning. We designed and built an autonomous vehicle. The proposed algorithm is applied the autonomous vehicle to show the performance. Experimental result, we verified that fast optimized path-planning and efficient SLAM is possible.