Package search
Class AStarSearcher.SimpleNodes<State>
java.lang.Object
search.GraphSearcher<State,Node,Frontier>
search.PriorityQueueSearcher<State,Node,Frontier>
search.AStarFrontierSearcher<State,Node,Frontiers.PriorityQueue<Node>>
search.AStarSearcher<State,Nodes.SimpleTreeCostNode<State>>
search.AStarSearcher.SimpleNodes<State>
- Type Parameters:
State
- Type representing elements of the search space.
- Enclosing class:
- AStarSearcher<State,Node extends SearchTreeNode<Node,State> & KnowsOwnCost>
public static class AStarSearcher.SimpleNodes<State> extends AStarSearcher<State,Nodes.SimpleTreeCostNode<State>>
A specialization of
AStarSearcher
to use a minimal
implementation of unrelated search tree nodes (with a state and
accumulated cost only), with the frontier implementation still
exposed as a type parameter.-
Nested Class Summary
Nested classes/interfaces inherited from class search.AStarSearcher
AStarSearcher.PathNodes<State>, AStarSearcher.SimpleNodes<State>
-
Constructor Summary
Constructors Constructor Description SimpleNodes(Predicate<State> stateTest, Function<State,Double> heuristic, Function<State,Iterable<Nodes.CostAndStep<State>>> expander)
Constructor for this class which does not maintain an explored set.SimpleNodes(Predicate<State> stateTest, Function<State,Double> heuristic, Function<State,Object> hashArtifactBuilder, Function<State,Iterable<Nodes.CostAndStep<State>>> expander)
Constructor for this class which maintains an explored set using a hashing of the state representations. -
Method Summary
Methods inherited from class search.AStarFrontierSearcher
debugFrontierAddition, debugFrontierRemoval
Methods inherited from class search.GraphSearcher
debugExpansion, debugFrontier, debugFrontierExhausted, debugFrontierNonaddition, debugGoalFound, debugInitialNode, getDebug, getLastAddedToFrontier, getLastExpandedFromFrontier, getLastNotAddedToFrontier, getLastUnexpandedInFrontier, search, setDebug, solvable
-
Constructor Details
-
SimpleNodes
public SimpleNodes(Predicate<State> stateTest, Function<State,Double> heuristic, Function<State,Iterable<Nodes.CostAndStep<State>>> expander)Constructor for this class which does not maintain an explored set.- Parameters:
stateTest
- A boolean-returning function checking whether a state space element is a goal state.heuristic
- Heuristic function for this search application.expander
- Generates the successor states from some state, each associated with a cost.
-
SimpleNodes
public SimpleNodes(Predicate<State> stateTest, Function<State,Double> heuristic, Function<State,Object> hashArtifactBuilder, Function<State,Iterable<Nodes.CostAndStep<State>>> expander)Constructor for this class which maintains an explored set using a hashing of the state representations.- Parameters:
stateTest
- A boolean-returning function checking whether a state space element is a goal state.heuristic
- Heuristic function for this search application.hashArtifactBuilder
- Generates a hashable object from a state element.expander
- Generates the successor states from some state, each associated with a cost.
-