Advertisement

Distributed partial constraint satisfaction problem

  • Katsutoshi Hirayama
  • Makoto Yokoo
Session 4
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1330)

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.

Unable to display preview. Download preview PDF.

References

  1. 1.
    A. Borning, B. Freeman-Benson and M. Wilson. Constraint Hierarchies. In Lisp and Symbolic Computation, Vol. 5, pp. 223–270, 1992.Google Scholar
  2. 2.
    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.Google Scholar
  3. 3.
    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.Google Scholar
  4. 4.
    E. C. Freuder. Partial Constraint Satisfaction. In Proceedings of the Eleventh International Joint Conference on Artificial Intelligence, pp. 278–283, 1989.Google Scholar
  5. 5.
    E. C. Freuder and R. J. Wallace. Partial Constraint Satisfaction. Artificial Intelligence, Vol. 58, No. 1–3, pp. 21–70, 1992.Google Scholar
  6. 6.
    K. Hirayama and J. Toyoda. Forming Coalitions for Breaking Deadlocks. In Proceedings of First International Conference on Multi-Agent Systems, pp. 155–162, 1995.Google Scholar
  7. 7.
    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.Google Scholar
  8. 8.
    J. Larrosa and P. Meseguer. Phase Transition in MAX-CSP. In Proceedings of the Twelfth European Conference on Artificial Intelligence, pp. 190–194, 1996.Google Scholar
  9. 9.
    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.Google Scholar
  10. 10.
    P. Morris. The Breakout Method for Escaping from Local Minima. In Proceedings of the Eleventh National Conference on Artificial Intelligence, pp. 40–45, 1993.Google Scholar
  11. 11.
    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.Google Scholar
  12. 12.
    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.Google Scholar
  13. 13.
    M. Yokoo. Constraint Relaxation in Distributed Constraint Satisfaction Problem. In 5th International Conference on Tools with Artificial Intelligence, pp. 56–63, 1993.Google Scholar
  14. 14.
    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.Google Scholar
  15. 15.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Katsutoshi Hirayama
    • 1
  • Makoto Yokoo
    • 2
  1. 1.Kobe University of Mercantile MarineKobeJapan
  2. 2.NTT Communication Science LaboratoriesKyotoJapan

Personalised recommendations