UKF (SLAM Algorithms SLAM Algorithms)
Revision as of 10:35, 15 February 2023 by Admin (talk | contribs) (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")
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