|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |
public interface LocalSearchAlgorithm<K extends AgentAction,S extends AgentState>
A local search algorithm is appropriate when the *path* to a goal state does not matter.
Implementations operate using a single current state (rather than multiple paths) and generally move only to neighbors of that state. In most cases, the paths followed by the search are not retained.
Note that a local search algorithm can be adapted to return the path by using a #solution method like that in TreeSearch.
Method Summary | |
---|---|
EvaluationFunction<K,S> |
getEvaluationFunction()
Accessor for the evaluation function. |
S |
search(SearchProblem<K,S> searchProblem)
Given a formal searchProblem description, returns a solution state (or simply a maximum that might be a solution). |
Method Detail |
---|
S search(SearchProblem<K,S> searchProblem)
searchProblem
-
EvaluationFunction<K,S> getEvaluationFunction()
|
|||||||||
PREV CLASS NEXT CLASS | FRAMES NO FRAMES | ||||||||
SUMMARY: NESTED | FIELD | CONSTR | METHOD | DETAIL: FIELD | CONSTR | METHOD |