ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.ForwardDecompositionHTNPlanner Maven / Gradle / Ivy
package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition;
import ai.libs.jaicore.planning.core.EvaluatedSearchGraphBasedPlan;
import ai.libs.jaicore.planning.hierarchical.algorithms.GraphSearchBasedHTNPlanningAlgorithm;
import ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode;
import ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem;
import ai.libs.jaicore.search.core.interfaces.IOptimalPathInORGraphSearchFactory;
import ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath;
import ai.libs.jaicore.search.probleminputs.GraphSearchInput;
/**
* @author fmohr
*
*/
public class ForwardDecompositionHTNPlanner, S extends GraphSearchInput>
extends GraphSearchBasedHTNPlanningAlgorithm {
public ForwardDecompositionHTNPlanner(final P problem, final AForwardDecompositionReducer
, S, EvaluatedSearchGraphPath> reducer, final IOptimalPathInORGraphSearchFactory searchFactory) {
super(problem, reducer, searchFactory);
}
}