Class BestFirstForwardDecompositionReducer<V extends java.lang.Comparable<V>>
- java.lang.Object
-
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.AForwardDecompositionReducer<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,IEvaluatedGraphSearchBasedPlan<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V>>
-
- ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.BestFirstForwardDecompositionReducer<V>
-
- All Implemented Interfaces:
ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,IEvaluatedGraphSearchBasedPlan<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V>>,IHierarchicalPlanningToGraphSearchReduction<TFDNode,java.lang.String,CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,IEvaluatedGraphSearchBasedPlan<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V>>
public class BestFirstForwardDecompositionReducer<V extends java.lang.Comparable<V>> extends AForwardDecompositionReducer<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,IEvaluatedGraphSearchBasedPlan<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V>>
-
-
Constructor Summary
Constructors Constructor Description BestFirstForwardDecompositionReducer()BestFirstForwardDecompositionReducer(ai.libs.jaicore.search.algorithms.standard.bestfirst.nodeevaluation.INodeEvaluator<TFDNode,V> nodeEvaluator)BestFirstForwardDecompositionReducer(ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode,java.lang.String,V> transformer)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method Description EvaluatedSearchGraphBasedPlan<TFDNode,java.lang.String,V>decodeSolution(ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V> solution)ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>encodeProblem(CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V> problem)ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode,java.lang.String,V>getTransformer()voidsetTransformer(ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode,java.lang.String,V> transformer)-
Methods inherited from class ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.AForwardDecompositionReducer
getGraphSearchInput, getPlanForSolution
-
-
-
-
Method Detail
-
encodeProblem
public ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V> encodeProblem(CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V> problem)
-
decodeSolution
public EvaluatedSearchGraphBasedPlan<TFDNode,java.lang.String,V> decodeSolution(ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<TFDNode,java.lang.String,V> solution)
-
getTransformer
public ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<TFDNode,java.lang.String,V> getTransformer()
-
-