FastSlam (SLAM Algorithms SLAM Algorithms)

From Algorithm Wiki
Revision as of 10:42, 15 February 2023 by Admin (talk | contribs) (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")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=FastSlam_(SLAM_Algorithms_SLAM_Algorithms)&oldid=44806"