aima.core.search.informed

Class GreedyBestFirstSearch

java.lang.Object

aima.core.search.framework.PrioritySearch

aima.core.search.informed.BestFirstSearch

aima.core.search.informed.GreedyBestFirstSearch

All Implemented Interfaces:

SearchForActions, SearchForStates

public class GreedyBestFirstSearch
extends BestFirstSearch

Artificial Intelligence A Modern Approach (3rd Edition): page 92.

Greedy best-first search tries to expand the node that is closest to the goal, on the grounds that this is likely to lead to a solution quickly. Thus, it evaluates nodes by using just the heuristic function; that is, f(n) = h(n)

Author:

Ravi Mohan, Mike Stampone

Constructor Summary

Constructors

Constructor and Description
GreedyBestFirstSearch(QueueSearch impl, HeuristicFunction hf) Constructs a greedy best-first search from a specified search space exploration strategy and a heuristic function.

Method Summary

Methods inherited from class aima.core.search.informed.BestFirstSearch

getEvaluationFunction

Methods inherited from class aima.core.search.framework.PrioritySearch

findActions, findState, getComparator, getMetrics, getNodeExpander

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

GreedyBestFirstSearch

public GreedyBestFirstSearch(QueueSearch impl,
                             HeuristicFunction hf)

Constructs a greedy best-first search from a specified search space exploration strategy and a heuristic function.

Parameters:

impl - a search space exploration strategy (e.g. TreeSearch, GraphSearch).

hf - a heuristic function h(n), which estimates the cheapest path from the state at node n to a goal state.