edu.columbia.cs.coms4701.search.informed.local
Interface LocalSearchAlgorithm<K extends AgentAction,S extends AgentState>

All Known Subinterfaces:
HillClimbingSearch<K,S>, SimulatedAnnealingSearch<K,S>

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.

Version:
0.1

User: aaron Date: Sep 11, 2006 Time: 11:47:16 PM

Author:
aaron@cs
See Also:
"Russell & Norvig p110"

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

search

S search(SearchProblem<K,S> searchProblem)
Given a formal searchProblem description, returns a solution state (or simply a maximum that might be a solution).

Parameters:
searchProblem -
Returns:
a (proposed) solution state

getEvaluationFunction

EvaluationFunction<K,S> getEvaluationFunction()
Accessor for the evaluation function.

Returns:
the evaluation function used.