UKF (SLAM Algorithms SLAM Algorithms)
Jump to navigation
Jump to search
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