• Title/Summary/Keyword: 불변 확장 칼만 필터

Search Result 4, Processing Time 0.022 seconds

Training Algorithm of Recurrent Neural Network Using a Sigma Point for Equalization of Channels (시그마 포인트를 이용한 채널 등화용 순환신경망 훈련 알고리즘)

  • Kwon, Oh-Shin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.11 no.4
    • /
    • pp.826-832
    • /
    • 2007
  • A recurrent neural network has been frequently used in equalizing the channel for fast communication systems. The existing techniques, however, have mainly dealt with time-invariant chamois. The modern environments of communication systems such as mobile ones have the time-varying feature due to fading. In this paper, powerful decision feedback - recurrent neural network is used as channel equalizer for nonlinear and time-varying system, and two kinds of algorithms, such as extended Kalman filter (EKF) and sigma-point Kalman filter (SPKF), are proposed; EKF is for fast convergence and good tracing function, and SPKF for overcoming the problems which can be developed during the process of first linearization for nonlinear system EKF.

Improvement of SLAM Using Invariant EKF for Autonomous Vehicles (Invariant EKF를 사용한 자율 이동체의 SLAM 개선)

  • Jeong, Da-Bin;Ko, Nak-Yong;Chung, Jun-Hyuk;Pyun, Jae-Young;Hwang, Suk-Seung;Kim, Tae-Woon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.15 no.2
    • /
    • pp.237-244
    • /
    • 2020
  • This paper describes an implement of Simultaneous Localization and Mapping(SLAM) in two dimensional space. The method uses Invariant Extended Kalman Filter(IEKF), which transforms the state variables and measurement variables so that the transformed variables constitute a linear space when variables called the invariant quantities are kept constant. Therefore, the IEKF guarantees convergence provided in the invariant quantities are kept constant. The proposed IEKF approach uses Lie group matrix for the transformation. The method is tested through simulation, and the results show that the Kalman gain is constant as it is the case for the linear Kalman filter. The coherence between the estimated locations of the vehicle and the detected objects verifies the estimation performance of the method.

Tracking Filter Dealing with Nonlinear Inherence as a System Input (비선형 특성을 시스템 입력으로 처리하는 추적 필터)

  • Shin, Sang-Jin
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.25 no.7
    • /
    • pp.774-781
    • /
    • 2014
  • The radar measurements are composed of range, Doppler and angles which are expressed as polar-coordinate components. An approach to match the measurements with the states of target dynamics which are modeled in cartesian coordinates is to use the pseudo-measurements or the extended Kalman filter in order to solve the mismatching problem. Another approach is that the states of dynamics are modeled in polar coordinates and measurement equation is linear. However, this approach bears that we have to deal with a time-varying dynamics. In this study, it is proposed that the states of dynamics are expressed as polar-coordinate component and the system matrix of the dynamic equation is modeled as a time-invariant. Nonlinear terms that appear due to the proposed modeling are regarded as a system input. The results of a series of simulation runs indicate that the tracking filter that uses the proposed modeling is viable from the fact that the Doppler measurement is easy to be augmented in the measurement equation.

The Implementation of Graph-based SLAM Using General Graph Optimization (일반 그래프 최적화를 활용한 그래프 기반 SLAM 구현)

  • Ko, Nak-Yong;Chung, Jun-Hyuk;Jeong, Da-Bin
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.4
    • /
    • pp.637-644
    • /
    • 2019
  • This paper describes an implementation of a graph-based simultaneous localization and mapping(SLAM) method called the General Graph Optimization. The General Graph Optimization formulates the SLAM problem using nodes and edges. The nodes represent the location and attitude of a robot in time sequence, and the edge between the nodes depict the constraint between the nodes. The constraints are imposed by sensor measurements. The General Graph Optimization solves the problem by optimizing the performance index determined by the constraints. The implementation is verified using the measurement data sets which are open for test of various SLAM methods.