2009 IEEE/RSJ International Conference on Intelligent Robots and Systems 2009
DOI: 10.1109/iros.2009.5354255
|View full text |Cite
|
Sign up to set email alerts
|

A multi-hypothesis topological SLAM approach for loop closing on edge-ordered graphs

Abstract: We present a method for topological SLAM that specifically targets loop closing for edge-ordered graphs. Instead of using a heuristic approach to accept or reject loop closing, we propose a probabilistically grounded multi-hypothesis technique that relies on the incremental construction of a map/state hypothesis tree. Loop closing is introduced automatically within the tree expansion, and likely hypotheses are chosen based on their posterior probability after a sequence of sensor measurements. Careful pruning … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
30
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
2

Relationship

1
6

Authors

Journals

citations
Cited by 23 publications
(30 citation statements)
references
References 15 publications
(18 reference statements)
0
30
0
Order By: Relevance
“…Tully et al [16] proposed a hypothesis tree approach for loop-closing where the branches that are deemed to be unlikely based on metric and topological GVG information are pruned. Among their pruning tests, it is worthwhile to mention the planarity test which ensures that once a loopclosure has been accepted, the resulting GVG graph has to be planar.…”
Section: Related Workmentioning
confidence: 99%
“…Tully et al [16] proposed a hypothesis tree approach for loop-closing where the branches that are deemed to be unlikely based on metric and topological GVG information are pruned. Among their pruning tests, it is worthwhile to mention the planarity test which ensures that once a loopclosure has been accepted, the resulting GVG graph has to be planar.…”
Section: Related Workmentioning
confidence: 99%
“…al in [4] propose a hierarchical map where the GVG serves as a high-level representation of the environment that organizes a collection of lower level featurebased submaps. This hierarchical map was later used for efficient topological localization [9] and multi-hypothesis SLAM [10] in large-scale environments. We note that many of the ideas we present in this paper can be easily extended to a hierarchical approach via the inclusion of additional metric information along the edges in the S-GVG topological graph.…”
Section: Related Workmentioning
confidence: 99%
“…In [12], a RaoBlackwellized particle filter is implemented over the space of topologies. In [10], we propose a similar probabilistically grounded multi-hypothesis technique that builds a map/state hypothesis tree for topological SLAM. The SLAM method we are proposing in this paper for the S-GVG is an extension of our previous work and customizes the SLAM algorithm for dealing with a combination of both saturated and conventional GVG regions.…”
Section: Related Workmentioning
confidence: 99%
See 2 more Smart Citations