ai.libs.jaicore.planning.hierarchical.problems.htn

Class CostSensitivePlanningToSearchProblemTransformer<IPlanning extends IHTNPlanningProblem,V extends java.lang.Comparable<V>,N,A>

java.lang.Object

ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToSearchProblemTransformer<IPlanning,V,N,A>

All Implemented Interfaces:

ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<IPlanning,V>,EvaluatedPlan<V>,jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>>

public class CostSensitivePlanningToSearchProblemTransformer<IPlanning extends IHTNPlanningProblem,V extends java.lang.Comparable<V>,N,A>
extends java.lang.Object
implements ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<IPlanning,V>,EvaluatedPlan<V>,jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>>

Constructor Summary

Constructors

Constructor and Description
CostSensitivePlanningToSearchProblemTransformer(IHierarchicalPlanningGraphGeneratorDeriver<IPlanning,N,A> graphGeneratorDeriver)

Method Summary

Modifier and Type	Method and Description
EvaluatedPlan<V>	decodeSolution(jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V> solution)
jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>	encodeProblem(CostSensitiveHTNPlanningProblem<IPlanning,V> problem)
IHierarchicalPlanningGraphGeneratorDeriver<IPlanning,N,A>	getGraphGeneratorDeriver()

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

CostSensitivePlanningToSearchProblemTransformer

public CostSensitivePlanningToSearchProblemTransformer(IHierarchicalPlanningGraphGeneratorDeriver<IPlanning,N,A> graphGeneratorDeriver)

Method Detail

encodeProblem

public jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V> encodeProblem(CostSensitiveHTNPlanningProblem<IPlanning,V> problem)

Specified by:

encodeProblem in interface ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<IPlanning extends IHTNPlanningProblem,V extends java.lang.Comparable<V>>,EvaluatedPlan<V extends java.lang.Comparable<V>>,jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>>

getGraphGeneratorDeriver

public IHierarchicalPlanningGraphGeneratorDeriver<IPlanning,N,A> getGraphGeneratorDeriver()

decodeSolution

public EvaluatedPlan<V> decodeSolution(jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V> solution)

Specified by:

decodeSolution in interface ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<IPlanning extends IHTNPlanningProblem,V extends java.lang.Comparable<V>>,EvaluatedPlan<V extends java.lang.Comparable<V>>,jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>>