DisChoco 2: A Platform for Distributed Constraint Reasoning

Distributed constraint reasoning is a powerful concept to model and solve naturally distributed constraint satisfaction/optimization problems. However, there are very few open-source tools dedicated to solve such problems: DisChoco, DCOPolis and FRODO. A distributed constraint reasoning platform must have some important features: It should be reliable and modular in order to be easy to personalize and extend, be independent of the communication system, allow the simulation of agents on a single virtual machine, make it easy for deployment on a real distributed framework, and allow agents with a local complex problems. This paper presents DisChoco 2.0, a complete redesign of the DisChoco platform that guarantees these features and that can deal both with distributed constraint satisfaction problems and with distributed constraint optimization problems.

[1]  Radoslaw Szymanek,et al.  FRODO 2.0: An Open-Source Framework for Distributed Constraint Optimization , 2009, IJCAI 2009.

[2]  Carmel Domshlak,et al.  Sensor networks and distributed CSP: communication, computation and complexity , 2005, Artif. Intell..

[3]  Amnon Meisels,et al.  Message delay and DisCSP search algorithms , 2006, Annals of Mathematics and Artificial Intelligence.

[4]  Amnon Meisels,et al.  Asynchronous Forward Bounding for Distributed COPs , 2014, J. Artif. Intell. Res..

[5]  Makoto Yokoo,et al.  Algorithms for Distributed Constraint Satisfaction: A Review , 2000, Autonomous Agents and Multi-Agent Systems.

[6]  Robert N. Lass,et al.  DCOPolis: a framework for simulating and deploying distributed constraint reasoning algorithms , 2008, AAMAS.

[7]  Amnon Meisels,et al.  Asynchronous Forward-checking for DisCSPs , 2007, Constraints.

[8]  Eugene C. Freuder,et al.  Constraint - based multi - agent meeting scheduling: Effects of agent heterogeneity on performance a , 2002 .

[9]  Katia P. Sycara,et al.  No-commitment branch and bound search for distributed constraint optimization , 2006, AAMAS '06.

[10]  Christian Bessiere,et al.  Dynamic Backtracking for Distributed Constraint Optimization , 2008, ECAI.

[11]  Sven Koenig,et al.  BnB-ADOPT: an asynchronous branch-and-bound DCOP algorithm , 2008, AAMAS.

[12]  Makoto Yokoo,et al.  Adopt: asynchronous distributed constraint optimization with quality guarantees , 2005, Artif. Intell..

[13]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[14]  M. Yokoo,et al.  Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems , 1996 .

[15]  Amnon Meisels,et al.  Comparing performance of distributed constraints process ing algorithms , 2002 .

[16]  Pedro Meseguer,et al.  Connecting ABT with Arc Consistency , 2008, CP.

[17]  Amnon Meisels,et al.  Distributed constraint satisfaction with partially known constraints , 2009, Constraints.

[18]  Christian Bessiere,et al.  Asynchronous backtracking without adding links: a new member in the ABT family , 2005, Artif. Intell..

[19]  Ismel Brito.  Synchronous, Asynchronous and Hybrid Algorithms for DisCSP , 2004, CP.

[20]  Christian Bessiere,et al.  Asynchronous Inter-Level Forward-Checking for DisCSPs , 2009, CP.

[21]  C. Bessiere,et al.  DisChoco : A platform for distributed constraint programming , 2006 .

[22]  Makoto Yokoo,et al.  The Distributed Constraint Satisfaction Problem: Formalization and Algorithms , 1998, IEEE Trans. Knowl. Data Eng..

[23]  Makoto Yokoo,et al.  Distributed constraint satisfaction for formalizing distributed problem solving , 1992, [1992] Proceedings of the 12th International Conference on Distributed Computing Systems.