| Abstrakt: |
The AFB BJ+ DAC∗ is the latest variant of asynchronous forward bounding algorithms used to solve Distributed Constraint Optimization Problems (DCOPs). It uses Directional Arc Consistency (DAC∗) to remove, from domains of a given DCOP, values that do not belong to its optimal solution. However, in some cases, DAC∗ does not remove all suboptimal values, which causes more unnecessary research to reach the optimal solution. In this paper, to clear more and more suboptimal values from a DCOP, we use a higher level of DAC∗ called Full Directional Arc Consistency (FDAC∗). This level is based on reapplying AC∗ several times, which gives the possibility of making more deletions and thus quickly reaching the optimal solution. Experiments on some benchmarks show that the new algorithm, AFB BJ+ FDAC∗, is better in terms of communication load and computation effort. [ABSTRACT FROM AUTHOR] |
