Package edu.uky.ai.planning.ss
Class StateSpacePlanner<S extends StateSpaceSearch>
java.lang.Object
edu.uky.ai.planning.Planner<S>
edu.uky.ai.planning.ss.StateSpacePlanner<S>
- Direct Known Subclasses:
BackwardPlanner
,ForwardPlanner
A planner which searches the space of states for the solution to a given
problem.
- Author:
- Stephen G. Ware
-
Field Summary
-
Constructor Summary
ConstructorsConstructorDescriptionStateSpacePlanner
(String name) Constructs a new state space planner with a given name. -
Method Summary
Modifier and TypeMethodDescriptionprotected S
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 ofSearch
to solve the problem based on this planner's technique.protected abstract S
makeStateSpaceSearch
(StateSpaceProblem problem, SearchBudget budget) Given some state space problem to be solved, this method constructs the appropriate kind ofStateSpaceSearch
to solve it based on this planner.
-
Constructor Details
-
StateSpacePlanner
Constructs a new state space planner with a given name.- Parameters:
name
- the name of the planner
-
-
Method Details
-
makeSearch
Description copied from class:Planner
Given some problem to be solved, and search budget in which to solve it, this method constructs the appropriate kind ofSearch
to solve the problem based on this planner's technique.- Specified by:
makeSearch
in classPlanner<S extends StateSpaceSearch>
- Parameters:
problem
- the problem to be solvedbudget
- the search budget, which specifies the maximum number of nodes the planner may visit and maximum amount of time the search can take- Returns:
- a search object for solving this problem
-
makeStateSpaceSearch
Given some state space problem to be solved, this method constructs the appropriate kind ofStateSpaceSearch
to solve it based on this planner.- Parameters:
problem
- the state space problem to be solvedbudget
- the search budget in which to solve it- Returns:
- a state space search object for solving this problem
-