知识卡片

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

带先验后验优化属于MAP

理解等级:中级

最大化轨迹与地图的后验并保留先验项时是最大后验估计。只最大化测量似然才是最大似然;固定坐标基准或忽略常量先验可能使两者某些解一致,不能混称所有情况。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      The classical formulation of SLAM describes the problem as maximizing the posterior probability of all points on the robot’s trajectory given the odometry input and the observations. Formally, where x1:T represents all discrete positions from time t ∈ (1,T), z the observations, and u the odometry measurements. This formulation makes heavy use of the temporal structure of the problem. In practice, solving the SLAM problem

    参考来源

    - 位置:《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) - 结论依据:摘录中关于带先验后验优化属于MAP的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:The classical formulation of SLAM describes the problem as maximizing the posterior probability of all points on the robot’s trajectory given the odometry input and the observations. Formally, where x1:T represents all discrete positions from time t ∈ (1,T), z the observations, and u the odometry measurements. This formulation makes heavy use of the temporal structure of the problem. In practice, solving the SLAM problem