知识卡片

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

曼哈顿启发要匹配网格移动规则

理解等级:中级

四邻接且每格单位代价时,|Δx|+|Δy|是合适剩余距离下界。若允许廉价对角移动,该值可能高估,欧氏或其他适合规则的下界更合适;对角边本身还要避免穿越障碍角。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Figure 13.4 Finding a shortest path from “S” to “G” assuming the robot can only travel laterally (not diagonally) with cost one per grid cell using the A* algorithm. Much like Dijkstra, A* evaluates only the cell with the lowest cost but takes an estimate of the remaining distance into account.

    参考来源

    - 位置:《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) - 结论依据:摘录中关于曼哈顿启发要匹配网格移动规则的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Figure 13.4 Finding a shortest path from “S” to “G” assuming the robot can only travel laterally (not diagonally) with cost one per grid cell using the A* algorithm. Much like Dijkstra, A* evaluates only the cell with the lowest cost but takes an estimate of the remaining distance into account.