|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use SearchEngineForIntCostFn | |
---|---|
ai.search.informed | |
ai.search.uninformed |
Uses of SearchEngineForIntCostFn in ai.search.informed |
---|
Subclasses of SearchEngineForIntCostFn in ai.search.informed | |
---|---|
class |
AStarSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space from a given initial state and guided by a heuristic function. |
class |
BestFirstSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class is a generic heuristic search engine that traverses a search space defined by an initial state and a set of available actions. |
class |
GreedySearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space from a given initial state and guided by a heuristic function. |
class |
IDAStarSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that traverses a search space using the IDA* algorithm from a given initial state. |
class |
MAStarSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space from a given initial state and guided by a heuristic function. |
class |
RandomizedAStarSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space from a given initial state and guided by a heuristic function. |
class |
RBFSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that traverses a search space from a given initial state using the recursive best-first search algorithm (RBFS). |
Uses of SearchEngineForIntCostFn in ai.search.uninformed |
---|
Subclasses of SearchEngineForIntCostFn in ai.search.uninformed | |
---|---|
class |
BidirBFSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that traverses a search space bi-directionally in breadth first order from a given initial state and a given goal state. |
class |
BreadthFirstSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space in breadth-first order from a given initial state. |
class |
DepthFirstSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space in depth-first order from a given initial state. |
class |
IDSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that traverses a search space by iterative deepening and in depth first order from a given initial state. |
class |
UniformCostSearcherForIntCostFn<S extends SearchStateForIntCostFn>
This class represents a search engine that generates a search space in ascending order of path cost from a given initial state. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |