DecisionAlgorithm

Abstract Value Members

abstract def computeUtility(): Map[(T, U), DecisionSample]

Compute the utility of each parent/decision tuple and return a DecisionSample.
Compute the utility of each parent/decision tuple and return a DecisionSample. Each decision algorithm must define how this is done since it is used to set the policy for a decision. For sampling algorithms, this will me a map of parent/decision tuples to a utility and a weight for that combination. For factored algorithms, the DecisionSample will contain the exact expected utility with a weight of 1.0.
abstract def doKill(): Unit

Attributes
protected
Definition Classes
Algorithm
abstract def doResume(): Unit

Attributes
protected
Definition Classes
Algorithm
abstract def doStart(): Unit

Attributes
protected
Definition Classes
Algorithm
abstract def doStop(): Unit

Attributes
protected
Definition Classes
Algorithm

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def !=(arg0: Any): Boolean

Definition Classes
Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def ==(arg0: Any): Boolean

Definition Classes
Any
var active: Boolean

Attributes
protected
Definition Classes
Algorithm
final def asInstanceOf[T0]: T0

Definition Classes
Any
def cleanUp(): Unit

Called when the algorithm is killed.
Called when the algorithm is killed. By default, does nothing. Can be overridden.

Definition Classes
Algorithm
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@throws( classOf[java.lang.Throwable] )
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
def getUtility(p: T, d: U): DecisionSample

Get the total utility and weight for a specific value of a parent and decision
def getUtility(): Map[(T, U), DecisionSample]

Get the total utility and weight for all sampled values of the parent and decision
def hashCode(): Int

Definition Classes
AnyRef → Any
def initialize(): Unit

Called when the algorithm is started before running any steps.
Called when the algorithm is started before running any steps. By default, does nothing. Can be overridden.

Definition Classes
Algorithm
def isActive: Boolean

Definition Classes
Algorithm
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
def kill(): Unit

Kill the algorithm so that it is inactive.
Kill the algorithm so that it is inactive. It will no longer be able to provide answers.Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
final def notifyAll(): Unit

Definition Classes
AnyRef
def resume(): Unit

Resume the computation of the algorithm, if it has been stopped.
Resume the computation of the algorithm, if it has been stopped. Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
def setPolicy(e: Decision[T, U]): Unit

Sets the policy for the given decision.
Sets the policy for the given decision. This will get the computed utility of the algorithm and call setPolicy on the decision. Note there is no error checking here, so the decision in the argument must match the target decision in the algorithm
def start(): Unit

Start the algorithm and make it active.
Start the algorithm and make it active. After it returns, the algorithm must be ready to provide answers. Throws AlgorithmActiveException if the algorithm is already active.

Definition Classes
Algorithm
def stop(): Unit

Stop the algorithm from computing.
Stop the algorithm from computing. The algorithm is still ready to provide answers after it returns. Throws AlgorithmInactiveException if the algorithm is not active.

Definition Classes
Algorithm
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

trait DecisionAlgorithm[T, U] extends Algorithm

Abstract Value Members

abstract def computeUtility(): Map[(T, U), DecisionSample]

abstract def doKill(): Unit

abstract def doResume(): Unit

abstract def doStart(): Unit

abstract def doStop(): Unit

Concrete Value Members

final def !=(arg0: AnyRef): Boolean

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: AnyRef): Boolean

final def ==(arg0: Any): Boolean

var active: Boolean

final def asInstanceOf[T0]: T0

def cleanUp(): Unit

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

def finalize(): Unit

final def getClass(): Class[_]

def getUtility(p: T, d: U): DecisionSample

def getUtility(): Map[(T, U), DecisionSample]

def hashCode(): Int

def initialize(): Unit

def isActive: Boolean

final def isInstanceOf[T0]: Boolean

def kill(): Unit

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

def resume(): Unit

def setPolicy(e: Decision[T, U]): Unit

def start(): Unit

def stop(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(): Unit

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

Inherited from Algorithm

Inherited from AnyRef

Inherited from Any

Ungrouped