知识卡片

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

最近邻距离需尊重状态几何

理解等级:中级

欧氏位置、周期角度与不同关节尺度不能随意混合,角度跨±π的差需用正确拓扑。空间索引可加速查邻,却受维度和数据分布影响;不能仅因使用k-d树就保证任何高维查询或插入都有相同对数耗时。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Intuitively, the new point q_rand should be connected to the closest point already in the tree or to the goal. This requires iterating over all nodes in the tree and calculating their distance to the candidate point q_rand, which is a computationally expensive process; the resulting point q_nearest is the one with the shortest distance. The selection of the right data structure for storing the

    参考来源

    - 位置:《Introduction to Autonomous Robots Mechanisms, Sensors, Actuators, and Algorithms (Nikolaus Correll, Bradley Hayes etc.)》第13章《路径规划》(来源项目: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_13.xhtml) - 结论依据:摘录中关于最近邻距离需尊重状态几何的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Intuitively, the new point q_rand should be connected to the closest point already in the tree or to the goal. This requires iterating over all nodes in the tree and calculating their distance to the candidate point q_rand, which is a computationally expensive process; the resulting point q_nearest is the one with the shortest distance. The selection of the right data structure for storing the