|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
AStarSearchStrategy<K extends AgentAction,S extends AgentState> | A type of best-first search strategy which attempts to expand the node with the lowest estimated total cost from the root, through the node, to a goal state. |
BestFirstSearchStrategy<K extends AgentAction,S extends AgentState> | A search strategy which selects the node for expansion based on an evaluation function f(n). |
EvaluationFunction<K extends AgentAction,S extends AgentState> | A function f(n) which rates nodes on whether they should be expanded next; nodes with lower f(n) will generally be expanded first. |
GreedyBestFirstSearchStrategy<K extends AgentAction,S extends AgentState> | A type of best-first search strategy which tries to expand the node that is closest to the goal. |
HeuristicFunction<K extends AgentAction,S extends AgentState,P extends SearchProblem<K,S>> | A problem-specific function h(n) = the estimated cost of the cheapest path from node n to a goal node. |
InformedSearchAlgorithm<K extends AgentAction,S extends AgentState> | A general interface for search algorithms that rely on an evaluation function. |
IterativeDeepeningAStarSearch<K extends AgentAction,S extends AgentState> | An informed search algorithm that applies iterative deepening to the heuristic search context. |
RecursiveBestFirstSearch<K extends AgentAction,S extends AgentState> | A simple recursive informed search algorithm that attempts to mimic the operation of standard best-first search, but using only linear space. |
Exception Summary | |
---|---|
RecursiveBestFirstSearchFailureException | A failure of a recursive best-first search due to a path exceeding the beset alternative f-cost available elsewhere. |
R&N ch 4: Search with heuristics.
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |