Distributed partial constraint satisfaction problem

Katsutoshi Hirayama, Makoto Yokoo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

119 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationPrinciples and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings
EditorsGert Smolka
PublisherSpringer Verlag
Pages222-236
Number of pages15
ISBN (Print)3540637532, 9783540637530
DOIs
Publication statusPublished - 1997
Event3rd International Conference on Principles and Practice of Constraint Programming, CP 1997 - Linz, Austria
Duration: Oct 29 1997Nov 1 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1330
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other3rd International Conference on Principles and Practice of Constraint Programming, CP 1997
CountryAustria
CityLinz
Period10/29/9711/1/97

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Distributed partial constraint satisfaction problem'. Together they form a unique fingerprint.

Cite this