|
FRODO Version 2.19.1
An open-source framework for Distributed Constraint Optimization (DCOP)
|
The information about a particular component of the constraint graph. More...
Public Member Functions | |
| String | toString () |
Private Member Functions | |
| ComponentInfo (List< List< String > > order) | |
| Constructor. | |
| ComponentInfo () | |
| Empty constructor. | |
Private Attributes | |
| ArrayList< ClusterInfo > | clusterInfos |
| Array of ClusterInfos, in the same order as in the cluster order used (i.e. | |
| HashMap< String, ClusterInfo > | infoForCluster |
| For each internal cluster in this component, its ClusterInfo. | |
| HashMap< String, Integer > | clusterIndexes = new HashMap<String, Integer> () |
| For each cluster, its index in the cluster order. | |
| String[][] | order |
| The cluster order. | |
| String[] | ids |
| Each cluster's ID. | |
| V[][] | assignments |
| The assignment to each cluster in the ordering. | |
| V[][] | bestSol |
| The best solution found so far. | |
| TreeMap< Long, V[][]> | history |
| The best known solution at various timestamps. | |
| U | ub = problem.getPlusInfUtility() |
| The cost of the best solution found so far. | |
| HashSet< String > | agents |
| The set of all agents involved in this component. | |
The information about a particular component of the constraint graph.
|
private |
Constructor.
| order | the cluster order |
References frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.convergence, and order.
|
private |
Empty constructor.
References frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.convergence.
| String frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.ComponentInfo.toString | ( | ) |
|
private |
The set of all agents involved in this component.
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.terminate().
|
private |
The assignment to each cluster in the ordering.
|
private |
The best solution found so far.
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.terminate().
|
private |
For each cluster, its index in the cluster order.
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.received_from_next(), and frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.received_from_prev().
|
private |
Array of ClusterInfos, in the same order as in the cluster order used (i.e.
this array will have null entries for external clusters)
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.received_from_next().
|
private |
The best known solution at various timestamps.
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.terminate().
|
private |
Each cluster's ID.
|
private |
For each internal cluster in this component, its ClusterInfo.
|
private |
The cluster order.
Referenced by ComponentInfo().
|
private |
The cost of the best solution found so far.
Referenced by frodo2.algorithms.synchbb.SynchBB< V extends Addable< V >, U extends Addable< U > >.terminate().