Distributed constraint satisfaction for formalizing distributed problem solving

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

研究成果: Conference contribution

230 被引用数 (Scopus)

抄録

Viewing cooperative distributed problem solving (CDPS) as distributed constraint satisfaction provides a useful formalism for characterizing CDPS techniques. This formalism and algorithms for solving distributed constraint satisfaction problems (DCSPs) are compared. A technique called asynchronous backtracking that allows agents to act asynchronously and concurrently, in contrast to the traditional sequential backtracking techniques used in constraint satisfaction problems, is presented. Experimental results show that solving DCSPs in a distributed fashion is worthwhile when the problems solved by individual agents are loosely coupled.

本文言語English
ホスト出版物のタイトルProceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992
出版社Institute of Electrical and Electronics Engineers Inc.
ページ614-621
ページ数8
ISBN(電子版)0818628650
DOI
出版ステータスPublished - 1992 1月 1
外部発表はい
イベント12th International Conference on Distributed Computing Systems, ICDCS 1992 - Yokohama, Japan
継続期間: 1992 6月 91992 6月 12

出版物シリーズ

名前Proceedings - International Conference on Distributed Computing Systems
1992-June

Conference

Conference12th International Conference on Distributed Computing Systems, ICDCS 1992
国/地域Japan
CityYokohama
Period92/6/992/6/12

ASJC Scopus subject areas

  • ソフトウェア
  • ハードウェアとアーキテクチャ
  • コンピュータ ネットワークおよび通信

フィンガープリント

「Distributed constraint satisfaction for formalizing distributed problem solving」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル