Rao-Blackwellized Particle Filtering SLAM (SLAM Algorithms SLAM Algorithms)
Jump to navigation
Jump to search
Time Complexity
$O(n^{2})$
Space Complexity
$O(n)$? words?
((based on Section 4 of the paper?))
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
2001
Reference
https://papers.nips.cc/paper/1716-bayesian-map-learning-in-dynamic-environments.pdf