UKF (SLAM Algorithms SLAM Algorithms): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == $O(n^{2})$? words? ((can be easily derived? it's mostly square matrices here)) == Description == == Approximate? == Approximate Approximation Factor: == Randomized? == No, deterministic == Model of Computation == == Year == 2000 == Reference == https://www.seas.harvard.edu/courses/cs281/papers/unscented.pdf") |
No edit summary |
||
| Line 25: | Line 25: | ||
== Model of Computation == | == Model of Computation == | ||
Real RAM? | |||
== Year == | == Year == | ||
Latest revision as of 08:32, 10 April 2023
Time Complexity
$O(n^{3})$
Space Complexity
$O(n^{2})$? words?
((can be easily derived? it's mostly square matrices here))
Description
Approximate?
Approximate
Approximation Factor:
Randomized?
No, deterministic
Model of Computation
Real RAM?
Year
2000
Reference
https://www.seas.harvard.edu/courses/cs281/papers/unscented.pdf