Distributed partial constraint satisfaction problem

Katsutoshi Hirayama, Makoto Yokoo

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

107 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
Publication statusPublished - Jan 1 1997
Externally publishedYes
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

Fingerprint

Constraint satisfaction problems
Constraint Satisfaction Problem
Partial
Branch-and-bound
Multi agent systems
Iterative Solution
Multi-agent Systems
Optimality
Assignment
Optimal Solution
Binary

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Hirayama, K., & Yokoo, M. (1997). Distributed partial constraint satisfaction problem. In G. Smolka (Ed.), Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings (pp. 222-236). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1330). Springer Verlag.

Distributed partial constraint satisfaction problem. / Hirayama, Katsutoshi; Yokoo, Makoto.

Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings. ed. / Gert Smolka. Springer Verlag, 1997. p. 222-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1330).

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

Hirayama, K & Yokoo, M 1997, Distributed partial constraint satisfaction problem. in G Smolka (ed.), Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1330, Springer Verlag, pp. 222-236, 3rd International Conference on Principles and Practice of Constraint Programming, CP 1997, Linz, Austria, 10/29/97.
Hirayama K, Yokoo M. Distributed partial constraint satisfaction problem. In Smolka G, editor, Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings. Springer Verlag. 1997. p. 222-236. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Hirayama, Katsutoshi ; Yokoo, Makoto. / Distributed partial constraint satisfaction problem. Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings. editor / Gert Smolka. Springer Verlag, 1997. pp. 222-236 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{0ee51aaa1c3545308591e4689ca47bca,
title = "Distributed partial constraint satisfaction problem",
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.",
author = "Katsutoshi Hirayama and Makoto Yokoo",
year = "1997",
month = "1",
day = "1",
language = "English",
isbn = "3540637532",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "222--236",
editor = "Gert Smolka",
booktitle = "Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings",
address = "Germany",

}

TY - GEN

T1 - Distributed partial constraint satisfaction problem

AU - Hirayama, Katsutoshi

AU - Yokoo, Makoto

PY - 1997/1/1

Y1 - 1997/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=84948973649&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84948973649&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:84948973649

SN - 3540637532

SN - 9783540637530

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 222

EP - 236

BT - Principles and Practice of Constraint Programming - CP 1997 - 3rd International Conference, CP 1997, Proceedings

A2 - Smolka, Gert

PB - Springer Verlag

ER -