Communication-constrained DCOPs: message approximation in GDL with function filtering
نویسندگان
چکیده
In this paper we focus on solving DCOPs in communication constrained scenarios. The GDL algorithm optimally solves DCOP problems, but requires the exchange of exponentially large messages which makes it impractical in such settings. Function filtering is a technique that alleviates this high communication requirement while maintaining optimality. Function filtering involves calculating approximations of the exact cost functions exchanged by GDL. In this work, we explore different ways to compute such approximations, providing a novel method that empirically achieves significant communication savings.
منابع مشابه
Improving function filtering for computationally demanding DCOPs
In this paper we focus on solving DCOPs in computationally demanding scenarios. GDL optimally solves DCOPs, but requires exponentially large cost functions, being impractical in such settings. Function filtering is a technique that reduces the size of cost functions. We improve the effectiveness of function filtering to reduce the amount of resources required to optimally solve DCOPs. As a resu...
متن کاملProving the equivalence of Action-GDL and DPOP
Distributed Constraint Optimization Problems (DCOPs) are a general framework that can model a large class of Multi-agent Coordination Problems (MCPs). We propose a novel message-passing algorithm, the so-called Action-GDL, as an extension to the Generalized Distributive Law algorithm to efficiently solve MCPs. We show the generality of Action-GDL by proving that it has DPOP, the low-complexity,...
متن کاملMulti-Agent Coordination: DCOPs and Beyond
Distributed constraint optimization problems (DCOPs) are a model for representing multi-agent systems in which agents cooperate to optimize a global objective. The DCOP model has two main advantages: it can represent a wide range of problem domains, and it supports the development of generic algorithms to solve them. Firstly, this paper presents some advances in both complete and approximate DC...
متن کاملGeneralizing DPOP: Action-GDL, a new complete algorithm for DCOPs
In this paper we made three main contributions (fully detailed in [5]). Firstly, we formulate a new algorithm, the so-called Action-GDL, that takes inspiration from GDL [1], extending and applying it to Distributed Constraint Optimization Problems (DCOPs). Secondly, we show the generality of Action-GDL showing how it generalizes DPOP[4], one of the low complexity, state-of-the-art algorithm to ...
متن کاملOn Message-Passing, MAP Estimation in Graphical Models and DCOPs
The maximum a posteriori (MAP) estimation problem in graphical models is a problem common in many applications such as computer vision and bioinformatics. For example, they are used to identify the most likely orientation of proteins in protein design problems. As such, researchers in the machine learning community have developed a variety of approximate algorithms to solve them. On the other h...
متن کامل