An abstract problem instance. More...

Inheritance diagram for frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >:

[legend]

Public Member Functions
String	toString ()
String	getAgent ()
Set< String >	getVariables (final String owner)
V[]	getDomain (String var)
int	getDomainSize (String var)
Map< String, Set< String > >	getNeighborhoods ()
Map< String, Set< String > >	getAnonymNeighborhoods ()
Map< String, Set< String > >	getAnonymNeighborhoods (String agent)
Map< String, Integer >	getNeighborhoodSizes ()
Map< String, Integer >	getNeighborhoodSizes (String agent)
int	getNbrNeighbors (String var)
int	getNbrNeighbors (String var, boolean withAnonymVars)
HashSet< String >	getNeighborVars (String var)
HashSet< String >	getNeighborVars (String var, boolean withAnonymVars)
int	getNumberOfCoordinationConstraints ()
Map< String, Set< String > >	getAgentNeighborhoods ()
Map< String, Set< String > >	getAgentNeighborhoods (String agent)
Map< String, Set< String > >	getVarScopes ()
void	setAgent (String name)
	Sets the name of the agent owning this subproblem.
Set< String >	getAgents ()
Class< U >	getUtilClass ()
U	getMinInfUtility ()
U	getPlusInfUtility ()
int	getNbrVars ()
int	getNbrVars (String agent)
int	getNbrIntVars ()
Map< String, String >	getOwners ()
String	getOwner (String var)
boolean	isRandom (String var)
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces ()
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (boolean withAnonymVars)
List< ? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, boolean withAnonymVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, Set< String > forbiddenVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (String var, final boolean withAnonymVars, Set< String > forbiddenVars)
List<? extends UtilitySolutionSpace< V, U > >	getSolutionSpaces (Set< String > vars, boolean withAnonymVars, Set< String > forbiddenVars)
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments)
Set< String >	getVariables ()
Set< String >	getMyVars ()
Set< String >	getAnonymVars ()
Set< String >	getRandVars ()
Set< String >	getAllVars ()
U	getZeroUtility ()
boolean	maximize ()
void	setMaximize (final boolean maximize)
void	setUtilClass (Class< U > utilClass)
boolean	addAgent (String agent)
Map< String, Set< String > >	getNeighborhoods (String agent)
Map< String, Set< String > >	getNeighborhoods (String agent, boolean withAnonymVars, boolean onlyAnonymVars)
UtilitySolutionSpace< V, U >	addUnarySpace (String name, String var, V[] dom, U[] utils)
Public Member Functions inherited from frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable< U > >
Set< String >	getExtVars ()
boolean	addVariable (String name, String owner, String domain)
	Adds a new variable.
boolean	addVariable (String name, String owner, V[] domain)
	Adds a new variable.
void	rescale (U multiply, U add)
	Rescales the problem.
void	setDomain (String var, V[] dom)
	Sets the domain of a variable.
boolean	setOwner (String var, String owner)
	Sets the owner agent for the input variable.
List< ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpaces ()
	Returns the probability spaces in the problem.
Map< String, ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpacePerRandVar ()
	Returns the probability space of each random variable in the problem.
List< ? extends UtilitySolutionSpace< V, U > >	getProbabilitySpaces (String var)
	Returns the probability spaces involving the input variable.
void	setProbSpace (String var, Map< V, Double > prob)
	Adds to the problem a probability space for the input random variable.
boolean	removeSpace (String name)
	Removes the space with the given name.
boolean	addSolutionSpace (UtilitySolutionSpace< V, U > space)
	Adds a solution space to the problem.
UtilitySolutionSpace< V, U >	getUtility (Map< String, V > assignments, final boolean withAnonymVars)
	Computes the total utility of the input assignment to variables.
UtilitySolutionSpace< V, U >	getExpectedUtility (Map< String, V > assignments)
	Computes the expectation over the random variables of the utility for the input assignments.
UtilitySolutionSpace< V, U >	getParamUtility (Map< String[], BasicUtilitySolutionSpace< V, ArrayList< V > > > assignments)
	Computes the total utility of the input assignment to variables, conditioned on the values of parameters.
DCOPProblemInterface< V, U >	getSubProblem (String agent)
void	ground (String var, V val)
	Adds a constraint that enforces that var = val.
Public Member Functions inherited from frodo2.solutionSpaces.ProblemInterface< V, U >
void	reset (ProblemInterface< V, U > newProblem)
	Resets this problem to be the same as the input one.
void	setDomClass (Class< V > domClass)
	Sets the class to be used for variable values.
Class< V >	getDomClass ()
void	setUtilClass (Class< U > utilClass)
	Sets the class to be used for utility values.
Class< U >	getUtilClass ()
U	getZeroUtility ()
U	getPlusInfUtility ()
U	getMinInfUtility ()
String	getAgent ()
Set< String >	getAgents ()
ProblemInterface< V, U >	getSubProblem (String agent)
	Builds the subproblem description for a given agent by extracting it from the overall problem description.
boolean	multipleTypes ()
void	incrNCCCs (long incr)
	Increments the number of constraint checks.
long	getNCCCs ()
void	setNCCCs (long ncccs)
	Sets the NCCC count.

Protected Member Functions
	AbstractProblem ()
	Constructor.
	AbstractProblem (boolean maximize, boolean publicAgents, boolean mpc, boolean extendedRandNeighborhoods)
	Constructor.
Set< String >	getScope (String var)
	Returns the agent scope of the input anonymous variable.
U	getInfeasibleUtil ()
void	setVarScope (String var, Set< String > scope)
	Sets the agent scope of a shared variable.

Protected Attributes
boolean	maximize
	Whether this is a maximization or a minimization problem.
Map< String, String >	owners
	For each variable, the name of its owner agent.
Set< String >	randVars
	The random variables.
HashSet< String >	agents = new HashSet<String> ()
	The set of agents.
List< UtilitySolutionSpace< V, U > >	spaces
	The list of solution spaces.
Map< String, V[]>	domains
	The domain of each variable.
Class< U >	utilClass = (Class<U>) AddableInteger.class
	The class used for utility values.
String	agentName
	The name of the agent owning this subproblem.
final boolean	publicAgents
	Whether each agent knows the identities of all agents.
final boolean	extendedRandNeighborhoods
	If `true`, neighborhood relationships between decision variables are extended through random variables.
final boolean	mpc
	Whether to behave in MPC mode.
HashMap< String, Set< String > >	varScopes = new HashMap<String, Set<String>> ()
	For each shared variable, the names of the agents in its scope.

Private Member Functions
HashSet< String >	getAgentNeighbors (String var)
	Returns the neighboring agents of the input variable.

Static Private Attributes
static final long	serialVersionUID = -1050483109528194609L
	Used for serialization.

Detailed Description

An abstract problem instance.

Author: Thomas Leaute

Parameters

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

Constructor & Destructor Documentation

◆ AbstractProblem() [1/2]

frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.AbstractProblem ( )

protected

Constructor.

References AbstractProblem().

Referenced by AbstractProblem().

Here is the call graph for this function:

◆ AbstractProblem() [2/2]

frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.AbstractProblem	(	boolean	maximize,
		boolean	publicAgents,
		boolean	mpc,
		boolean	extendedRandNeighborhoods )

protected

Constructor.

Parameters

maximize	Whether this is a maximization or a minimization problem
publicAgents	Whether each agent knows the identities of all agents
mpc	Whether to behave in MPC mode (each agent knows the identities of all agents and knows all variables)
extendedRandNeighborhoods	Whether neighborhood relationships between decision variables are extended through random variables

References extendedRandNeighborhoods, maximize, mpc, and publicAgents.

Member Function Documentation

◆ addAgent()

boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.addAgent ( String agent )

See also: DCOPProblemInterface.addAgent(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.parse(), and frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.parse().

◆ addUnarySpace()

UtilitySolutionSpace< V, U > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.addUnarySpace	(	String	name,
		String	var,
		V[]	dom,
		U[]	utils )

See also: DCOPProblemInterface#addUnarySpace(String, String, Addable[], Addable[])

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.addSolutionSpace(), and getInfeasibleUtil().

Here is the call graph for this function:

◆ getAgent()

String frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAgent ( )

See also: DCOPProblemInterface.getAgent()

References agentName.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), getAnonymNeighborhoods(), getNeighborhoods(), and getNeighborhoodSizes().

◆ getAgentNeighborhoods() [1/2]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAgentNeighborhoods ( )

See also: DCOPProblemInterface.getAgentNeighborhoods()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References agentName, and getAgentNeighborhoods().

Referenced by getAgentNeighborhoods().

Here is the call graph for this function:

◆ getAgentNeighborhoods() [2/2]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAgentNeighborhoods ( String agent )

See also: DCOPProblemInterface.getAgentNeighborhoods(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getAgentNeighbors(), getOwner(), and getVariables().

Here is the call graph for this function:

◆ getAgentNeighbors()

HashSet< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAgentNeighbors ( String var )

private

Returns the neighboring agents of the input variable.

Parameters

var	the variable

Returns: the variable's neighboring agents

References extendedRandNeighborhoods, getOwner(), getScope(), and isRandom().

Referenced by getAgentNeighborhoods().

Here is the call graph for this function:

◆ getAgents()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAgents ( )

See also: DCOPProblemInterface.getAgents()

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), and frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem().

◆ getAllVars()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAllVars ( )

See also: DCOPProblemInterface.getAllVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getAnonymVars(), and getVariables().

Here is the call graph for this function:

◆ getAnonymNeighborhoods() [1/2]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAnonymNeighborhoods ( )

See also: DCOPProblemInterface.getAnonymNeighborhoods()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Reimplemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

References getAgent(), and getAnonymNeighborhoods().

Referenced by getAnonymNeighborhoods().

Here is the call graph for this function:

◆ getAnonymNeighborhoods() [2/2]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAnonymNeighborhoods ( String agent )

See also: DCOPProblemInterface.getAnonymNeighborhoods(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Reimplemented in frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.

References getNeighborhoods().

Here is the call graph for this function:

◆ getAnonymVars()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getAnonymVars ( )

See also: DCOPProblemInterface.getAnonymVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by getAllVars().

◆ getDomain()

V[] frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getDomain ( String var )

See also: DCOPProblemInterface.getDomain(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by getDomainSize().

◆ getDomainSize()

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getDomainSize ( String var )

See also: DCOPProblemInterface.getDomainSize(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getDomain().

Here is the call graph for this function:

◆ getInfeasibleUtil()

U frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getInfeasibleUtil ( )

protected

Returns: -INF if we are maximizing, +INF if we are minimizing

References getMinInfUtility(), and getPlusInfUtility().

Referenced by addUnarySpace(), and frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getUtility().

Here is the call graph for this function:

◆ getMinInfUtility()

U frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getMinInfUtility ( )

See also: DCOPProblemInterface.getMinInfUtility()

References utilClass.

Referenced by getInfeasibleUtil(), and setMaximize().

◆ getMyVars()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getMyVars ( )

See also: DCOPProblemInterface.getMyVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References agentName.

Referenced by getNbrIntVars().

◆ getNbrIntVars()

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNbrIntVars ( )

See also: DCOPProblemInterface.getNbrIntVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getMyVars().

Here is the call graph for this function:

◆ getNbrNeighbors() [1/2]

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNbrNeighbors ( String var )

See also: DCOPProblemInterface.getNbrNeighbors(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNbrNeighbors().

Referenced by getNbrNeighbors().

Here is the call graph for this function:

◆ getNbrNeighbors() [2/2]

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getNbrNeighbors	(	String	var,
		boolean	withAnonymVars )

See also: DCOPProblemInterface.getNbrNeighbors(java.lang.String, boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNeighborVars().

Here is the call graph for this function:

◆ getNbrVars() [1/2]

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNbrVars ( )

See also: DCOPProblemInterface.getNbrVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getVariables().

Referenced by frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

Here is the call graph for this function:

◆ getNbrVars() [2/2]

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNbrVars ( String agent )

See also: DCOPProblemInterface.getNbrVars(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getNeighborhoods() [1/3]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNeighborhoods ( )

See also: DCOPProblemInterface.getNeighborhoods()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getAgent(), and getNeighborhoods().

Referenced by getAnonymNeighborhoods(), getNeighborhoods(), getNeighborhoods(), and getNeighborhoodSizes().

Here is the call graph for this function:

◆ getNeighborhoods() [2/3]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNeighborhoods ( String agent )

See also: DCOPProblemInterface.getNeighborhoods(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNeighborhoods().

Here is the call graph for this function:

◆ getNeighborhoods() [3/3]

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getNeighborhoods	(	String	agent,
		boolean	withAnonymVars,
		boolean	onlyAnonymVars )

See also: DCOPProblemInterface.getNeighborhoods(java.lang.String, boolean, boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNeighborVars(), getVariables(), and isRandom().

Here is the call graph for this function:

◆ getNeighborhoodSizes() [1/2]

Map< String, Integer > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNeighborhoodSizes ( )

See also: DCOPProblemInterface.getNeighborhoodSizes()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getAgent(), and getNeighborhoodSizes().

Referenced by getNeighborhoodSizes().

Here is the call graph for this function:

◆ getNeighborhoodSizes() [2/2]

Map< String, Integer > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNeighborhoodSizes ( String agent )

See also: DCOPProblemInterface.getNeighborhoodSizes(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNeighborhoods().

Here is the call graph for this function:

◆ getNeighborVars() [1/2]

HashSet< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNeighborVars ( String var )

See also: DCOPProblemInterface.getNeighborVars(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getNeighborVars().

Referenced by getNbrNeighbors(), getNeighborhoods(), and getNeighborVars().

Here is the call graph for this function:

◆ getNeighborVars() [2/2]

HashSet< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getNeighborVars	(	String	var,
		boolean	withAnonymVars )

See also: DCOPProblemInterface.getNeighborVars(java.lang.String, boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References extendedRandNeighborhoods, and getOwner().

Here is the call graph for this function:

◆ getNumberOfCoordinationConstraints()

int frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getNumberOfCoordinationConstraints ( )

See also: DCOPProblemInterface.getNumberOfCoordinationConstraints()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getOwner()

String frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getOwner ( String var )

See also: DCOPProblemInterface.getOwner(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), getAgentNeighborhoods(), getAgentNeighbors(), getNeighborVars(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), getVariables(), setVarScope(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

◆ getOwners()

Map< String, String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getOwners ( )

See also: DCOPProblemInterface.getOwners()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getPlusInfUtility()

U frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getPlusInfUtility ( )

See also: DCOPProblemInterface.getPlusInfUtility()

References utilClass.

Referenced by getInfeasibleUtil(), and setMaximize().

◆ getRandVars()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getRandVars ( )

See also: DCOPProblemInterface.getRandVars()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getScope()

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getScope ( String var )

protected

Returns the agent scope of the input anonymous variable.

Parameters

var	the variable

Returns: the agent scope of the variable

References varScopes.

Referenced by getAgentNeighbors().

◆ getSolutionSpaces() [1/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getSolutionSpaces ( )

See also: DCOPProblemInterface.getSolutionSpaces()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getSolutionSpaces().

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), getSolutionSpaces(), getSolutionSpaces(), getSolutionSpaces(), getSolutionSpaces(), getSolutionSpaces(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getUtility(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

Here is the call graph for this function:

◆ getSolutionSpaces() [2/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getSolutionSpaces ( boolean withAnonymVars )

See also: DCOPProblemInterface.getSolutionSpaces(boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getSolutionSpaces().

Here is the call graph for this function:

◆ getSolutionSpaces() [3/6]

List<? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	Set< String >	vars,
		boolean	withAnonymVars,
		Set< String >	forbiddenVars )

See also: DCOPProblemInterface.getSolutionSpaces(java.util.Set, boolean, java.util.Set)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ getSolutionSpaces() [4/6]

List< ? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		boolean	withAnonymVars )

See also: DCOPProblemInterface.getSolutionSpaces(String, boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getSolutionSpaces().

Here is the call graph for this function:

◆ getSolutionSpaces() [5/6]

List<? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		final boolean	withAnonymVars,
		Set< String >	forbiddenVars )

See also: DCOPProblemInterface.getSolutionSpaces(java.lang.String, boolean, java.util.Set)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getSolutionSpaces().

Here is the call graph for this function:

◆ getSolutionSpaces() [6/6]

List<? extends UtilitySolutionSpace< V, U > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.getSolutionSpaces	(	String	var,
		Set< String >	forbiddenVars )

See also: DCOPProblemInterface.getSolutionSpaces(java.lang.String, java.util.Set)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getSolutionSpaces().

Here is the call graph for this function:

◆ getUtilClass()

Class frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getUtilClass ( )

See also: DCOPProblemInterface.getUtilClass()

References utilClass.

◆ getUtility()

UtilitySolutionSpace< V, U > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getUtility ( Map< String, V > assignments )

See also: DCOPProblemInterface.getUtility(java.util.Map)

Todo: Test this method.

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getUtility().

Referenced by getUtility().

Here is the call graph for this function:

◆ getVariables() [1/2]

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getVariables ( )

See also: DCOPProblemInterface.getVariables()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by getAgentNeighborhoods(), getAllVars(), getNbrVars(), getNeighborhoods(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), and getVariables().

◆ getVariables() [2/2]

Set< String > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getVariables ( final String owner )

See also: DCOPProblemInterface.getVariables(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getOwner(), and getVariables().

Here is the call graph for this function:

◆ getVarScopes()

Map< String, Set< String > > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getVarScopes ( )

See also: DCOPProblemInterface.getVarScopes()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References varScopes.

◆ getZeroUtility()

U frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.getZeroUtility ( )

See also: DCOPProblemInterface.getZeroUtility()

References utilClass.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getUtility().

◆ isRandom()

boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.isRandom ( String var )

See also: DCOPProblemInterface.isRandom(java.lang.String)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

Referenced by getAgentNeighbors(), getNeighborhoods(), and frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem().

◆ maximize()

boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.maximize ( )

See also: DCOPProblemInterface.maximize()

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

◆ setAgent()

void frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.setAgent ( String name )

Sets the name of the agent owning this subproblem.

Parameters

name	the name of the agent

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), and frodo2.solutionSpaces.JaCoP.JaCoPxcspParser< V extends Addable< V > >.parse().

◆ setMaximize()

void frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.setMaximize ( final boolean maximize )

See also: DCOPProblemInterface.setMaximize(boolean)

Implements frodo2.solutionSpaces.DCOPProblemInterface< V extends Addable< V >, U extends Addable >.

References getMinInfUtility(), getPlusInfUtility(), and maximize.

Here is the call graph for this function:

◆ setUtilClass()

void frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.setUtilClass ( Class utilClass )

See also: DCOPProblemInterface.setUtilClass(java.lang.Class)

References utilClass.

Referenced by frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.getSubProblem(), frodo2.algorithms.dpop.test.UTILpropagationTest >.Listener.Listener(), frodo2.algorithms.XCSPparser< V extends Addable< V >, U extends Addable >.parse(), frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable >.setUp(), frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable >.testRandom(), and frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable >.testRandom().

◆ setVarScope()

void frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable< U > >.setVarScope	(	String	var,
		Set< String >	scope )

protected

Sets the agent scope of a shared variable.

Parameters

var	the variable
scope	the names of the agents in the variable's scope

References getOwner(), and varScopes.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem().

Here is the call graph for this function:

◆ toString()

String frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.toString ( )

See also: java.lang.Object#toString()

References agentName, extendedRandNeighborhoods, mpc, publicAgents, and utilClass.

Member Data Documentation

◆ agentName

String frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.agentName

protected

The name of the agent owning this subproblem.

Referenced by getAgent(), getAgentNeighborhoods(), getMyVars(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset(), and toString().

◆ agents

HashSet<String> frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.agents = new HashSet<String> ()

protected

The set of agents.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), and frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset().

◆ domains

Map<String, V[]> frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.domains

protected

The domain of each variable.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable(), and frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset().

◆ extendedRandNeighborhoods

final boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.extendedRandNeighborhoods

protected

If true, neighborhood relationships between decision variables are extended through random variables.

In other words, for a given decision variable x, its neighborhood consists of:

the decision variables that share constraints with x (as usual),
the decision variables that are direct neighbors of any random variable that can be reached from x by a path that involves only random variables.

Referenced by AbstractProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), getAgentNeighbors(), getNeighborVars(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem(), and toString().

◆ maximize

boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.maximize

protected

Whether this is a maximization or a minimization problem.

Referenced by AbstractProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset(), setMaximize(), and frodo2.solutionSpaces.JaCoP.tests.JaCoPproblemTest< V extends Addable< V > >.solve().

◆ mpc

final boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.mpc

protected

Whether to behave in MPC mode.

In MPC mode:

each agent knows the identities of all agents;
all variables are known to all agents.

Referenced by AbstractProblem(), and toString().

◆ owners

Map<String, String> frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.owners

protected

For each variable, the name of its owner agent.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.addVariable(), and frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset().

◆ publicAgents

final boolean frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.publicAgents

protected

Whether each agent knows the identities of all agents.

Referenced by AbstractProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.clone(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.JaCoPproblem(), and toString().

◆ randVars

Set<String> frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.randVars

protected

The random variables.

Referenced by frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset().

◆ serialVersionUID

final long frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.serialVersionUID = -1050483109528194609L

staticprivate

Used for serialization.

◆ spaces

List< UtilitySolutionSpace<V, U> > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.spaces

protected

The list of solution spaces.

Referenced by frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getUtility(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.rescale(), and frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset().

◆ utilClass

Class frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.utilClass = (Class) AddableInteger.class

protected

The class used for utility values.

Referenced by getMinInfUtility(), getPlusInfUtility(), getUtilClass(), getZeroUtility(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset(), setUtilClass(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.setUtilClass(), and toString().

◆ varScopes

HashMap<String, Set<String> > frodo2.algorithms.AbstractProblem< V extends Addable< V >, U extends Addable >.varScopes = new HashMap<String, Set<String>> ()

protected

For each shared variable, the names of the agents in its scope.

Referenced by getScope(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.getSubProblem(), frodo2.solutionSpaces.JaCoP.JaCoPproblem< V extends Addable< V > >.getSubProblem(), getVarScopes(), frodo2.algorithms.Problem< V extends Addable< V >, U extends Addable >.reset(), and setVarScope().

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

src/frodo2/algorithms/AbstractProblem.java

Public Member Functions

Protected Member Functions

Protected Attributes

Private Member Functions

Static Private Attributes

Detailed Description

Constructor & Destructor Documentation

◆ AbstractProblem() [1/2]

◆ AbstractProblem() [2/2]

Member Function Documentation

◆ addAgent()

◆ addUnarySpace()

◆ getAgent()

◆ getAgentNeighborhoods() [1/2]

◆ getAgentNeighborhoods() [2/2]

◆ getAgentNeighbors()

◆ getAgents()

◆ getAllVars()

◆ getAnonymNeighborhoods() [1/2]

◆ getAnonymNeighborhoods() [2/2]

◆ getAnonymVars()

◆ getDomain()

◆ getDomainSize()

◆ getInfeasibleUtil()

◆ getMinInfUtility()

◆ getMyVars()

◆ getNbrIntVars()

◆ getNbrNeighbors() [1/2]

◆ getNbrNeighbors() [2/2]

◆ getNbrVars() [1/2]

◆ getNbrVars() [2/2]

◆ getNeighborhoods() [1/3]

◆ getNeighborhoods() [2/3]

◆ getNeighborhoods() [3/3]

◆ getNeighborhoodSizes() [1/2]

◆ getNeighborhoodSizes() [2/2]

◆ getNeighborVars() [1/2]

◆ getNeighborVars() [2/2]

◆ getNumberOfCoordinationConstraints()

◆ getOwner()

◆ getOwners()

◆ getPlusInfUtility()

◆ getRandVars()

◆ getScope()

◆ getSolutionSpaces() [1/6]

◆ getSolutionSpaces() [2/6]

◆ getSolutionSpaces() [3/6]

◆ getSolutionSpaces() [4/6]

◆ getSolutionSpaces() [5/6]

◆ getSolutionSpaces() [6/6]

◆ getUtilClass()

◆ getUtility()

◆ getVariables() [1/2]

◆ getVariables() [2/2]

◆ getVarScopes()

◆ getZeroUtility()

◆ isRandom()

◆ maximize()

◆ setAgent()

◆ setMaximize()

◆ setUtilClass()

◆ setVarScope()

◆ toString()

Member Data Documentation

◆ agentName

◆ agents

◆ domains

◆ extendedRandNeighborhoods

◆ maximize

◆ mpc

◆ owners

◆ publicAgents

◆ randVars

◆ serialVersionUID

◆ spaces

◆ utilClass

◆ varScopes