P - class of the HTN planning problemS - class of the graph search problem input to which the HTN problem is reducedN - class of the nodes in the search problemA - class of the edges in the search problemV - evaluation of solutionspublic 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 and 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) |
| Modifier and Type | Method and Description |
|---|---|
void |
runPreCreationHook() |
cancel, getBaseAlgorithm, getLogger, getLoggerName, getProblemTransformer, getSolutionEvent, nextWithException, setLoggerNamecall, collectAllSolutions, nextSolutionCandidate, nextSolutionCandidateEventactivate, 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, unregisterThreadAndShutdownclone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, waitnextSolutionCandidate, nextSolutionCandidateEventpublic 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)
public void runPreCreationHook()
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>>>