• Home
• ai.libs
• jaicore-planning
• 0.1.4
• source code
• ForwardDecompositionHTNPlannerBasedOnBestFirst.java

×

Project download

Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance.
Project price only 1 $

You can buy this project and download/modify it how often you want.

ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.ForwardDecompositionHTNPlannerBasedOnBestFirst Maven / Gradle / Ivy

package ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition;

import ai.libs.jaicore.planning.hierarchical.algorithms.forwarddecomposition.graphgenerators.tfd.TFDNode;
import ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitiveHTNPlanningProblem;
import ai.libs.jaicore.planning.hierarchical.problems.htn.IHTNPlanningProblem;
import ai.libs.jaicore.search.algorithms.standard.bestfirst.BestFirstFactory;
import ai.libs.jaicore.search.algorithms.standard.bestfirst.nodeevaluation.INodeEvaluator;
import ai.libs.jaicore.search.probleminputs.GraphSearchWithSubpathEvaluationsInput;

public class ForwardDecompositionHTNPlannerBasedOnBestFirst> extends ForwardDecompositionHTNPlanner, V, GraphSearchWithSubpathEvaluationsInput> {

	public ForwardDecompositionHTNPlannerBasedOnBestFirst(final CostSensitiveHTNPlanningProblem problem, final INodeEvaluator nodeEvaluator) {
		super(problem, new BestFirstForwardDecompositionReducer(), new BestFirstFactory<>());
		BestFirstForwardDecompositionReducer reducer = (BestFirstForwardDecompositionReducer)this.getProblemTransformer();
		reducer.getTransformer().setNodeEvaluator(nodeEvaluator);
	}
}