Package fr.uga.pddl4j.heuristics.state

Class CriticalPath

java.lang.Object
fr.uga.pddl4j.heuristics.AbstractHeuristic
fr.uga.pddl4j.heuristics.state.AbstractStateHeuristic
fr.uga.pddl4j.heuristics.state.RelaxedGraphHeuristic
fr.uga.pddl4j.heuristics.state.CriticalPath
All Implemented Interfaces:
Heuristic, PlanningGraphHeuristic, StateHeuristic, Serializable
public final class CriticalPath extends RelaxedGraphHeuristic
This class will display the critical path based on the Delta Algorithm from the Automated Planning book. Automated Planning: Theory & Practice Book by Dana S. Nau, Malik Ghallab, and Paolo Traverso (Chapter 9). At the minute it has a variation of the sum heuristic and max heuristic and the final method will have the critical path.
See Also:
Serialized Form

  • Constructor Details

    • CriticalPath

      public CriticalPath​(Problem problem)
      Creates a new critical pah heuristic for a specific problem.
      Parameters:
      problem - the problem.

  • Method Details

    • estimate

      public int estimate​(State state, Condition goal)
      Returns a estimation of the distance from a state to a goal.
      Parameters:
      state - the state from which the distance to the goal must be estimated.
      goal - the goal expression.
      Returns:
      the estimated distance.

    • estimate

      public double estimate​(Node node, Condition goal)
      Return the estimated distance to the goal to reach the specified state. If the return value is DOUBLE.MAX_VALUE, it means that the goal is unreachable from the specified state.
      Parameters:
      node - the state from which the distance to the goal must be estimated.
      goal - the goal expression.
      Returns:
      the distance to the goal state from the specified state.