All Classes Interface Summary Class Summary Enum Summary Exception Summary
Class |
Description |
AAnyPathInORGraphSearch<I extends org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,O extends SearchGraphPath<N,A>,N,A> |
This is a template for algorithms that aim at finding paths from a root to
goal nodes in a graph.
|
AbstractNode |
abstract class for nodeobjects which only contains a simple equals method and the id
|
AbyssTreasureModel |
the landscape is:
plateau + mountain + abyss + mountain + plateau
|
ActionPredictionFailedException |
|
AgnosticPathEvaluator<N,A> |
|
AIslandTreasureModel |
|
AlternativeNodeEvaluator<N,A,V extends java.lang.Comparable<V>> |
This node evaluator can be used
a) if there is a prioritized node evaluator that should be used unless it returns NULL
b) to realize dead-end recognition
c) to use different node evaluators in different regions of the search graph
|
AMDP<N,A,V extends java.lang.Comparable<V>> |
|
AOptimalPathInORGraphSearch<I extends org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,N,A,V extends java.lang.Comparable<V>> |
This is a template for algorithms that aim at finding paths from a root to
goal nodes in a graph.
|
ASearchExperimentDecoder<N,A,I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,java.lang.Double>,O extends org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IEvaluatedPath<N,A,java.lang.Double>,P extends org.api4.java.ai.graphsearch.problem.IOptimalPathInORGraphSearch<? extends I,? extends O,N,A,java.lang.Double>> |
|
AStar<N,A> |
A* algorithm implementation that is nothing else than BestFirst with a
specific problem input.
|
AStarEdgeCost<T,A> |
|
AStarFactory<T,A> |
|
ATreasureMeanFunction |
|
AUpdatingPolicy<N,A> |
|
AWAStarFactory<I extends GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
|
AwaStarSearch<I extends GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
This is a modified version of the AWA* algorithm for problems without admissible heuristic.
|
BackPointerPath<N,A,V extends java.lang.Comparable<V>> |
|
BalancedGraphGeneratorGenerator |
|
BalancedGraphSearchWithPathEvaluationsProblem |
|
BalanceGraphSearchProblem |
|
BasicClockModelPhaseLengthAdjuster |
|
BasicExplorationCandidateSelector<T,A,V extends java.lang.Comparable<V>> |
|
BasicUncertaintySource<T,A,V extends java.lang.Comparable<V>> |
|
BestFirst<I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
|
BestFirst.ParentDiscarding |
|
BestFirstEpsilon<T,A,W extends java.lang.Comparable<W>> |
A* algorithm implementation using the method design pattern.
|
BestFirstEvent |
|
BestFirstFactory<P extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
|
BestFirstLimitedDiscrepancySearch<I extends GraphSearchWithNodeRecommenderInput<T,A>,T,A,V extends java.lang.Comparable<V>> |
This class conducts a limited discrepancy search by running a best first algorithm with list-based node evaluations.
|
BestFirstLimitedDiscrepancySearchFactory<I extends GraphSearchWithNodeRecommenderInput<N,A>,N,A,V extends java.lang.Comparable<V>> |
|
BootstrappingPreferenceKernel<N,A> |
|
BoundPropagator<N,A> |
|
BradleyTerryEventPropertyComputer |
|
BradleyTerryPlugin |
|
BradleyTerryPluginController |
|
BradleyTerryPluginModel |
|
BradleyTerryPluginView |
|
BradleyTerryUpdate |
|
BranchAndBound<N,A> |
Branch and Bound algorithm.
|
BRUE<N,A> |
|
BRUEFactory<N,A> |
|
BRUEPolicy<N,A> |
This policy implements the BRUE algorithm presented in
|
CannibalGraphGenerator |
|
CannibalNodeGoalPredicate |
|
CannibalProblemToGraphSearchReducer |
|
ChaoticMeansTreasureModel |
In this model, the means for the islands do not follow any pattern but are just drawn randomly.
|
CombinedGammaFunction |
|
ControlledNodeEvaluationException |
Use this exception if the node evaluation was rejected on purpose.
|
CosinusDistanceComparator<T,A,V extends java.lang.Comparable<V>> |
|
CosLinGammaFunction |
|
CoveringNodeEvaluator<N,A,V extends java.lang.Comparable<V>> |
This node evaluator allows to use pair of two node evaluators of which the first is HIDDEN by the second.
|
CTPMDP |
|
CTPState |
|
CVaR |
|
CycleDetectedResult<N> |
|
DeadEndDetectedResult<N> |
|
DecoratingNodeEvaluator<N,A,V extends java.lang.Comparable<V>> |
|
DefaultBootsrapConfigurator |
|
DefaultNodeComparator<N,A,V extends java.lang.Comparable<V>> |
|
DegeneratedGraphGeneratorGenerator |
|
DegeneratedGraphSearchProblem |
|
DegeneratedGraphSearchWithPathEvaluationsProblem |
|
DelayingNodeEvaluator<N,A,V extends java.lang.Comparable<V>> |
This path evaluator can be used to artificially delay the computation of scores.
|
DepthFirstSearch<N,A> |
|
DepthFirstSearchFactory<N,A> |
|
DNGBeliefUpdate |
|
DNGBeliefUpdateEvent<N> |
|
DNGEventPropertyComputer |
|
DNGMCTS<N,A> |
|
DNGMCTSFactory<N,A> |
|
DNGMCTSPlugin |
|
DNGMCTSPluginController |
|
DNGMCTSPluginModel |
|
DNGMCTSPluginView |
|
DNGPolicy<N,A> |
This is the implementation of the DNG-algorithm (for MDPs) presented in
|
DNGQSample |
|
DNGQSampleEvent<N,A> |
|
DominatedFunnelTreasureModel |
|
DyadRankedBestFirstFactory<N,A,V extends java.lang.Comparable<V>> |
Factory for a best first search with a dyad ranked OPEN list.
|
EBehaviorForNotFullyExploredStates |
|
ECTPEdgeKnowledge |
|
Edge<T,A,V extends java.lang.Comparable<V>> |
|
EdgeCountingSolutionEvaluator<N,A> |
Uses Double to be compliant with algorithms that MUST work with double instead of Integer (such as AStar)
|
ELakeActions |
|
EnforcedExplorationOpenSelection<N,A,V extends java.lang.Comparable<V>> |
This OPEN selection allows to enforce that the search is restricted to be searched under a given node
|
EnhancedTTSPBinaryTelescopeSolutionPredicate |
|
EnhancedTTSPGraphSearchToAdditiveGraphSearchReducer |
|
EnhancedTTSPGraphSearchToUncertaintyBasedGraphSearchReducer |
|
EnhancedTTSPSimpleGraphGenerator |
|
EnhancedTTSPSimpleSolutionPredicate |
|
EnhancedTTSPSolutionPredicate |
|
EnhancedTTSPSuccessorGenerator |
|
EnhancedTTSPTelescopeGraphGenerator |
|
EnhancedTTSPToBinaryTelescopeGraphSearchReducer |
|
EnhancedTTSPToSimpleGraphSearchReducer |
|
ENodeAnnotation |
|
EnsembleMCTS<N,A> |
|
EnsembleMCTSFactory<N,A> |
|
EnsembleTreePolicy<N,A> |
|
EqualSizedIslandsModel |
|
ETaxiAction |
|
EvaluatedSearchGraphPath<N,A,V extends java.lang.Comparable<V>> |
|
EvaluatedSearchSolutionCandidateFoundEvent<N,A,V extends java.lang.Comparable<V>> |
|
FelixLakeMDP |
|
FirstInFirstOutComparator<T,A,V extends java.lang.Comparable<V>> |
|
FixedCommitmentMCTS<N,A> |
|
FixedCommitmentMCTSFactory<N,A> |
|
FixedCommitmentPolicy<N,A> |
|
FunnelTreasureModel |
|
FValueEvent<V> |
|
GammaNode<T,A> |
Node wrapper for usage in R*.
|
GeneralBestFirstEvaluationAggregation<T,A> |
|
GeneralBestFirstEvaluationOrSelector<T,A> |
|
GenericLandscapeAnalyzer<N,A> |
|
GraphBasedDistantSuccessorGenerator<N,A> |
|
GraphBasedMDP<N,A> |
|
GraphEventBus<T> |
|
GraphSanityChecker<N,A> |
|
GraphSearchInput<N,A> |
This input is provided to algorithms that should find a solution path in a graph without path cost.
|
GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformer<N,A,V extends java.lang.Comparable<V>> |
|
GraphSearchProblemInputToGraphSearchWithSubpathEvaluationInputTransformerViaRDFS<N,A,V extends java.lang.Comparable<V>> |
Takes a path search problem and uses the path evaluator as the evaluator within the random completion based node evaluator.
|
GraphSearchProblemInputToGraphSearchWithSubpathEvaluationViaUninformedness<N,A> |
|
GraphSearchSolutionCandidateFoundEvent<N,A,S extends SearchGraphPath<N,A>> |
|
GraphSearchWithNodeRecommenderInput<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluation<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluation.EdgeCostComputer<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluation.FComputer<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic.DistantSuccessorGenerator<N> |
|
GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic.PathCostEstimator<N,A> |
|
GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic.SubPathEvaluationBasedFComputer<N,A> |
|
GraphSearchWithPathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> |
In AILibs, a graph search problem always aims at identifying one or more paths from
a set of root nodes to a goal node.
|
GraphSearchWithPathEvaluationsInputBuilder<N,A,V extends java.lang.Comparable<V>> |
|
GraphSearchWithPathEvaluationsInputToGraphSearchWithSubpathEvaluationViaUninformedness<N,A> |
|
GraphSearchWithSubpathEvaluationsInput<N,A,V extends java.lang.Comparable<V>> |
Many algorithms such as best first and A* use a traversal tree to browse the underlying
graph.
|
GraphSearchWithSubpathEvaluationsInputBuilder<N,A,V extends java.lang.Comparable<V>> |
|
GraphSearchWithUncertaintyBasedSubpathEvaluationInput<N,A,V extends java.lang.Comparable<V>> |
|
GraphSeemsSaneResult |
|
GridWorldBasicGraphGenerator |
|
GridWorldHeuristic |
|
IBestFirstConfig |
|
IBestFirstQueueConfiguration<I extends GraphSearchWithSubpathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
|
IBootstrapConfigurator |
|
IBootstrappingParameterComputer |
|
IExplorationCandidateSelector<T,A,V extends java.lang.Comparable<V>> |
|
IGammaFunction |
|
IGraphDependentPolicy<N,A> |
|
IIslandModel |
Gives information about the number of islands and the id of the island to which a particular path leads.
|
ILazyRandomizableSuccessorGenerator<N,A> |
This allows to ensure that the received iterator is randomized in the desired way.
|
IllegalArgumentForPathExtensionException |
|
IMDP<N,A,V extends java.lang.Comparable<V>> |
|
IPathLikelihoodProvidingPolicy<N,A> |
|
IPathUpdatablePolicy<N,A,V extends java.lang.Comparable<V>> |
|
IPhaseLengthAdjuster |
|
IPolicy<N,A> |
|
IPreferenceKernel<N,A> |
|
IRolloutLimitDependentPolicy |
|
ISearchExperimentDecoder<N,A,I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,java.lang.Double>,O extends org.api4.java.ai.graphsearch.problem.pathsearch.pathevaluation.IEvaluatedPath<N,A,java.lang.Double>,P extends org.api4.java.ai.graphsearch.problem.IOptimalPathInORGraphSearch<? extends I,? extends O,N,A,java.lang.Double>> |
|
ISolutionDistanceMetric<T> |
|
ISuccessorGenerationRelevantRemovalNode |
|
ISyntheticGraphGeneratorBuilder |
|
ISyntheticSearchExperimentConfig |
|
ISyntheticTreasureIslandProblem |
|
IteratingGraphSearchOptimizer<I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
This is a wrapper class to turn non-optimization algorithms into (uninformed working) optimizers.
|
IteratingGraphSearchOptimizerFactory<I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,V>,N,A,V extends java.lang.Comparable<V>> |
|
ITransparentTreeNode |
|
ITreasureIslandExperimentSetConfig |
|
ITreasureModel |
|
IUCBUtilityFunction |
|
JaicoreNodeInfoGenerator<N,V extends java.lang.Comparable<V>> |
|
JasminLakeMDP |
|
KnapsackProblemGraphGenerator |
|
KnapsackToGraphSearchReducer |
|
LakeLayout |
|
LakeMDP |
|
LakeState |
|
LandscapeAnalysisCompletionTechnique |
|
LastEventBeforeTermination |
|
LimitedDiscrepancySearch<I extends GraphSearchWithNodeRecommenderInput<N,A>,N,A,V extends java.lang.Comparable<V>> |
Implementation of the algorithm presented in
|
LimitedDiscrepancySearchFactory<I extends GraphSearchWithNodeRecommenderInput<N,A>,N,A,V extends java.lang.Comparable<V>> |
|
LinearCombiningNodeEvaluator<T,A> |
|
LinearTreasureModel |
Distributes scores according to a simple linear function from the left to the right.
|
LinkedTreasureIslandPathCostGenerator |
|
MaxRolloutExperimentTerminationCriterion |
|
MaxSolutionExperimentTerminationCriterion |
|
MCTS<N,A> |
|
MCTSFactory<N,A,B extends MCTSFactory<N,A,B>> |
|
MCTSIterationCompletedEvent<N,A,V extends java.lang.Comparable<V>> |
|
MCTSPathSearch<I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,java.lang.Double>,N,A> |
|
MCTSPathSearchFactory<N,A> |
|
MDPUtils |
|
NodeAnnotationEvent<T> |
|
NodeExpansionCompletedEvent<N> |
|
NodeExpansionDescription<S,A> |
|
NodeExpansionJobSubmittedEvent<T,A,V extends java.lang.Comparable<V>> |
|
NodeLabel<A> |
|
NodeOrderList |
|
NoisyMeanTreasureModel |
In this model, every island has a mean, and the scores are distributed closely around this mean.
|
NoMoreNodesOnLevelEvent |
|
NPuzzleGoalPredicate |
|
NPuzzleGraphGenerator |
A simple generator for the normal NPuzzleProblem.
|
NPuzzleToGraphSearchReducer |
|
NQueensGoalPredicate |
|
NQueensGraphGenerator |
|
NQueensGraphSearchToGraphSearchWithSubPathEvaluationReducer |
|
NQueensGraphSearchToNodeRecommendedTreeReducer |
|
NQueensToGraphSearchReducer |
|
ObservationsUpdatedEvent<N> |
|
OpenShopGoalPredicate |
|
OpenShopGraphGenerator |
|
OpenShopGraphSearchProblem |
|
OpenShopMachineSelectionState |
|
OpenShopOperationSelectionState |
|
OpenShopState |
|
OversearchAvoidanceConfig<N,A,V extends java.lang.Comparable<V>> |
|
OversearchAvoidanceConfig.OversearchAvoidanceMode |
|
ParetoFrontVisualizer |
|
ParetoNode<T,A,V extends java.lang.Comparable<V>> |
Internal representation of nodes to maintain pareto front.
|
ParetoSelection<T,A,V extends java.lang.Comparable<V>> |
Open collection pareto front implementation.
|
PathVsSubpathNodeEvaluator<N,A,V extends java.lang.Comparable<V>> |
|
PDPuzzleGenerator |
|
PDPuzzleNode |
|
PlackettLuceMCTS<N,A> |
|
PlackettLuceMCTSFactory<N,A> |
|
PlackettLucePolicy<N,A> |
|
QueenNode |
|
RacetrackAction |
|
RacetrackMDP |
|
RacetrackReader |
|
RacetrackState |
|
RandomComparator<T,A,V extends java.lang.Comparable<V>> |
|
RandomCompletionBasedNodeEvaluator<T,A,V extends java.lang.Comparable<V>> |
|
RandomizedDepthFirstNodeEvaluator<T,A> |
|
RandomizedDepthFirstSearch<T,A> |
|
RandomSearch<N,A> |
This search randomly draws paths from the root.
|
RandomSearchFactory<N,A> |
|
RandomSearchUtil |
|
RandomTreeGoalTester |
|
RandomTreeGraphGenerator |
|
RandomTreeSearchProblem |
|
RCNEPathCompletionFailedException |
|
ReducedGraphGenerator<T,A> |
Graph generator that uses another graph generator as a basis by reducing the
graph generated by the basis generator so that it does not contain long
chains of nodes anymore, that is successors of a node are skipped while a
node only has 1 successor.
|
RelativeFunnelTreasureModel |
|
RemovedGoalNodeFromOpenEvent<N,A,V extends java.lang.Comparable<V>> |
|
RolloutAnalyzer<N> |
|
RolloutEvent<N,V extends java.lang.Comparable<V>> |
|
RolloutInfo |
|
RolloutInfoAlgorithmEventPropertyComputer |
|
RStar<I extends GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic<T,A>,T,A> |
Implementation of the R* algorithm.
|
RStarFactory<I extends GraphSearchWithNumberBasedAdditivePathEvaluationAndSubPathHeuristic<T,A>,T,A> |
|
RStarK |
k-Values (Priorities used for expansion from open.)
|
SailingLayout |
|
SailingMDP |
|
SailingMove |
|
SailingState |
|
SameGameGoalPredicate |
|
SameGameGraphGenerator |
|
SameGameGraphSearchProblem |
|
SameGameLazySuccessorGenerator |
|
SameGameNode |
|
SameGamePathEvaluator |
|
SanityCheckResult |
|
SearchExperimentDomain<B extends ai.libs.jaicore.experiments.IExperimentBuilder,I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,java.lang.Double>,N,A> |
|
SearchExperimentsProfiler |
|
SearchGraphPath<N,A> |
|
SearchProblemInputBuilder<N,A,I extends org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,B extends SearchProblemInputBuilder<N,A,I,B>> |
|
SearchRolloutBoxplotPlugin |
|
SearchRolloutBoxplotPluginController |
|
SearchRolloutBoxplotPluginModel |
|
SearchRolloutBoxplotPluginView |
|
SearchRolloutHistogramPlugin |
|
SearchRolloutHistogramPluginController |
|
SearchRolloutHistogramPluginModel |
|
SearchRolloutHistogramPluginView |
|
ShiftedSineTreasureGenerator |
|
SkippingNodeEvaluator<T,A,V extends java.lang.Comparable<V>> |
|
SolutionAnnotationEvent<T,A,V extends java.lang.Comparable<V>> |
|
SolutionEventBus<T> |
|
SPUCBPolicy<N,A> |
|
SPUCT<N,A> |
|
SPUCTFactory<N,A> |
|
StandardBestFirst<N,A,V extends java.lang.Comparable<V>> |
|
StandardBestFirstFactory<N,A,V extends java.lang.Comparable<V>> |
|
StandardExperimentSearchAlgorithmFactory<N,A,I extends org.api4.java.ai.graphsearch.problem.IPathSearchWithPathEvaluationsInput<N,A,java.lang.Double>> |
|
StandardORGraphSearchFactory<I extends org.api4.java.ai.graphsearch.problem.IPathSearchInput<N,A>,O,N,A,V extends java.lang.Comparable<V>,A2 extends org.api4.java.ai.graphsearch.problem.IPathSearch<I,O,N,A>> |
|
SubGraphGenerator<N,A> |
This is a graph generator that takes another graph generator and generates its sub-graph under a given root node
|
SubPathGraphGenerator<N,A> |
|
SuccessorComputationCompletedEvent<T,A,V extends java.lang.Comparable<V>> |
|
SyntheticDomain |
|
SyntheticExperimentDecoder |
|
SyntheticSearchExperimentBuilder<B extends SyntheticSearchExperimentBuilder<B>> |
|
SyntheticSearchProblemBuilder |
|
TAGMCTS<N,A> |
|
TAGMCTSFactory<N,A> |
|
TAGPolicy<T,A> |
|
TaxiMDP |
|
TaxiState |
|
TimeAwareNodeEvaluator<T,A,V extends java.lang.Comparable<V>> |
This class can be used to create node evaluators with a time limit for the evaluation of each node.
|
TimedLakeState |
|
TimeLoggingNodeEvaluator<T,A,V extends java.lang.Comparable<V>> |
|
TinyDepthFirstSearch<N,A> |
|
TreasureIslandSearchExperimentBuilder |
|
UCBPolicy<T,A> |
|
UCT<N,A> |
|
UCTFactory<N,A> |
|
UncertaintyExplorationOpenSelection<T,A,V extends java.lang.Comparable<V>> |
|
UncertaintyORGraphSearchFactory<N,A,V extends java.lang.Comparable<V>> |
|
UniformRandomPolicy<N,A,V extends java.lang.Comparable<V>> |
|
UUCBPolicy<N,A> |
|
UUCT<N,A> |
|
UUCTFactory<N,A> |
|
VaR |
|