FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
Loading...
Searching...
No Matches
frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > > Interface Template Reference

A general problem. More...

Inheritance diagram for frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >:

Public Member Functions

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 ()
getZeroUtility ()
getPlusInfUtility ()
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.

Detailed Description

A general problem.

Author
Brammert Ottens, Thomas Leaute, 8 jun 2010
Parameters
<V>type used for domain values
<U>type used for utility values

Member Function Documentation

◆ getAgent()

String frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.getAgent ( )
Returns
the name of the agent corresponding to this subproblem

Referenced by frodo2.algorithms.heuristics.AgentNameHeuristic.getScore(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.init(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.init(), frodo2.algorithms.maxsum.MaxSum< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.algorithms.test.SampleMASagent.notifyIn(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >.notifyIn(), frodo2.communication.Queue.run(), frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.send_token(), frodo2.communication.Queue.sendMessage(), frodo2.communication.Queue.sendMessageToMulti(), frodo2.communication.Queue.sendMessageToSelf(), frodo2.algorithms.adopt.test.ADOPTagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.localSearch.dsa.tests.DSAagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.localSearch.mgm.mgm2.tests.MGM2agentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.localSearch.mgm.tests.MGMagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.odpop.tests.ODPOPagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.odpop.tests.ODPOPagentTestBinaryDomains< V extends Addable< V >, U extends Addable< U > >.testRandom(), and frodo2.algorithms.odpop.tests.ODPOPagentTestFullDomain< V extends Addable< V >, U extends Addable< U > >.testRandom().

◆ getAgents()

Set< String > frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.getAgents ( )
Returns
the set of all agents mentioned in the problem

Referenced by frodo2.algorithms.SingleQueueAgent< Val extends Addable< Val > >.connect(), frodo2.gui.jung.JungVisualizer.drawEdges(), frodo2.algorithms.varOrdering.factorgraph.FactorGraphGen< V extends Addable< V >, U extends Addable< U > >.factorGraphToDOT(), frodo2.algorithms.mpc_discsp.MPC_DisCSP4< V extends Addable< V > >.init(), frodo2.algorithms.varOrdering.linear.CentralLinearOrdering< V extends Addable< V >, U extends Addable< U > >.init(), frodo2.algorithms.varOrdering.linear.LinearOrdering< V extends Addable< V >, U extends Addable< U > >.init(), frodo2.algorithms.dpop.test.UTILpropagationTest< U extends Addable< U > >.Listener.Listener(), frodo2.gui.jung.JungVisualizer.render(), frodo2.algorithms.adopt.test.testADOPT.test(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryTest< V extends Addable< V >, U extends Addable< U > >.test(), frodo2.algorithms.asodpop.tests.ASODPOPTest< V extends Addable< V >, U extends Addable< U > >.test(), frodo2.algorithms.odpop.tests.UTILpropagationTest< V extends Addable< V >, U extends Addable< U > >.test(), frodo2.algorithms.odpop.tests.VALUEpropagationTest< V extends Addable< V >, U extends Addable< U > >.test(), frodo2.algorithms.test.XCSPparserTest.testGetSubProblem(), frodo2.algorithms.asodpop.tests.ASODPOPagentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.asodpop.tests.ASODPOPBinaryAgentTest< V extends Addable< V >, U extends Addable< U > >.testRandom(), frodo2.algorithms.varOrdering.dfs.tests.DFSgenerationTest.testRandom(), and frodo2.algorithms.varOrdering.election.tests.VariableElectionTest< S extends Comparable< S > &Serializable >.testRandom().

◆ getDomClass()

◆ getMinInfUtility()

◆ getNCCCs()

◆ getPlusInfUtility()

◆ getSubProblem()

ProblemInterface< V, U > frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.getSubProblem ( String agent)

Builds the subproblem description for a given agent by extracting it from the overall problem description.

Parameters
agentthe name of the agent
Returns
the subproblem corresponding to agent, or null if agent owns no variable

◆ getUtilClass()

◆ getZeroUtility()

◆ incrNCCCs()

void frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.incrNCCCs ( long incr)

Increments the number of constraint checks.

Parameters
incrthe increment

Referenced by frodo2.solutionSpaces.vehiclerouting.VehicleRoutingSpace< U extends Addable< U > >.getUtility().

◆ multipleTypes()

boolean frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.multipleTypes ( )
Returns
true when agents can be of different types, and false otherwise

◆ reset()

void frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.reset ( ProblemInterface< V, U > newProblem)

◆ setDomClass()

void frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.setDomClass ( Class< V > domClass)

Sets the class to be used for variable values.

Parameters
domClassthe class for variable values

Referenced by frodo2.algorithms.dpop.test.DPOPagentTest< V extends Addable< V >, U extends Addable< U > >.setUp().

◆ setNCCCs()

void frodo2.solutionSpaces.ProblemInterface< V extends Addable< V >, U extends Addable< U > >.setNCCCs ( long ncccs)

Sets the NCCC count.

Parameters
ncccsthe NCCC count

Referenced by frodo2.communication.Queue.updateNCCCs().

◆ setUtilClass()


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