知识卡片

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

A星用已花代价加剩余估计排序

理解等级:中级

A*以f=g+h排序,g是起点到当前的最佳已知代价,h估计到目标剩余代价。只按h排序是贪心搜索,不是A*;h=0退化为Dijkstra,启发是否有效还取决于任务代价单位与允许动作。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Instead of exploring in all directions, knowledge of an approximate direction of exploration to reach the goal may help in avoiding the exploration of nodes that are not needed to succeed in the task. As humans, we can easily interpret the task in figure 13.3 and understand that most states in the top-left and bottom-right corner should not be explored if we want to find

    参考来源

    - 位置:《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) - 结论依据:摘录中关于A星用已花代价加剩余估计排序的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Instead of exploring in all directions, knowledge of an approximate direction of exploration to reach the goal may help in avoiding the exploration of nodes that are not needed to succeed in the task. As humans, we can easily interpret the task in figure 13.3 and understand that most states in the top-left and bottom-right corner should not be explored if we want to find