Class EnforcedHillClimbing

java.lang.Object
fr.uga.pddl4j.planners.statespace.search.AbstractStateSpaceSearch
fr.uga.pddl4j.planners.statespace.search.EnforcedHillClimbing
All Implemented Interfaces:
SearchStrategy, StateSpaceSearch, Serializable

public final class EnforcedHillClimbing extends AbstractStateSpaceSearch
This class implements Enforced Hill Climbing search strategy.
See Also:
Serialized Form
  • Constructor Details

    • EnforcedHillClimbing

      public EnforcedHillClimbing()
      Creates a new Enforced Hill Climbing search strategy with default parameters.
    • EnforcedHillClimbing

      public EnforcedHillClimbing(int timeout, StateHeuristic.Name heuristic, double weight)
      Creates a new Enforced 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 enforced 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 or null.