我正在尝试在Javascript中实现星型算法。但是我面临的问题是在heuristic_cost_estimate函数中。我不知道如何实现这一点。至于在哪里定义这个函数。我不想整个代码,只是功能。javascript中的星型算法实现
function A*(start,goal)
closedset := the empty set // The set of nodes already evaluated.
openset := {start} // The set of tentative nodes to be evaluated, initially containing the start node
came_from := the empty map // The map of navigated nodes.
g_score[start] := 0 // Cost from start along best known path.
// Estimated total cost from start to goal through y.
*************************************************** heurisctic function******************
f_score[start] := g_score[start] + ***heuristic_cost_estimate(start, goal)***
while openset is not empty
current := the node in openset having the lowest f_score[] value
if current = goal
return reconstruct_path(came_from, goal)
remove current from openset
add current to closedset
for each neighbor in neighbor_nodes(current)
if neighbor in closedset
continue
tentative_g_score := g_score[current] + dist_between(current,neighbor)
if neighbor not in openset or tentative_g_score < g_score[neighbor]
add neighbor to openset
came_from[neighbor] := current
g_score[neighbor] := tentative_g_score
f_score[neighbor] := g_score[neighbor] + heuristic_cost_estimate(neighbor, goal)
return failure
function reconstruct_path(came_from, current_node)
if came_from[current_node] is set
p := reconstruct_path(came_from, came_from[current_node])
return (p + current_node)
else
return current_node
您是否要求我们将此伪代码翻译成JavaScript? –
不,不......一点都不......我自己就这样做...我在问启发式功能....我怎么定义它? 我没有看到它在算法中的定义。尽管我知道它的用法。但在程序中它让我感到困惑 –