Package fr.uga.pddl4j.planners.statespace.search

Class GreedyBestFirstSearch

java.lang.Object

fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch

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

All Implemented Interfaces:

SearchStrategy, StateSpaceSearch, Serializable

public final class GreedyBestFirstSearch
extends AbstractStateSpaceSearch

This class implements Greedy Best First Search strategy.

See Also:

Serialized Form

Nested Class Summary

Nested classes/interfaces inherited from interface fr.uga.pddl4j.planners.SearchStrategy

SearchStrategy.Name

Field Summary

Fields inherited from interface fr.uga.pddl4j.planners.statespace.search.StateSpaceSearch

DEFAULT_HEURISTIC, DEFAULT_HEURISTIC_WEIGHT, DEFAULT_TIMEOUT

Constructor Summary

Constructors

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

Method Summary

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

Methods inherited from class fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch

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

Methods inherited from class java.lang.Object

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

Constructor Details

GreedyBestFirstSearch

public GreedyBestFirstSearch()

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

GreedyBestFirstSearch

public GreedyBestFirstSearch(int timeout,
 StateHeuristic.Name heuristic,
 double weight)

Creates a new Greedy best First Search search strategy.

Parameters:

timeout - the time out of the planner.

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

weight - the weight set to the heuristic.

Method Details

search

public Node search(Problem 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.