Package edu.uky.ai.planning.ss


package edu.uky.ai.planning.ss
Contains objects for representing forward and backward state space search and state space planners.
  • Class
    Description
    A wrapper around a StateSpaceHeuristic which uses the given heuristic to estimate the distance from the problem's initial state to the current goal of a backward search.
    Represents a node in a backward state space search graph, where a node is a goal and a plan to achieve the problem goal if the node's goal can be achieved.
    A planner which searches backward through space of states for the solution to a given problem.
    A special BackwardNode that represents the root of the backward search space and holds a pointer to the problem object and the search budget.
    Represents a backward search through the space of states, starting at the problem goal and ending in the initial state.
    A wrapper around a StateSpaceHeuristic which uses the given heuristic to estimate the distance from the current state in a forward search to the problem's goal.
    Represents a node in a forward state space search graph, where a node is a state and the plan taken to reach that state from the initial state.
    A planner which searches forward through space of states for the solution to a given problem.
    A special ForwardNode that represents the root of the forward search space and holds a pointer to the problem object and the search budget.
    Represents a forward search through the space of states, starting at the initial state and ending in any state where the goal is achieved.
    A state space heuristic estimates the distance (as number of steps) between a given state and a given goal proposition.
    Represents a node in a state space search graph.
    A planner which searches the space of states for the solution to a given problem.
    A subclass of Problem that propositionalizes all the StateSpaceProblem.steps that could possibly occur in a plan.
    A special StateSpaceNode that represents the root of the search space and holds a pointer to the problem object and the search budget.
    Represents a search through the space of states.