Login / Signup
A comparison of SLAM algorithms based on a graph of relations.
Wolfram Burgard
Cyrill Stachniss
Giorgio Grisetti
Bastian Steder
Rainer Kümmerle
Christian Dornhege
Michael Ruhnke
Alexander Kleiner
Juan D. Tardós
Published in:
IROS (2009)
Keyphrases
</>
graph theory
computational complexity
learning algorithm
real time
significant improvement
minimum spanning tree
worst case
structured data
graph search
depth first search
web graph
spanning tree
theoretical analysis
np complete
computational cost
mobile robot
np hard
web pages