知识卡片

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

路径平滑后需要重新检查约束

理解等级:中级

样条或快捷连接可减少折线,却可能切过障碍、越过关节极限或产生不可执行曲率。平滑属于新的路径修改,需再次检查碰撞与运动约束;仅用反馈跟踪也不自动保证实际误差下不碰撞。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      As path planning randomly samples from discrete and arbitrarily coarse maps, the resulting paths are typically jagged and irregular and far from optimal in practice. This can be drastically improved by path smoothing. One way of doing this is to connect points of the path using splines, polynomial curves, or even trajectory snippets that are known to be feasible for a specific platform. Alternatively, one

    参考来源

    - 位置:《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) - 结论依据:摘录中关于路径平滑后需要重新检查约束的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:As path planning randomly samples from discrete and arbitrarily coarse maps, the resulting paths are typically jagged and irregular and far from optimal in practice. This can be drastically improved by path smoothing. One way of doing this is to connect points of the path using splines, polynomial curves, or even trajectory snippets that are known to be feasible for a specific platform. Alternatively, one