Package ai.libs.jaicore.planning.hierarchical.algorithms

Class CostSensitiveGraphSearchBasedHTNPlanningAlgorithm<P extends IHTNPlanningProblem,S extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>>

java.lang.Object

ai.libs.jaicore.basic.algorithm.AAlgorithm<I,O>

ai.libs.jaicore.basic.algorithm.ASolutionCandidateIterator<I1,O1>

ai.libs.jaicore.basic.algorithm.reduction.AReducingSolutionIterator<I1,O1,I2,O2>

ai.libs.jaicore.planning.hierarchical.algorithms.GraphSearchBasedPlanningAlgorithm<I1,IEvaluatedGraphSearchBasedPlan<N,A,V>,I2,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>,N,A>

ai.libs.jaicore.planning.hierarchical.algorithms.CostSensitiveGraphSearchBasedPlanningAlgorithm<P,S,N,A,V>

ai.libs.jaicore.planning.hierarchical.algorithms.CostSensitiveGraphSearchBasedHTNPlanningAlgorithm<P,S,N,A,V>

Type Parameters:

P - class of the HTN planning problem

S - class of the graph search problem input to which the HTN problem is reduced

N - class of the nodes in the search problem

A - class of the edges in the search problem

V - evaluation of solutions

All Implemented Interfaces:

ai.libs.jaicore.basic.algorithm.IAlgorithm<P,IEvaluatedGraphSearchBasedPlan<N,A,V>>, ai.libs.jaicore.basic.algorithm.IOptimizationAlgorithm<P,IEvaluatedGraphSearchBasedPlan<N,A,V>,V>, ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator<P,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:

ForwardDecompositionHTNPlanner

public class CostSensitiveGraphSearchBasedHTNPlanningAlgorithm<P extends IHTNPlanningProblem,S extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>>
extends CostSensitiveGraphSearchBasedPlanningAlgorithm<P,S,N,A,V>

Constructor Summary

Constructors

Constructor	Description
CostSensitiveGraphSearchBasedHTNPlanningAlgorithm(P problem, ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<P,IEvaluatedGraphSearchBasedPlan<N,A,V>,S,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>> problemTransformer, ai.libs.jaicore.basic.algorithm.IAlgorithmFactory<S,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>> baseFactory)

Method Summary

Modifier and Type	Method	Description
void	runPreCreationHook()

Methods inherited from class ai.libs.jaicore.basic.algorithm.reduction.AReducingSolutionIterator

cancel, getBaseAlgorithm, getLogger, getLoggerName, getProblemTransformer, getSolutionEvent, nextWithException, setLoggerName

Methods inherited from class ai.libs.jaicore.basic.algorithm.ASolutionCandidateIterator

call, collectAllSolutions, nextSolutionCandidate, nextSolutionCandidateEvent

Methods inherited from class ai.libs.jaicore.basic.algorithm.AAlgorithm

activate, announceTimeoutDetected, avoidReinterruptionOnShutdownOnCurrentThread, checkAndConductTermination, checkTermination, computeTimeoutAware, getActivationTime, getConfig, getId, getInput, getNumCPUs, getRemainingTimeToDeadline, getState, getTimeout, getTimeoutPrecautionOffset, hasNext, hasThreadBeenInterruptedDuringShutdown, interruptThreadAsPartOfShutdown, isCanceled, isShutdownInitialized, isStopCriterionSatisfied, isTimeouted, iterator, next, post, registerActiveThread, registerListener, resolveShutdownInterruptOnCurrentThread, setConfig, setMaxNumThreads, setNumCPUs, setState, setTimeout, setTimeout, setTimeoutPrecautionOffset, shutdown, terminate, unregisterActiveThread, unregisterThreadAndShutdown

Methods inherited from class java.lang.Object

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

Methods inherited from interface ai.libs.jaicore.basic.Cancelable

cancel

Methods inherited from interface ai.libs.jaicore.basic.algorithm.IAlgorithm

call, getConfig, getId, getInput, getNumCPUs, getTimeout, nextWithException, registerListener, setMaxNumThreads, setNumCPUs, setTimeout, setTimeout

Methods inherited from interface ai.libs.jaicore.basic.algorithm.ISolutionCandidateIterator

nextSolutionCandidate, nextSolutionCandidateEvent

Methods inherited from interface java.lang.Iterable

forEach, iterator, spliterator

Methods inherited from interface java.util.Iterator

forEachRemaining, hasNext, next, remove

Constructor Detail

CostSensitiveGraphSearchBasedHTNPlanningAlgorithm

public CostSensitiveGraphSearchBasedHTNPlanningAlgorithm(P problem,
                                                         ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<P,IEvaluatedGraphSearchBasedPlan<N,A,V>,S,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>> problemTransformer,
                                                         ai.libs.jaicore.basic.algorithm.IAlgorithmFactory<S,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V>> baseFactory)

Method Detail

runPreCreationHook

public void runPreCreationHook()

Overrides:

runPreCreationHook in class ai.libs.jaicore.basic.algorithm.reduction.AReducingSolutionIterator<P extends IHTNPlanningProblem,IEvaluatedGraphSearchBasedPlan<N,A,V extends java.lang.Comparable<V>>,S extends ai.libs.jaicore.search.probleminputs.GraphSearchInput<N,A>,ai.libs.jaicore.search.model.other.EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>>