Distributed CSPs: why it is assumed a variable per agent?

Authors:
Miguel A. Salido
Affiliations:
DSIC, Technical University of Valencia, Valencia, Spain
Venue:
SARA'07 Proceedings of the 7th International conference on Abstraction, reformulation, and approximation
Year:
2007

Citing 3
Cited 3

On the conversion between non-binary constraint satisfaction problems

AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
Algorithms for Distributed Constraint Satisfaction: A Review

Autonomous Agents and Multi-Agent Systems
Editorial: Introduction: Special Issue on Distributed Constraint Satisfaction

Artificial Intelligence - Special issue: Distributed constraint satisfaction

Feasible distributed CSP models for scheduling problems

Engineering Applications of Artificial Intelligence
Review:

The Knowledge Engineering Review
Distributed constraint programming with agents

ICAIS'11 Proceedings of the Second international conference on Adaptive and intelligent systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Nowadays, many real problems can be formalized as Distributed CSPs. A distributed constraint satisfaction problem (DisCSP) is a CSP in which variables and constraints are distributed among multiple automated agents. Many researchers assume for simplicity that each agent has exactly one variable. For real distributed problem these techniques require a large amount of messages passed among agents, so these problems are very difficult to solve. In this research summary, we question why the lack of works to manage large-scale problems.