Uses of Class
edu.uky.ai.planning.Problem

Packages that use Problem

Package	Description
edu.uky.ai.planning	Contains objects for representing planning problems, planning algorithms, and plans.
edu.uky.ai.planning.pg	Contains objects for representing plan graphs and planners that search for a solution by finding a valid subgraph of a plan graph.
edu.uky.ai.planning.ps	Contains objects for representing plan space search and plan space planners.
edu.uky.ai.planning.ss	Contains objects for representing forward and backward state space search and state space planners.

Uses of Problem in edu.uky.ai.planning

Fields in edu.uky.ai.planning declared as Problem

Modifier and Type	Field	Description
final Problem	Result.problem	The problem being solved
final Problem	Search.problem	The problem being solved

Methods in edu.uky.ai.planning with parameters of type Problem

Modifier and Type	Method	Description
static void	Main.benchmark(Planner<?>[] planners, Problem[] problems, int maxNodes, long maxTime, Writer output)	Compares the performance of one or more planners on one or more problems.
protected abstract S	Planner.makeSearch(Problem problem, SearchBudget budget)	Given some problem to be solved, and search budget in which to solve it, this method constructs the appropriate kind of Search to solve the problem based on this planner's technique.
static void	Main.plan(Planner<?> planner, Problem problem, int maxNodes, long maxTime, Writer output)	Uses a given planner to solve a given problem.
final Result	Planner.solve(Problem problem, int maxNodes, long maxTime)	Returns a solution to the given problem.
final Result	Planner.solve(Problem problem, SearchBudget budget)	Returns a solution to the given problem.

Constructors in edu.uky.ai.planning with parameters of type Problem

Modifier	Constructor	Description
	Result(Planner<?> planner, Problem problem, Plan solution, String reason, int visited, int generated, long time)	Constructs a new result object.
	Search(Problem problem, SearchBudget budget)	Constructs a new search for the given problem.

Uses of Problem in edu.uky.ai.planning.pg

Methods in edu.uky.ai.planning.pg with parameters of type Problem

Modifier and Type	Method	Description
protected PlanGraphSearch	PlanGraphPlanner.makeSearch(Problem problem, SearchBudget budget)

Constructors in edu.uky.ai.planning.pg with parameters of type Problem

Modifier	Constructor	Description
	PlanGraph(Problem problem, boolean persistence, boolean mutexes)	Constructs a plan graph using all possible steps that could occur as the step nodes.

Uses of Problem in edu.uky.ai.planning.ps

Fields in edu.uky.ai.planning.ps declared as Problem

Modifier and Type	Field	Description
final Problem	PlanSpaceRoot.problem	The problem this search is trying to solve

Methods in edu.uky.ai.planning.ps with parameters of type Problem

Modifier and Type	Method	Description
protected abstract PlanSpaceSearch	PlanSpacePlanner.makeSearch(Problem problem, SearchBudget budget)

Constructors in edu.uky.ai.planning.ps with parameters of type Problem

Modifier	Constructor	Description
	PlanSpaceRoot(Problem problem, SearchBudget budget)	Constructs a new root node of a search space for a given problem.
	PlanSpaceSearch(Problem problem, SearchBudget budget)	Constructs a new plan space search object.

Uses of Problem in edu.uky.ai.planning.ss

Subclasses of Problem in edu.uky.ai.planning.ss

Modifier and Type	Class	Description
class	StateSpaceProblem	A subclass of Problem that propositionalizes all the StateSpaceProblem.steps that could possibly occur in a plan.

Methods in edu.uky.ai.planning.ss with parameters of type Problem

Modifier and Type	Method	Description
protected BackwardSearch	BackwardPlanner.makeSearch(Problem problem, SearchBudget budget)
protected ForwardSearch	ForwardPlanner.makeSearch(Problem problem, SearchBudget budget)
protected S	StateSpacePlanner.makeSearch(Problem problem, SearchBudget budget)

Constructors in edu.uky.ai.planning.ss with parameters of type Problem

Modifier	Constructor	Description
	StateSpaceProblem(Problem problem)	Constructs a new state space problem from a general planning problem.