|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |
See:
Description
Interface Summary | |
---|---|
AnnealingSchedule | A simple function that returns a "temperature" controlling the probability of making suboptimal moves. |
HillClimbingSearch<K extends AgentAction,S extends AgentState> | Basic local search technique; in each step, the current node is replaced by the best neighbor. |
LocalSearchAlgorithm<K extends AgentAction,S extends AgentState> | A local search algorithm is appropriate when the *path* to a goal state does not matter. |
SimulatedAnnealingSearch<K extends AgentAction,S extends AgentState> | A version of stochastic hill climbing where some 'downhill' or non-best moves are allowed. |
R&N ch 4.3-4.4: Informed search for problems in which only the final state, not the path to the state, matters.
|
|||||||||
PREV PACKAGE NEXT PACKAGE | FRAMES NO FRAMES |