- All Implemented Interfaces:
- ai.libs.jaicore.basic.algorithm.IAlgorithm<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,EvaluatedSearchGraphBasedPlan<V,TFDNode>>, ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,EvaluatedSearchGraphBasedPlan<V,TFDNode>,V>, ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,EvaluatedSearchGraphBasedPlan<V,TFDNode>>, ai.libs.jaicore.basic.Cancelable, ai.libs.jaicore.basic.ILoggingCustomizable, java.lang.Iterable<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>, java.util.concurrent.Callable<EvaluatedSearchGraphBasedPlan<V,TFDNode>>, java.util.Iterator<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>
public class ForwardDecompositionHTNPlannerBasedOnBestFirst<V extends java.lang.Comparable<V>>
extends ForwardDecompositionHTNPlanner<CostSensitiveHTNPlanningProblem<IHTNPlanningProblem,V>,V,ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput<TFDNode,java.lang.String,V>>