frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > > Class Template Reference

A version of the SamplingPhase in which the sampling for all random variables is performed at the roots. More...

Inheritance diagram for frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >:

Public Member Functions
	AtRoots ()
	Empty constructor.
	AtRoots (Element parameters, DCOPProblemInterface< V, U > problem)
	Constructor in statistics gatherer mode.
	AtRoots (DCOPProblemInterface< V, U > problem, Element parameters)
	Constructor.
void	notifyIn (Message msg)
Public Member Functions inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >
	AtLCAs ()
	Nullary constructor.
void	notifyIn (Message msg)

Protected Member Functions
void	proposeSamples (String var, NodeInfo nodeInfo)
Protected Member Functions inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >
void	init ()
Map< V, Double >	combineSamples (Map< V, Double > samples1, Map< V, Double > samples2)
	Merges two sample sets and then reduces the result.
LCAmsg1	newPhase1msg (String node, NodeInfo nodeInfo)
void	proposeSamples (String var, NodeInfo nodeInfo)
	Sample all random variables linked to the current variable, and add them to the proposed samples for this variable.
void	terminatePhase2 (String node, NodeInfo nodeInfo, Set< String > pendingFlags)
void	sendOutput (String node, NodeInfo nodeInfo)

Additional Inherited Members
Protected Attributes inherited from frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >
Collection< String >	allRandVars
	The random variables in the problem.
WhereToProject	whereToProject
	Where random variables are being projected out.
HashMap< String, HashMap< String, Map< V, Double > > >	samples
	For each decision variable, for each random variable, a set of proposed sample values.
HashMap< String, Map< V, Double > >	finalSamples
	For each random variable, the final set of samples chosen.

Detailed Description

A version of the SamplingPhase in which the sampling for all random variables is performed at the roots.

Parameters

<V>	the type used for variable values
<U>	the type used for utility values

Constructor & Destructor Documentation

AtRoots() [1/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.AtRoots

(

)

Empty constructor.

AtRoots() [2/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.AtRoots	(	Element	parameters,
		DCOPProblemInterface< V, U >	problem )

Constructor in statistics gatherer mode.

Parameters

problem	the overall problem
parameters	the parameters

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.problem, and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject.ROOTS.

AtRoots() [3/3]

frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.AtRoots	(	DCOPProblemInterface< V, U >	problem,
		Element	parameters )

Constructor.

Parameters

problem	this agent's problem
parameters	the parameters

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.problem, and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.WhereToProject.ROOTS.

Member Function Documentation

notifyIn()

void frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.notifyIn

(

Message

msg

)

See also

SamplingPhase.AtLCAs.notifyIn(Message)

References frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.allFlags, frodo2.communication.MessageType.equals(), frodo2.algorithms.dpop.stochastic.LCAmsg1.getDest(), frodo2.algorithms.dpop.stochastic.LCAmsg1.getFlags(), frodo2.communication.Message.getType(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.infos, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >.init(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.lcas, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.myFlags, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.parent, frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.PHASE1_MSG_TYPE, and frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.phase1msgs.

Here is the call graph for this function:

proposeSamples()

void frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtRoots< V extends Addable< V >, U extends Addable< U > >.proposeSamples ( String var, NodeInfo nodeInfo )

protected

See also

SamplingPhase.AtLCAs.proposeSamples(java.lang.String, LowestCommonAncestors.NodeInfo)

References frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >.allRandVars, frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >.combineSamples(), frodo2.algorithms.dpop.stochastic.LowestCommonAncestors.NodeInfo.myFlags, and frodo2.algorithms.dpop.stochastic.SamplingPhase< V extends Addable< V >, U extends Addable< U > >.AtLCAs< V, U >.samples.

Here is the call graph for this function:

---

The documentation for this class was generated from the following file:

• src/frodo2/algorithms/dpop/stochastic/SamplingPhase.java