빠른 루프 클로징을 위한 2D포즈 노드 샘플링 휴리스틱

다국어 초록 (Multilingual Abstract)

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.

목차 (Table of Contents)

• Abstract
• I. 서론
• II. 루프 클로징
• III. 포즈 노드와 스캔 매칭
• IV. 포즈 노드 Scoring
• V. 실험
• VI. 실험 결과
• VII. 결론
• REFERENCES

참고문헌 (Reference)

1 염서군, "누적 센서 데이터 갱신을 이용한 아크/라인 세그먼트 기반 SLAM" 제어·로봇·시스템학회 21 (21): 936-943, 2015

2 R. Kümmerle, "g2o: A general framework for graph optimization" 3607-3613, 2011

3 H. Durrant-Whyte, "Simultaneous localisation and mapping (SLAM): Part I the essential algorithms" 13 (13): 99-108, 2006

4 송재복, "SLAM 기술의 과거와 현재" 제어·로봇·시스템학회 20 (20): 372-379, 2014

5 E. Olson, "Recognizing places using spectrally clustered local matches" 57 (57): 1157-1172, 2009

6 E. Olson, "Real-time correlative scan matching" 4387-4393, 2009

7 T. Cieslewski, "Point cloud descriptors for place recognition using sparse visual information" 4830-4836,

8 J. Guivant, "Optimization of the simultaneous localization and map building algorithm for real time implementation" 17 (17): 242-257, 2001

9 K. S. Arun, "Least-squares fitting of two 3-d point sets" 9 (9): 698-700, 1987

10 H. Kretzschmar, "Information-theoretic compression of pose graphs for laser-based SLAM" 31 (31): 1219-1230, 2012

11 F. Lu, "Globally consistent range scan alignment for environment mapping" 4 (4): 333-349, 1997

12 M. Montemerlo, "FastSLAM: A factored solution to the simultaneous localization and mapping problem with unknown data association" Carnegie Mellon University 2003

13 F. Kallasi, "Fast keypoint features from laser scanner for robot localization and mapping" 1 (1): 176-183, 2016

14 G. D. Tipaldi, "FLIRT - Interest regions for 2D range data" 3616-3622, 2010

15 A. Geiger, "Are we ready for autonomous driving? The KITTI vision benchmark suite" 3354-3361, 2012

16 C. Stachniss, "2D SLAM Dataset"