.png){kind=icon}
返回
A multilevel relaxation algorithm for simultaneous localization and mapping
.png){kind=icon}
PRE
AI
DOI：10.1109/TRO.2004.839220.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the problem of simultaneous localization and mapping (SLAM) by a mobile robot. An incremental SLAM algorithm is introduced that is derived from multigrid methods used for solving partial differential equations. The approach improves on the performance of previous relaxation methods for robot mapping, because it optimizes the map at multiple levels of resolution. The resulting algorithm has an update time that is linear in the number of estimated features for typical indoor environments, even when closing very large loops, and offers advantages in handling nonlinearities compared with other SLAM algorithms. Experimental comparisons with alternative algorithms using two well-known data sets and mapping results on a real robot are also presented.
Keyword:
Galerkin multigrid
Gauss-Seidel relaxation
metric-topological maps
mobile robot navigation
simultaneous localization and mapping (SLAM)
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.5
论文数:
3.3K
被引数:
2.8W
机构
暂无机构信息
引用论文
A probabilistic approach to concurrent mapping and localization for mobile robots.png)
MACHINE LEARNING
MACHINE LEARNINGIF2.9
PREAI
分享收藏
查看更多内容