JChoc DisSolver - Bridging the Gap Between Simulation and Realistic Use

The development of innovative and intelligent multiagent applications based on Distributed Constraints Reasoning techniques is obviously a fastidious task, especially to tackle new combinatorial problems (e.i. distributed resource management, distributed air traffic management, Distributed Sensor Network (Béjar et al., 2005)). However, there are very few open-source platforms dedicated to solve such problems within realistic uses. Given the difficulty that researchers are facing, simplifying assumptions and simulations uses are commonly used techniques. Nevertheless, these techniques may not be able to capture all the details about the problem to be solved. Hence, transition from the simulation to the actual development context causes a loss of accuracy and robustness of the applications to be implemented. In this paper, we present preliminary results of a new distributed constraints programming platform, namely JChoc DisSolver. Thanks to the extensibility of JADE communication model and the robustness of Choco Solver, JChoc brings a new added value to Distributed Constraints Reasoning. The platform is user-friendly and the development of multiagent applications based on Constraints Programming is no longer a mystery to

[1]  Ismel Brito Rodriguez,et al.  Distributed constraint satisfaction , 2007 .

[2]  Amnon Meisels,et al.  Using additional information in DisCSPs search , 2004 .

[3]  Amnon Meisels,et al.  AgentZero: A Framework for Simulating and Evaluating Multi-agent Algorithms , 2014, Agent-Oriented Software Engineering.

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

[5]  Youssef Hamadi,et al.  Disolver : A Distributed Constraint Solver , 2003 .

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

[7]  Hiroaki Kitano,et al.  RoboCup Rescue: search and rescue in large-scale disasters as a domain for autonomous agents research , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[8]  Matthew L. Ginsberg,et al.  Dynamic Backtracking , 1993, J. Artif. Intell. Res..

[9]  Xavier Lorca,et al.  Choco: an Open Source Java Constraint Programming Library , 2008 .

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

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

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

[13]  Robert N. Lass,et al.  DCOPolis : A Framework for Simulating and Deploying Distributed Constraint Optimization Algorithms , 2007 .

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

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

[16]  Christian Bessiere,et al.  DisChoco 2: A Platform for Distributed Constraint Reasoning , 2011 .

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

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

[19]  相場亮 Distributed Constraint Satisfaction: Foundations of Cooperation in Multi - Agent Systems , 2001 .

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