Look-ahead proposals for robust grid-based SLAM

被引:0
|
作者
Grzonka, Slawomir [1 ]
Plagemann, Christian [1 ]
Grisetti, Giorgio [1 ]
Burgard, Wolfram [1 ]
机构
[1] Univ Freiburg, Dept Comp Sci, D-79110 Freiburg, Germany
关键词
D O I
暂无
中图分类号
TP24 [机器人技术];
学科分类号
080202 ; 1405 ;
摘要
Simultaneous Localization and Mapping (SLAM) is one of the classical problems in mobile robotics. The task is to build a map of the environment using on-board sensors while at the same time localizing the robot relative to this map. Rao-Blackwellized particle filters have emerged as a powerful technique for solving the SLAM problem in a wide variety of environments. It is a well-known fact for sampling-based approaches that the choice of the proposal distribution greatly influences the robustness and efficiency achievable by the algorithm. In this paper, we present a significantly improved proposal distribution for grid-based SLAM, which utilizes whole sequences of sensor measurements rather than only the most recent one. We have implemented our system on a real robot and evaluated its performance on standard data sets as well as in hard outdoor settings with few and ambiguous features. Our approach improves the localization accuracy and the map quality. At the same time, it substantially reduces the risk of mapping failures.
引用
收藏
页码:329 / 338
页数:10
相关论文
共 50 条
  • [41] A classification of noncircular attribute grammars based on the look-ahead behavior
    Yang, W
    IEEE TRANSACTIONS ON SOFTWARE ENGINEERING, 2002, 28 (03) : 210 - 227
  • [42] Bridging the gap between feature- and grid-based SLAM
    Wurm, Kai M.
    Stachniss, Cyrill
    Grisetti, Giorgio
    ROBOTICS AND AUTONOMOUS SYSTEMS, 2010, 58 (02) : 140 - 148
  • [43] Optimized look-ahead tree policies: a bridge between look-ahead tree policies and direct policy search
    Jung, Tobias
    Wehenkel, Louis
    Ernst, Damien
    Maes, Francis
    INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING, 2014, 28 (3-5) : 255 - 289
  • [44] Projection-Based and Look-Ahead Strategies for Atom Selection
    Chatterjee, Saikat
    Sundman, Dennis
    Vehkapera, Mikko
    Skoglund, Mikael
    IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (02) : 634 - 647
  • [45] Counting-based look-ahead schemes for constraint satisfaction
    Kask, K
    Dechter, R
    Gogate, V
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 317 - 331
  • [46] Development of look-ahead NURBS interpolation based on the exponential function
    Nie, Mingxing
    Zhou, Aijun
    JOURNAL OF COMPUTATIONAL METHODS IN SCIENCES AND ENGINEERING, 2022, 22 (05) : 1681 - 1696
  • [47] Efficient language model look-ahead probabilities generation using lower order LM look-ahead information
    Chen, Langzhou
    Chin, K. K.
    2008 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING, VOLS 1-12, 2008, : 4925 - 4928
  • [48] Flexible Look-Ahead Dispatch Realized by Robust Optimization Considering CVaR of Wind Power
    Li, Peng
    Yu, Danwen
    Yang, Ming
    Wang, Jianhui
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2018, 33 (05) : 5330 - 5340
  • [49] Efficient Robust Look-Ahead Dispatch Incorporating Critical Region Preparation in Gap Time
    Zheng, Weiye
    Li, Zhigang
    Huansheng, Zhou
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2021, 36 (05) : 4840 - 4843
  • [50] Tissue P Systems with Look-ahead Mode
    JIANG Yun
    SONG Tao
    ZHANG Zheng
    Chinese Journal of Electronics, 2014, 23 (01) : 81 - 86