论文信息 - Breaking Symmetries in Distributed Constraint Programming Problems

Breaking Symmetries in Distributed Constraint Programming Problems

Though various preprocessing techniques have been studied for improving the performance of distributed constraint satisfaction problems, no approach for detecting and breaking symmetries has been studied in depth. In this paper, we describe a method for detecting some symmetries of a given distributed problem and for exploiting them. Then, we validate it as a preprocessing method for Adopt and Dpop algorithms for some instances of the SensorDCSP problem, to find our symmetry breaker improve their performance up to 1.7 and 1.8 times respectively.

Hiroshi Nakashima | Xavier Olive

[1] Bhaskar Krishnamachari,et al. Communication and Computation in Distributed CSP Algorithms , 2002, CP.

[2] Boi Faltings,et al. A Scalable Method for Multiagent Constraint Optimization , 2005, IJCAI.

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

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

[5] Jean-François Puget,et al. Automatic Detection of Variable and Value Symmetries , 2005, CP.

[6] Meinolf Sellmann,et al. Symmetry Breaking , 2001, CP.

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

[9] Milind Tambe,et al. Preprocessing techniques for accelerating the DCOP algorithm ADOPT , 2005, AAMAS '05.

[10] Peter Jeavons,et al. Symmetry Definitions for Constraint Satisfaction Problems , 2005, Constraints.

[11] François Pachet,et al. Using Symmetry of Global Constraints to Speed up the Resolution of Constraint Satisfaction Problems , 2002 .

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