A module that waits for the root variable to compute its optimal value, and then calls for a rerooting. More...

Inheritance diagram for frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >:

[legend]

Classes
class	RootValueMsg
	The class of statistics messages containing the optimal assignment to a variable. More...

Public Member Functions
	RerootRequester (Element params, DCOPProblemInterface< V, U > problem)
	Constructor in "stats gatherer" mode.
	RerootRequester (DCOPProblemInterface< V, U > problem, Element params)
	Constructor.
U	getOptUtil ()
HashMap< String, V >	getSolution ()
void	notifyIn (Message msg)
Collection< MessageType >	getMsgTypes ()
void	setQueue (Queue queue)
void	getStatsFromQueue (Queue queue)
void	reset ()
void	setSilent (boolean silent)
Public Member Functions inherited from frodo2.communication.IncomingMsgPolicyInterface< T >
default void	notifyIn (Message msg, Object toAgent)
	Notifies the listener of an incoming message.

Private Attributes
Queue	queue
	This agent's queue.
HashMap< String, List< String > >	children = new HashMap< String, List<String> > ()
	For each internal variable, its list of children in the current DFS.
HashMap< String, Boolean >	roots = new HashMap<String, Boolean> ()
	For each internal variable, whether it is a root.
DCOPProblemInterface< V, U >	problem
	The problem.
boolean	reportStats = true
	Whether to report stats.
HashMap< String, Integer >	countdownsInit = new HashMap<String, Integer> ()
	For each internal variable, the number of variables in its constraint graph component.
HashMap< String, Integer >	countdowns = new HashMap<String, Integer> ()
	For each internal variable, the number of remaining UTIL propagations.
U	optUtil
	The total optimal utility across all constraint graph components.
int	nbrVars
	The total number of variables in the problem (in stats gatherer mode).
HashMap< String, V >	solution
	The optimal assignment to each variable.
boolean	infeasible = false
	Whether the problem has been found infeasible.

Static Private Attributes
static final MessageType	OPT_ASSIGNMENT_MSG_TYPE = new MessageType ("P3/2-DPOP", "RerootRequester", "OptAssignment")
	The type of the statistics messages containing the optimal assignment to a variable.
static final MessageType	OPT_UTIL_MSG_TYPE = new MessageType ("P3/2-DPOP", "RerootRequester", "TotalOptUtil")
	The type of the MessageWithPayload's containing the total optimal utility for one component of the constraint graph.

Detailed Description

A module that waits for the root variable to compute its optimal value, and then calls for a rerooting.

Author: Thomas Leaute

Parameters

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

Constructor & Destructor Documentation

◆ RerootRequester() [1/2]

frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.RerootRequester	(	Element	params,
		DCOPProblemInterface< V, U >	problem )

Constructor in "stats gatherer" mode.

Parameters

params	the parameters of the module
problem	the overall problem

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getDomain(), frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.getVariables(), and problem.

Here is the call graph for this function:

◆ RerootRequester() [2/2]

frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable< U > >.RerootRequester	(	DCOPProblemInterface< V, U >	problem,
		Element	params )

Constructor.

Parameters

problem	the agent's subproblem
params	the parameters of the module

References problem.

Member Function Documentation

◆ getMsgTypes()

Collection< MessageType > frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getMsgTypes ( )

See also: StatsReporter.getMsgTypes()

Implements frodo2.communication.MessageListener< T >.

References frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.OPT_UTIL_MSG_TYPE, frodo2.algorithms.dpop.UTILpropagation< Val extends Addable< Val >, U extends Addable >.OUTPUT_MSG_TYPE, frodo2.algorithms.varOrdering.dfs.DFSgeneration< V extends Addable< V >, U extends Addable >.OUTPUT_MSG_TYPE, frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable >.OUTPUT_MSG_TYPE, frodo2.algorithms.dpop.privacy.SecureRerooting< C extends Addable< C >, E extends AddableLimited< C, E >.REROOTING_REQUEST_TYPE, frodo2.algorithms.dpop.privacy.StopMsg.STOP_MSG_TYPE, and frodo2.algorithms.varOrdering.dfs.DFSgenerationWithOrder< V extends Addable< V >, U extends Addable >.VARIABLE_COUNT_TYPE.

◆ getOptUtil()

U frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getOptUtil ( )

Returns: The total optimal utility across all constraint graph components

References frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable >.getZeroUtility(), and optUtil.

Referenced by frodo2.algorithms.dpop.privacy.P3halves_DPOPsolver< V extends Addable< V > >.buildSolution().

Here is the call graph for this function:

◆ getSolution()

HashMap< String, V > frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getSolution ( )

Returns: the solution

References solution.

◆ getStatsFromQueue()

void frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.getStatsFromQueue ( Queue queue )

See also: StatsReporter.getStatsFromQueue(Queue)

Implements frodo2.algorithms.StatsReporter.

References OPT_ASSIGNMENT_MSG_TYPE, OPT_UTIL_MSG_TYPE, and queue.

◆ notifyIn()

void frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.notifyIn ( Message msg )

See also: StatsReporter.notifyIn(Message)

Implements frodo2.communication.IncomingMsgPolicyInterface< T >.

References frodo2.communication.MessageType.equals(), notifyIn(), and OPT_ASSIGNMENT_MSG_TYPE.

Referenced by notifyIn().

Here is the call graph for this function:

◆ reset()

void frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.reset ( )

See also: StatsReporter.reset()

Implements frodo2.algorithms.StatsReporter.

References problem.

◆ setQueue()

void frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.setQueue ( Queue queue )

See also: StatsReporter.setQueue(Queue)

Implements frodo2.communication.MessageListener< T >.

References queue.

◆ setSilent()

void frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.setSilent ( boolean silent )

See also: StatsReporter.setSilent(boolean)

Implements frodo2.algorithms.StatsReporter.

Member Data Documentation

◆ children

HashMap< String, List<String> > frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.children = new HashMap< String, List<String> > ()

private

For each internal variable, its list of children in the current DFS.

◆ countdowns

HashMap<String, Integer> frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.countdowns = new HashMap<String, Integer> ()

private

For each internal variable, the number of remaining UTIL propagations.

◆ countdownsInit

HashMap<String, Integer> frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.countdownsInit = new HashMap<String, Integer> ()

private

For each internal variable, the number of variables in its constraint graph component.

◆ infeasible

boolean frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.infeasible = false

private

Whether the problem has been found infeasible.

◆ nbrVars

int frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.nbrVars

private

The total number of variables in the problem (in stats gatherer mode).

◆ OPT_ASSIGNMENT_MSG_TYPE

final MessageType frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.OPT_ASSIGNMENT_MSG_TYPE = new MessageType ("P3/2-DPOP", "RerootRequester", "OptAssignment")

staticprivate

The type of the statistics messages containing the optimal assignment to a variable.

Referenced by getStatsFromQueue(), notifyIn(), and frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.RootValueMsg.RootValueMsg().

◆ OPT_UTIL_MSG_TYPE

final MessageType frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.OPT_UTIL_MSG_TYPE = new MessageType ("P3/2-DPOP", "RerootRequester", "TotalOptUtil")

staticprivate

The type of the MessageWithPayload's containing the total optimal utility for one component of the constraint graph.

Referenced by getStatsFromQueue().

◆ optUtil

U frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.optUtil

private

The total optimal utility across all constraint graph components.

Referenced by getOptUtil().

◆ problem

DCOPProblemInterface<V, U> frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.problem

private

The problem.

Referenced by RerootRequester(), RerootRequester(), and reset().

◆ queue

Queue frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.queue

private

This agent's queue.

Referenced by getStatsFromQueue(), and setQueue().

◆ reportStats

boolean frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.reportStats = true

private

Whether to report stats.

◆ roots

HashMap<String, Boolean> frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.roots = new HashMap<String, Boolean> ()

private

For each internal variable, whether it is a root.

◆ solution

HashMap<String, V> frodo2.algorithms.dpop.privacy.RerootRequester< V extends Addable< V >, U extends Addable >.solution

private

The optimal assignment to each variable.

Referenced by getSolution().

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

src/frodo2/algorithms/dpop/privacy/RerootRequester.java

Classes

Public Member Functions

Private Attributes

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ RerootRequester() [1/2]

◆ RerootRequester() [2/2]

Member Function Documentation

◆ getMsgTypes()

◆ getOptUtil()

◆ getSolution()

◆ getStatsFromQueue()

◆ notifyIn()

◆ reset()

◆ setQueue()

◆ setSilent()

Member Data Documentation

◆ children

◆ countdowns

◆ countdownsInit

◆ infeasible

◆ nbrVars

◆ OPT_ASSIGNMENT_MSG_TYPE

◆ OPT_UTIL_MSG_TYPE

◆ optUtil

◆ problem

◆ queue

◆ reportStats

◆ roots

◆ solution