Distributed CSPs: Why It Is Assumed a Variable per Agent?
- 428 Downloads
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.
KeywordsDistributed Constraint Satisfaction Problems
- 1.Bacchus, F., van Beek, P.: On the conversion between non-binary and binary constraint satisfaction problems. In: proceeding of AAAI-98, pp. 311–318 (1998)Google Scholar
- 2.Bessiére, C., Belaissaoui, M., Ezzahir, R., Bouyakhf, El-H.: Dischoco: A platform for distributed constraint programming. In: Proceedings of IJCAI-07 Workshop on Distributed Constraint Reasoning (2007)Google Scholar