The distributed constraint satisfaction problem: Formalization and algorithms

Makoto Yokoo, Edmund H. Durfee, Toru Ishida, Kazuhiro Kuwabara

Research output: Contribution to journalArticle

452 Citations (Scopus)

Abstract

In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.

Original languageEnglish
Pages (from-to)673-685
Number of pages13
JournalIEEE Transactions on Knowledge and Data Engineering
Volume10
Issue number5
DOIs
Publication statusPublished - Dec 1 1998

Fingerprint

Constraint satisfaction problems
Artificial intelligence

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Computational Theory and Mathematics

Cite this

The distributed constraint satisfaction problem : Formalization and algorithms. / Yokoo, Makoto; Durfee, Edmund H.; Ishida, Toru; Kuwabara, Kazuhiro.

In: IEEE Transactions on Knowledge and Data Engineering, Vol. 10, No. 5, 01.12.1998, p. 673-685.

Research output: Contribution to journalArticle

Yokoo, Makoto ; Durfee, Edmund H. ; Ishida, Toru ; Kuwabara, Kazuhiro. / The distributed constraint satisfaction problem : Formalization and algorithms. In: IEEE Transactions on Knowledge and Data Engineering. 1998 ; Vol. 10, No. 5. pp. 673-685.
@article{541c58f6e3ca4373b4ec720d77ac90fb,
title = "The distributed constraint satisfaction problem: Formalization and algorithms",
abstract = "In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.",
author = "Makoto Yokoo and Durfee, {Edmund H.} and Toru Ishida and Kazuhiro Kuwabara",
year = "1998",
month = "12",
day = "1",
doi = "10.1109/69.729707",
language = "English",
volume = "10",
pages = "673--685",
journal = "IEEE Transactions on Knowledge and Data Engineering",
issn = "1041-4347",
publisher = "IEEE Computer Society",
number = "5",

}

TY - JOUR

T1 - The distributed constraint satisfaction problem

T2 - Formalization and algorithms

AU - Yokoo, Makoto

AU - Durfee, Edmund H.

AU - Ishida, Toru

AU - Kuwabara, Kazuhiro

PY - 1998/12/1

Y1 - 1998/12/1

N2 - In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.

AB - In this paper, we develop a formalism called a distributed constraint satisfaction problem (distributed CSP) and algorithms for solving distributed CSPs. A distributed CSP is a constraint satisfaction problem in which variables and constraints are distributed among multiple agents. Various application problems in Distributed Artificial Intelligence can be formalized as distributed CSPs. We present our newly developed technique called asynchronous backtracking that allows agents to act asynchronously and concurrently without any global control, while guaranteeing the completeness of the algorithm. Furthermore, we describe how the asynchronous backtracking algorithm can be modified into a more efficient algorithm called an asynchronous weak-commitment search, which can revise a bad decision without exhaustive search by changing the priority order of agents dynamically. The experimental results on various example problems show that the asynchronous weak-commitment search algorithm is, by far more, efficient than the asynchronous backtracking algorithm and can solve fairly large-scale problems.

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

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

U2 - 10.1109/69.729707

DO - 10.1109/69.729707

M3 - Article

AN - SCOPUS:0032155668

VL - 10

SP - 673

EP - 685

JO - IEEE Transactions on Knowledge and Data Engineering

JF - IEEE Transactions on Knowledge and Data Engineering

SN - 1041-4347

IS - 5

ER -