FastSlam (SLAM Algorithms SLAM Algorithms): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(m*log n)$ per iteration == Space Complexity == $O(mn)$? words? (Stores and updates a balanced binary tree of n elements/dimensions per particle) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2003 == Reference == http://robots.stanford.edu/papers/montemerlo.fastslam-tr.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(m*log n)$ per iteration | $O(m*\log n)$ per iteration | ||
== Space Complexity == | == Space Complexity == | ||
| Line 25: | Line 25: | ||
== Model of Computation == | == Model of Computation == | ||
Real RAM? | |||
== Year == | == Year == | ||
Latest revision as of 08:39, 10 April 2023
Time Complexity
$O(m*\log n)$ per iteration
Space Complexity
$O(mn)$? words?
(Stores and updates a balanced binary tree of n elements/dimensions per particle)
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
2003
Reference
http://robots.stanford.edu/papers/montemerlo.fastslam-tr.pdf