Package ai.libs.jaicore.search.problemtransformers

Class GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS<N,A,V extends java.lang.Comparable<V>>

java.lang.Object

ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<N,A,V>

ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS<N,A,V>

Type Parameters:

N - node type

A - arc type

V - type of node evaluations

All Implemented Interfaces:

ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,EvaluatedSearchGraphPath<N,A,V>,GraphSearchWithSubpathEvaluationsInput<N,A,V>,EvaluatedSearchGraphPath<N,A,V>>

public class GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS<N,A,V extends java.lang.Comparable<V>>
extends GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<N,A,V>

Takes a path search problem and uses the path evaluator as the evaluator within the random completion based node evaluator.

Constructor Summary

Constructors

Constructor	Description
GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS(org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> preferredNodeEvaluator, java.util.function.Predicate<N> prioritizedNodesInRandomCompletion, java.util.Random random, int numSamples, int timeoutForSingleCompletionEvaluationInMS, int timeoutForNodeEvaluationInMS)

Method Summary

Modifier and Type	Method	Description
GraphSearchWithSubpathEvaluationsInput<N,A,V>	encodeProblem(org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A> problem)
org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V>	getCoveringNodeEvaluator()
int	getNumSamples()
org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V>	getPreferredNodeEvaluator()
java.util.function.Predicate<N>	getPrioritizedNodePredicatesForRandomCompletion()
void	setCoveringNodeEvaluator(org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> coveringNodeEvaluator)

Methods inherited from class ai.libs.jaicore.search.problemtransformers.GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer

decodeSolution, getNodeEvaluator, setNodeEvaluator

Methods inherited from class java.lang.Object

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

Constructor Detail

GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS

public GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS(org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> preferredNodeEvaluator,
                                                                                        java.util.function.Predicate<N> prioritizedNodesInRandomCompletion,
                                                                                        java.util.Random random,
                                                                                        int numSamples,
                                                                                        int timeoutForSingleCompletionEvaluationInMS,
                                                                                        int timeoutForNodeEvaluationInMS)

Parameters:

preferredNodeEvaluator - Node evaluator that should be used prior to adopting random completions

prioritizedNodesInRandomCompletion - Predicate that evaluates to true for nodes that should be perferred when drawing random completions

random - Random source

numSamples - Number of random completions

timeoutForSingleCompletionEvaluationInMS -

timeoutForNodeEvaluationInMS -

Method Detail

getPreferredNodeEvaluator

public org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> getPreferredNodeEvaluator()

getPrioritizedNodePredicatesForRandomCompletion

public java.util.function.Predicate<N> getPrioritizedNodePredicatesForRandomCompletion()

getNumSamples

public int getNumSamples()

encodeProblem

public GraphSearchWithSubpathEvaluationsInput<N,A,V> encodeProblem(org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A> problem)

Specified by:

encodeProblem in interface ai.libs.jaicore.basic.algorithm.reduction.AlgorithmicProblemReduction<org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>,GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>>,EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>>>

Overrides:

encodeProblem in class GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<N,A,V extends java.lang.Comparable<V>>

getCoveringNodeEvaluator

public org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> getCoveringNodeEvaluator()

setCoveringNodeEvaluator

public void setCoveringNodeEvaluator(org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IPathEvaluator<N,A,V> coveringNodeEvaluator)