知识卡片

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

定位方法按分布形状选择

理解等级:中级

网格可保留显式多峰,粒子以样本分配计算,EKF用单个局部高斯表示更紧凑。粒子滤波不是把Markov与Kalman机械拼接,也不必须含Kalman组件;选择要看初始歧义、维数、模型与可用计算。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      • An approximation that combines benefits of Markov localization (multiple hypothesis) and the Kalman filter (continuous representation of position estimates) is the particle filter. Exercises 1. Assume that the ceiling is equipped with infrared markers that the robot can identify with some certainty. Your task is to develop a probabilistic localization scheme, and you would like to calculate the probability p(marker|reading) of being close to

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第16章《定位》(来源项目: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_16.xhtml) - 结论依据:摘录中关于定位方法按分布形状选择的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:• An approximation that combines benefits of Markov localization (multiple hypothesis) and the Kalman filter (continuous representation of position estimates) is the particle filter. Exercises 1. Assume that the ceiling is equipped with infrared markers that the robot can identify with some certainty. Your task is to develop a probabilistic localization scheme, and you would like to calculate the probability p(marker|reading) of being close to