Improving DPOP with function filtering
نویسندگان
چکیده
DPOP is an algorithm for distributed constraint optimization which has, as main drawback, the exponential size of some of its messages. Recently, some algorithms for distributed cluster tree elimination have been proposed. They also suffer from exponential size messages. However, using the strategy of cost function filtering, in practice these algorithms obtain important reductions in maximum message size and total communication cost. In this paper, we explain the relation between DPOP and these algorithms, and show how cost function filtering can be combined with DPOP. We present experimental evidence of the benefits of this new approach.
منابع مشابه
Improving DPOP with Branch Consistency for Solving Distributed Constraint Optimization Problems
The DCOP model has gained momentum in recent years thanks to its ability to capture problems that are naturally distributed and cannot be realistically addressed in a centralized manner. Dynamic programming based techniques have been recognized to be among the most effective techniques for building complete DCOP solvers (e.g., DPOP). Unfortunately, they also suffer from a widely recognized draw...
متن کاملVariations in topology and magnetic properties of hepta- and octacyanometallates of molybdenum with manganese(II).
Treatment of [Mn(dpop)(H2O)2]Cl2 (dpop = 2,13-dimethyl-3,6,9,12,18-pentaazabicyclo-[12.3.1]octadeca-1(18),2,12,14,16-pentaene) with K4[Mo(CN)7]·2H2O under varied synthetic conditions afforded four different compounds: {[Mn(dpop)]4[(dpop)Mn(H2O)]2[Mo(III)(CN)7]3·27H2O}n (1), {[(dpop)Mn(H2O)][Mo(III)(CN)7][Mn(dpop)]3[Mo(IV)(CN)8]·29H2O}n (2), {[(dpop)Mn(H2O)]2[Mo(IV)(CN)8]2[Mn(dpop)]4[Mo(III)(CN)...
متن کاملMB-DPOP: A New Memory-Bounded Algorithm for Distributed Optimization
In distributed combinatorial optimization problems, dynamic programming algorithms like DPOP ([Petcu and Faltings, 2005]) require only a linear number of messages, thus generating low communication overheads. However, DPOP’s memory requirements are exponential in the induced width of the constraint graph, which may be prohibitive for problems with large width. We present MB-DPOP, a new hybrid a...
متن کاملH-DPOP: Using Hard Constraints to Prune the Search Space
In distributed constraint optimization problems, dynamic programming methods have been recently introduced (e.g. DPOP [9]). These methods group many valuations together in fewer (and also larger) messages, as opposed to sending them individually. Therefore, they have the important advantage that they produce small communication overheads. However, the maximum message size is always exponential ...
متن کاملPC-DPOP: A Partial Centralization Extension of DPOP
A number of algorithms have been recently proposed for distributed constraint optimization problems (DCOP). Fully decentralized examples include ADOPT [11] (search) or DPOP [12] (dynamic programming). Difficult optimization problems have been shown to require important amounts of communication when these algorithms are used (large number of small messages for ADOPT, or few but large messages fo...
متن کامل