fr.uga.pddl4j.planners.statespace.search.strategy

Class GreedyBestFirstSearch

java.lang.Object

fr.uga.pddl4j.planners.statespace.search.strategy.AbstractStateSpaceStrategy

fr.uga.pddl4j.planners.statespace.search.strategy.GreedyBestFirstSearch

All Implemented Interfaces:

StateSpaceStrategy, java.io.Serializable

public final class GreedyBestFirstSearch
extends AbstractStateSpaceStrategy

This class implements Greedy Best First Search strategy.

See Also:

Serialized Form

Constructor Summary

Constructors

Constructor and Description
GreedyBestFirstSearch() Creates a new Greedy best First Search search strategy with default parameters.
GreedyBestFirstSearch(int timeout, Heuristic.Type heuristic, double weight) Creates a new Greedy best First Search search strategy.

Method Summary

Modifier and Type	Method and Description
Node	search(CodedProblem codedProblem) The greedy best first search algorithm.

Methods inherited from class fr.uga.pddl4j.planners.statespace.search.strategy.AbstractStateSpaceStrategy

extractPlan, getCreatedNodes, getExploredNodes, getHeuristicType, getMemoryUsed, getPendingNodes, getSearchingTime, getTimeout, getWeight, resetNodesStatistics, searchPlan, searchSolutionNode, setCreatedNodes, setExploredNodes, setHeuristicType, setMemoryUsed, setPendingNodes, setSearchingTime, setTimeOut, setWeight

Methods inherited from class java.lang.Object

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

Constructor Detail

GreedyBestFirstSearch

public GreedyBestFirstSearch()

Creates a new Greedy best First Search search strategy with default parameters.

GreedyBestFirstSearch

public GreedyBestFirstSearch(int timeout,
                             Heuristic.Type heuristic,
                             double weight)

Creates a new Greedy best First Search search strategy.

Parameters:

timeout - the time out of the planner.

heuristic - the heuristicType to use to solve the planning problem.

weight - the weight set to the heuristic.

Method Detail

search

public Node search(CodedProblem codedProblem)

The greedy best first search algorithm. Solves the planning problem and returns the first solution plan found. This method must be completed.

Parameters:

codedProblem - the problem to be solved. The problem cannot be null.

Returns:

a solution plan or null if it does not exist.