Carnegie Mellon University
file.pdf (559.79 kB)
Download file

A Multi-Hypothesis Topological SLAM Approach for Loop Closing on Edge-Ordered Graphs

Download (559.79 kB)
journal contribution
posted on 2009-10-01, 00:00 authored by Stephen Tully, George Kantor, Howie Choset, Felix Werner

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 of the hypothesis tree keeps the growing number of hypotheses under control and a recursive formulation reduces storage and computational costs. Experiments are used to validate the approach.




Usage metrics