.png){kind=icon}
Return
MASAT: A fast and robust algorithm for pose-graph initialization
.png){kind=icon}
OA
AI
DOI：10.1016/j.patrec.2019.11.010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we propose a novel algorithm to compute the initial structure of pose-graph based Simultaneous Localization and Mapping (SLAM) systems. We perform a Breadth-First Search (BFS) on the graph in order to obtain multiple votes regarding the location of a certain robot position from all of its previously processed neighbors. Next, we define the initial location of a pose as the average of the multiple alternatives. By adopting the proposed initialization approach, the number of iterations needed for optimization is significantly reduced while the computational complexity remains lightweight. We perform quantitative evaluation on various 2D and 3D benchmark datasets to demonstrate the advantages of the proposed method. (C) 2019 The Authors. Published by Elsevier B.V.
Keywords:
EFFICIENT
ALIGNMENT
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
3.3
Papers:
7.9K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave no more
no more