知识卡片

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

图最优不等于连续空间最优

理解等级:中级

有限图上满足条件的搜索可完整求最小图代价,但粗离散可能漏掉狭通道或限制路径方向。分辨率完备性与连续问题的完备性不同,报告结果应说明地图、邻接和碰撞离散规则。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Section 13.2 introduced a series of complete algorithms for the path planning problem—that is, algorithms that are guaranteed to (eventually) find a solution if one exists. However, complete algorithms are often infeasible in practice because of a large state space, low available memory, or limited time to execute the algorithm. This is often the case for robots with many degrees of freedom such as arms.

    参考来源

    - 位置:《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) - 结论依据:摘录中关于图最优不等于连续空间最优的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Section 13.2 introduced a series of complete algorithms for the path planning problem—that is, algorithms that are guaranteed to (eventually) find a solution if one exists. However, complete algorithms are often infeasible in practice because of a large state space, low available memory, or limited time to execute the algorithm. This is often the case for robots with many degrees of freedom such as arms.