|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface HeuristicFunction<K extends AgentAction,S extends AgentState,P extends SearchProblem<K,S>>
A problem-specific function h(n) = the estimated cost of the cheapest path from node n to a goal node.
Heuristic functions have one formal constraint: if n is a goal node, h(n) = 0.
A heuristic function is consistent or monotonic if, for every node n and every successor n' generated by any action a, the estimated cost of reaching the goal from n is no greater than the step cost of getting to n' plus the estimated cost of reaching the goal from n'.
Implementations should presumably be customized to a particular type of problem.
Method Summary | |
---|---|
double |
estimate(SearchNode<K,S> theNode)
Estimates the cost from the given node to the closest goal node. |
Method Detail |
---|
double estimate(SearchNode<K,S> theNode)
If the given node *is* a goal node, should return zero.
theNode
-
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |