A *搜索算法 [英] A* Search Algorithm

问题描述

关于以下A *搜索示例，我想澄清一些问题：

I would like to have something clarified with regards to the following A* Search example:

用红色椭圆突出显示的部分是我不了解的区域；看来 {S，B} f = 2 + 6 = 8 已从展开S （上方），并在展开A 中使用。似乎 {S，A，X} f =（1 + 4）+ 5 = 10 已从展开/移动/复制A 并在 Expand B 中使用。

The sections highlighted with the red ellipses are the areas that I do not understand; it appears that {S,B} f=2+6=8 has been taken/moved/copied from Expand S (above) and used in Expand A. It also appears that {S,A,X} f=(1+4)+5=10 has been taken/moved/copied from Expand A and used in Expand B.

有人可以解释一下为什么会这样吗？我能够很好地阅读该图，并且在解释它时没有任何麻烦-这仅仅是事实，我不知道为什么上述路径/路线已在其他地方重复。

Could somebody kindly explain why this happens? I am able to read the graph perfectly well and do not have any trouble interpreting it - it is merely the fact that I do not know why the aforementioned paths/routes have been duplicated elsewhere.

谢谢。

推荐答案

这是目前最好的物品，正在移除，并将其替换为扩展名（将新项目插入列表中的适当位置）。像这样想：

This is taking the current best item, removing it, and replacing it with the expansion (inserting the new items into appropriate positions in the list). Think of it like this:

展开S：

• {S，A} f = 1 + 5 = 6


• {S ，B} f = 2 + 6 = 8

• {S,A} f = 1+5 = 6
• {S,B} f = 2+6 = 8

展开A：

• {S，A} f = 1 + 5 = 6


• {S，B} f = 2 + 6 = 8


• {S，A，X} f =（1 + 4）+5 = 10


• {S，A，Y} f =（1 + 7）+8 = 16

• {S,A} f = 1+5 = 6
• {S,B} f = 2+6 = 8
• {S,A,X} f = (1+4)+5 = 10
• {S,A,Y} f = (1+7)+8 = 16

展开B：

• {S，B} f = 2 +6 = 8


• {S，A，X} f =（1 + 4）+5 = 10


• {S，B，C} f =（2 + 7）+4 = 13


• {S，A，Y} f =（1 + 7）+8 = 16


• {S，B，D} f =（2 + 1）+15 = 18

• {S,B} f = 2+6 = 8
• {S,A,X} f = (1+4)+5 = 10
• {S,B,C} f = (2+7)+4 = 13
• {S,A,Y} f = (1+7)+8 = 16
• {S,B,D} f = (2+1)+15 = 18

这篇关于A *搜索算法的文章就介绍到这了，希望我们推荐的答案对大家有所帮助，也希望大家多多支持IT屋！