Abstract
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.
Preview
Unable to display preview. Download preview PDF.
References
A. Borning, B. Freeman-Benson and M. Wilson. Constraint Hierarchies. In Lisp and Symbolic Computation, Vol. 5, pp. 223–270, 1992.
K. Chandy and L. Lamport. Distributed Snapshots: Determining Global States of Distributed Systems. ACM Transaction on Computer Systems, Vol. 3, No. 1, pp. 63–75, 1985.
S. E. Conry, K. Kuwabara, V. R. Lesser and R. A. Meyer. Multistage Negotiation for Distributed Constraint Satisfaction. IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, pp. 1462–1477, 1991.
E. C. Freuder. Partial Constraint Satisfaction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 278–283, 1989.
E. C. Freuder and R. J. Wallace. Partial Constraint Satisfaction. Artificial Intelligence, Vol. 58, No. 1–3, pp. 21–70, 1992.
K. Hirayama and J. Toyoda. Forming Coalitions for Breaking Deadlocks. In Proceedings of First International Conference on Multi-Agent Systems, pp. 155–162, 1995.
M. N. Huhns and D. M. Bridgeland. Multiagent Truth Maintenance. IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, pp. 1437–1445, 1991.
J. Larrosa and P. Meseguer. Phase Transition in MAX-CSP. In Proceedings of the Twelfth European Conference on Artificial Intelligence, pp. 190–194, 1996.
V. R. Lesser and D. D. Corkill. The Distributed Vehicle Monitoring Testbed: A Tool for Investigating Distributed Problem Solving Networks. AI Magazine, Vol. 4, No. 3, pp. 15–33, 1983.
P. Morris. The Breakout Method for Escaping from Local Minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 40–45, 1993.
K. P. Sycara, S. Roth, N. Sadeh and M. Fox. Distributed Constrained Heuristic Search. IEEE Transactions on Systems, Man and Cybernetics, Vol. 21, No. 6, pp. 1446–1461,1991.
R. J. Wallace and E. C. Freuder. Conjunctive Width Heuristics for Maximal Constraint Satisfaction. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 762–768, 1993.
M. Yokoo. Constraint Relaxation in Distributed Constraint Satisfaction Problem. In 5th International Conference on Tools with Artificial Intelligence, pp. 56–63, 1993.
M. Yokoo, E. H. Durfee, T. Ishida and K. Kuwabara.Distributed Constraint Satisfaction for Formalizing Distributed Problem Solving. In Proceedings of the Twelfth IEEE International Conference on Distributed Computing Systems, pp. 614–621,1992.
M. Yokoo and K. Hirayama. Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems. In Proceedings of Second International Conference on Multi-Agent Systems, pp. 401–408, 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Hirayama, K., Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In: Smolka, G. (eds) Principles and Practice of Constraint Programming-CP97. CP 1997. Lecture Notes in Computer Science, vol 1330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0017442
Download citation
DOI: https://doi.org/10.1007/BFb0017442
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63753-0
Online ISBN: 978-3-540-69642-1
eBook Packages: Springer Book Archive