- Type Parameters:
I1 - Class of the planning problem
I2 - Class of the search problem
N - node type in search problem
A - edge type in search problem
V - cost associated with plans (and paths)
- All Implemented Interfaces:
- ai.libs.jaicore.basic.algorithm.IAlgorithm<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>>, ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>,V>, ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>>, ai.libs.jaicore.basic.Cancelable, ai.libs.jaicore.basic.ILoggingCustomizable, java.lang.Iterable<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>, java.util.concurrent.Callable<IEvaluatedGraphSearchBasedPlan<N,A,V>>, java.util.Iterator<ai.libs.jaicore.basic.algorithm.events.AlgorithmEvent>
- Direct Known Subclasses:
- CostSensitiveGraphSearchBasedHTNPlanningAlgorithm
public class CostSensitiveGraphSearchBasedPlanningAlgorithm<I1,I2 extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>>
extends GraphSearchBasedPlanningAlgorithm<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>,I2,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>,N,A>
implements ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>,V>