Class CostSensitivePlanningToStandardSearchProblemReduction<I extends IHTNPlanningProblem,​N,​A,​V extends java.lang.Comparable<V>>

  • All Implemented Interfaces:
    ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<I,​V>,​IEvaluatedPlan<V>,​org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,​A,​V>,​org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IEvaluatedPath<N,​A,​V>>, IHierarchicalPlanningToGraphSearchReduction<N,​A,​CostSensitiveHTNPlanningProblem<I,​V>,​IEvaluatedPlan<V>,​org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,​A,​V>,​org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IEvaluatedPath<N,​A,​V>>

    public class CostSensitivePlanningToStandardSearchProblemReduction<I extends IHTNPlanningProblem,​N,​A,​V extends java.lang.Comparable<V>>
    extends CostSensitivePlanningToSearchProblemReduction<N,​A,​V,​I,​org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,​A,​V>,​org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IEvaluatedPath<N,​A,​V>>
    • Constructor Detail

      • CostSensitivePlanningToStandardSearchProblemReduction

        public CostSensitivePlanningToStandardSearchProblemReduction​(IHierarchicalPlanningToGraphSearchReduction<N,​A,​I,​IPlan,​? extends org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,​A>,​org.api4.java.datastructure.graph.ILabeledPath<N,​A>> baseReduction)