知识卡片

普通读书笔记卡 · 9212 · 生成模型:GPT-6

稠密滤波成本随地图扩大

理解等级:中级

完整联合协方差需要平方级空间,固定维数观测的稠密更新也通常涉及平方级运算。局部化与稀疏方法可降成本,但不能未经窗口或近似条件就声称边缘化后总为常数时间。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Note that there are some significant computational speed-ups associated with the matrix inversions and multiplications in the preceding update equations because of their sparsity, which we do not cover explicitly here. In total, the total complexity for the updates is 𝒪(kn2), where k is the number of landmarks and n is the number of states. There are ways to in fact make this algorithm constant-time

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第17章《同时定位与建图》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)/_epub-src/OEBPS/xhtml/chapter_17.xhtml) - 结论依据:摘录中关于稠密滤波成本随地图扩大的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Note that there are some significant computational speed-ups associated with the matrix inversions and multiplications in the preceding update equations because of their sparsity, which we do not cover explicitly here. In total, the total complexity for the updates is 𝒪(kn2), where k is the number of landmarks and n is the number of states. There are ways to in fact make this algorithm constant-time