Featured post
c++ - Best-First search in Boost Graph Library -
i starting work boost graph library. need best-first search, implement using astar_search having 0 costs. (please correct me if i'm wrong.)
however, wonder if there possibility of doing this? if costs not considered, algorithm should more efficient.
edit: sorry unclear description. implementing potential field search, don't have costs/weights associated edges rather need steepest-descent-search (which can overcome local minima).
thanks hints!
you use a* tackle this; you'd need h(x) 0 though, not g(x). a* rates nodes based on f defined
f(n) = g(n) + h(n). totalcost = pathcost + heuristic.
g(n) = path cost, distance initial current state
h(n) = heuristic, estimation of cost current state end state.
from wikipedia:
dijkstra's algorithm, example of best-first search algorithm, can viewed special case of a* h(x) = 0 x.
- Get link
- X
- Other Apps
Comments
Post a Comment