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

Class HillClimbing

java.lang.Object

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

fr.uga.pddl4j.planners.statespace.search.HillClimbing

All Implemented Interfaces:

SearchStrategy, StateSpaceSearch, Serializable

public final class HillClimbing
extends AbstractStateSpaceSearch

This class implements Hill Climnbing 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
HillClimbing()	Creates a new Hill Climbing search with default parameters.
HillClimbing(int timeout, StateHeuristic.Name heuristic, double weight)	Creates a new Hill Climbing search strategy.

Method Summary

Modifier and Type	Method	Description
Node	search(Problem codedProblem)	The hill climbing 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

HillClimbing

public HillClimbing()

Creates a new Hill Climbing search with default parameters.

HillClimbing

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

Creates a new Hill Climbing 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 hill climbing algorithm. Solves the planning problem and returns the solution's node.

Parameters:

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

Returns:

the solution node.