Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006.
DOI: 10.1109/robot.2006.1642040
|View full text |Cite
|
Sign up to set email alerts
|

Fast iterative alignment of pose graphs with poor initial estimates

Abstract: A robot exploring an environment can estimate its own motion and the relative positions of features in the environment. Simultaneous Localization and Mapping (SLAM) algorithms attempt to fuse these estimates to produce a map and a robot trajectory. The constraints are generally non-linear, thus SLAM can be viewed as a non-linear optimization problem. The optimization can be difficult, due to poor initial estimates arising from odometry data, and due to the size of the state space.We present a fast non-linear o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
400
1

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 368 publications
(402 citation statements)
references
References 12 publications
(14 reference statements)
1
400
1
Order By: Relevance
“…One solution would be to optimise over relative constraints between poses using pose-graph optimisation [12] [23]. The relative constraints between two poses T i and T j can be calculated easily:…”
Section: B Loop Closure Correctionmentioning
confidence: 99%
“…One solution would be to optimise over relative constraints between poses using pose-graph optimisation [12] [23]. The relative constraints between two poses T i and T j can be calculated easily:…”
Section: B Loop Closure Correctionmentioning
confidence: 99%
“…Many iterative solutions to the SLAM problem have been presented, such as stochastic gradient descent [28,60], relaxation [10], preconditioned conjugate gradient [43], and loopy belief propagation [63].…”
Section: Pose Graph Optimization Using Smoothing and Mappingmentioning
confidence: 99%
“…Other pure 6D SLAM backends such as the tree optimizer by Olson et al (Olson, Leonard, & Teller, 2006) are becomming available (Grisetti, Grzonka, Stachniss, Pfaff, & Burgard, 2007).…”
Section: Mapping Environments In Three Dimensionsmentioning
confidence: 99%
“…The SLAM backend uses fast matrix computations exploiting the sparse structure of the corresponding SLAM graphs (Davis, 2006). Other backends such as Olson's graph optimization, extended to six DoF (Kaess, Ranganathan, & Dellaert, 2007;Olson et al, 2006) or treemap by Frese (2007), might be used as well. Using different paths in Figure 3, the different mapping strategies are created.…”
Section: Mapping Strategiesmentioning
confidence: 99%