Distributed Partial Constraint Satisfaction Problem

Many problems in multi-agent systems can be described as distributed Constraint Satisfaction Problems (distributed CSPs), where the goal is to find a set of assignments to variables that satisfies all constraints among agents. However, when real problems are formalized as distributed CSPs, they are often over-constrained and have no solution that satisfies all constraints. This paper provides the Distributed Partial Constraint Satisfaction Problem (DPCSP) as a new framework for dealing with over-constrained situations. We also present new algorithms for solving Distributed Maximal Constraint Satisfaction Problems (DMCSPs), which belong to an important class of DPCSP. The algorithms are called the Synchronous Branch and Bound (SBB) and the Iterative Distributed Breakout (IDB). Both algorithms were tested on hard classes of over-constrained random binary distributed CSPs. The results can be summarized as SBB is preferable when we are mainly concerned with the optimality of a solution, while IDB is preferable when we want to get a nearly optimal solution quickly.

[1]  Leslie Lamport,et al.  Distributed snapshots: determining global states of distributed systems , 1985, TOCS.

[2]  Eugene C. Freuder,et al.  Conjunctive Width Heuristics for Maximal Constraint Satisfaction , 1993, AAAI.

[3]  Makoto Yokoo,et al.  Distributed constraint satisfaction algorithm for complex local problems , 1998, Proceedings International Conference on Multi Agent Systems (Cat. No.98EX160).

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

[5]  Richard J. Wallace,et al.  Partial Constraint Satisfaction , 1989, IJCAI.

[6]  Katsutoshi Hirayama,et al.  Forming Coalitions for Breaking Deadlocks , 1995, ICMAS.

[7]  Victor R. Lesser,et al.  The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks , 1983, AI Mag..

[8]  Norman M. Sadeh,et al.  Distributed constrained heuristic search , 1991, IEEE Trans. Syst. Man Cybern..

[9]  Michael N. Huhns,et al.  Multiagent truth maintenance , 1991, IEEE Trans. Syst. Man Cybern..

[10]  Bjørn N. Freeman-Benson,et al.  Constraint hierarchies , 1987, OOPSLA '87.

[11]  Javier Larrosa,et al.  Phase Transition in MAX-CSP , 1996, ECAI.

[12]  Makoto Yokoo Constraint relaxation in distributed constraint satisfaction problems , 1993, Proceedings of 1993 IEEE Conference on Tools with Al (TAI-93).

[13]  Paul Morris,et al.  The Breakout Method for Escaping from Local Minima , 1993, AAAI.

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

[15]  A. Rosenfeld,et al.  IEEE TRANSACTIONS ON SYSTEMS , MAN , AND CYBERNETICS , 2022 .

[16]  Victor R. Lesser,et al.  Multistage negotiation for distributed constraint satisfaction , 1991, IEEE Trans. Syst. Man Cybern..