Orbital library

orbital.algorithm.template
Interface EvaluativeAlgorithm

All Superinterfaces:
AlgorithmicTemplate
All Known Subinterfaces:
HeuristicAlgorithm
All Known Implementing Classes:
AStar, BestFirstSearch, BranchAndBound, GaussSeidelDynamicProgramming, GeneralBoundingSearch, HillClimbing, IterativeBroadening, IterativeDeepening, IterativeDeepeningAStar, IterativeExpansion, LocalOptimizerSearch, MarkovDecisionProcess.DynamicProgramming, ParallelBranchAndBound, RealTimeDynamicProgramming, SimulatedAnnealing, ThresholdAccepting, WAStar

public interface EvaluativeAlgorithm
extends AlgorithmicTemplate

Interface for evaluative algorithms.

This interface provides unified access to an evaluation function (to minimize etc.) while processing.

In order to transform a maximization problem into a minimization problem use the evaluation function -f instead of f.

Author:
André Platzer

Nested Class Summary
static class EvaluativeAlgorithm.EvaluationComparator
          The canonical comparator induced by the evaluation function f(n).
 
Nested classes/interfaces inherited from interface orbital.algorithm.template.AlgorithmicTemplate
AlgorithmicTemplate.Configuration
 
Method Summary
 Function getEvaluation()
          Get the evaluation function used while processing.
 
Methods inherited from interface orbital.algorithm.template.AlgorithmicTemplate
complexity, solve, spaceComplexity
 

Method Detail

getEvaluation

Function getEvaluation()
Get the evaluation function used while processing.

Also called objective function.

Returns:
the evaluation function f:S→R used to evaluate (either utility or cost) value of states.

Orbital library
1.3.0: 11 Apr 2009

Copyright © 1996-2009 André Platzer
All Rights Reserved.