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

Class CostSensitivePlanningToSearchProblemReduction<N,A,V extends java.lang.Comparable<V>,I1 extends IHTNPlanningProblem,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,O2 extends ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>>

java.lang.Object

ai.libs.jaicore.planning.hierarchical.problems.htn.CostSensitivePlanningToSearchProblemReduction<N,A,V,I1,I2,O2>

All Implemented Interfaces:

ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<CostSensitiveHTNPlanningProblem<I1,V>,IEvaluatedPlan<V>,I2,O2>, IHierarchicalPlanningToGraphSearchReduction<N,A,CostSensitiveHTNPlanningProblem<I1,V>,IEvaluatedPlan<V>,I2,O2>

Direct Known Subclasses:

CostSensitivePlanningToStandardSearchProblemReduction

public class CostSensitivePlanningToSearchProblemReduction<N,A,V extends java.lang.Comparable<V>,I1 extends IHTNPlanningProblem,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,O2 extends ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>>
extends java.lang.Object
implements IHierarchicalPlanningToGraphSearchReduction<N,A,CostSensitiveHTNPlanningProblem<I1,V>,IEvaluatedPlan<V>,I2,O2>

Constructor Summary

Constructors

Constructor

Description

CostSensitivePlanningToSearchProblemReduction(IHierarchicalPlanningToGraphSearchReduction<N,A,I1,IPlan,ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,ai.libs.jaicore.search.model.other.SearchGraphPath<N,A>> baseReduction, ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<? super ai.libs.jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,? super ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>,I2,O2> forwardReduction)

Method Summary

Modifier and Type	Method	Description
IEvaluatedPlan<V>	decodeSolution(O2 solution)
I2	encodeProblem(CostSensitiveHTNPlanningProblem<I1,V> problem)	This method operates in three steps: 1) it derives a general graph search problem from the given planning problem 2) it combines the obtained graph search problem with a path evaluation function into a GrahhSearchWithPathEvaluationsInput 3) it derives a potentially more informed GraphSearchInput The last process is called the forward reduction.

Methods inherited from class java.lang.Object

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

Constructor Detail

CostSensitivePlanningToSearchProblemReduction

public CostSensitivePlanningToSearchProblemReduction(IHierarchicalPlanningToGraphSearchReduction<N,A,I1,IPlan,ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,ai.libs.jaicore.search.model.other.SearchGraphPath<N,A>> baseReduction,
                                                     ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<? super ai.libs.jaicore.search.probleminputs.GraphSearchWithPathEvaluationsInput<N,A,V>,? super ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>,I2,O2> forwardReduction)

Method Detail

encodeProblem

public I2 encodeProblem(CostSensitiveHTNPlanningProblem<I1,V> problem)

This method operates in three steps: 1) it derives a general graph search problem from the given planning problem 2) it combines the obtained graph search problem with a path evaluation function into a GrahhSearchWithPathEvaluationsInput 3) it derives a potentially more informed GraphSearchInput The last process is called the forward reduction. The output does not change.

Specified by:

encodeProblem in interface ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<N,A,V extends java.lang.Comparable<V>,I1 extends IHTNPlanningProblem>

decodeSolution

public IEvaluatedPlan<V> decodeSolution(O2 solution)

Specified by:

decodeSolution in interface ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<N,A,V extends java.lang.Comparable<V>,I1 extends IHTNPlanningProblem>