Balancing local resources and global goals in multiply-constrained DCOP1

Abstract

Distributed constraint optimization (DCOP) is a useful framework for cooperative multiagent coordination. DCOP focuses on optimizing a single team objective. However, in many domains, agents must satisfy constraints on resources consumed locally while optimizing the team goal. Yet, these resource constraints may need to be kept private. Designing DCOP algorithms for these domains requires managing complex trade-offs in completeness, scalability, privacy and efficiency.This article defines the multiply-constrained DCOP (MC-DCOP) framework and provides complete (globally optimal) and incomplete (locally optimal) algorithms for solving MC-DCOP problems. Complete algorithms * This paper significantly extends our previous conference paper [3]. It extends that paper by providing all the incomplete algorithms from [2], as well as additional algorithms, more detailed explanation of these new algorithms, additional experimental results and analysis, and a detailed discussion of related work. 1 find the best allocation of scarce resources while optimizing the team objective, while incomplete algorithms are more scalable. The algorithms use four main techniques: (i) transforming constraints to maintain privacy; (ii) dynamically setting upper bounds on resource consumption; (iii) identifying the extent to which the local graph structure allows agents to compute exact bounds; and (iv) using a virtual assignment to flag problems rendered unsatisfiable by resource constraints. Proofs of correctness are presented for all algorithms. Experimental results illustrate the strengths and weaknesses of both the complete and incomplete algorithms.

Research on Multi-Agent Systems in a Smart Small Grid for Resource Apportionment and Planning

“…Through the user's knowledge, the devices are completely and independently interacted by the system. It is necessary to deploy wireless sensor networks (WSN) in multi-story office building and the problems are presented that the ability to observe dynamic scenes by controlling the changes in status and the configuration [26,27]. Different types of the problem are managed by the system by deploying the agents that utilized the techniques of Information Fusion (IF).…”

A tool to prioritize code smells in distributed development

“…Lin y Miao [14] utilizan DisCSP para balancear el trabajo realizado por desarrolladores distribuidos que usan Scrum. Bowring et al [15] aplican DisCSP para acordar reuniones de un grupo distribuido. Herbsleb et al [16] modelan la coordinación de decisiones en un proceso de desarrollo de software como un problema de satisfacción de restricciones distribuido.…”