Unverified50% confidenceFactExact time
FastSLAM, proposed by Montemerlo et al., uses a Rao-Blackwellized particle filter to reduce the complexity to O(n·log(m))
1
Sources
50%
Confidence
Long-term
Relevance
8/9/2026
First Seen
Sources
视觉SLAM学习路线图全解析：从数学基础到工程实践
Related Claims
UnverifiedThe computational complexity of EKF-SLAM is O(n²) because the dimensions of the covariance matrix grow linearly with the number of landmarks65% similarUnverifiedShor算法将整数分解的复杂度从经典的亚指数级降至多项式级O((log N)³)64% similarUnverifiedThe Fast Fourier Transform reduces the computational complexity of the DFT from the naive O(N²) to O(N log N).64% similarUnverifiedThe Douglas-Peucker algorithm simplifies polylines by iteratively removing intermediate points whose deviation is below a threshold, with a time complexity of O(n log n).62% similarUnverifiedEarly SLAM methods were dominated by the Extended Kalman Filter (EKF-SLAM), whose computational complexity grows quadratically with the number of landmarks.59% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/714748API
curl https://kongchang.com/api/v1/knowledge/claims/714748MCP
get_claim(id=714748)